Partially Preemptible Hash Joins

@inproceedings{Pang1993PartiallyPH,
  title={Partially Preemptible Hash Joins},
  author={HweeHwa Pang and Michael J. Carey and Miron Livny},
  year={1993}
}
With the advent of real-time and goal-oriented database systems, priority scheduling is likely to be an important feature in future database management systems. A consequence of priority scheduling is that a transaction may lose its buffers to higher-priority transactions, and may be given additional memory when higher-priority transactions leave the system. Due to their heavy reliance on main memory, hash joins are especially vulnerable to fluctuations in memory availability. Previous studies… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Partially Preemptible Hash Joins

  • H. Pang, M. J. Carey, M. Livny
  • Proc. of the ACM 1993 SIGMOD Conf., May
  • 1993
1 Excerpt

4(3)

  • Real-Time Systems
  • Special Issue on Real-Time Databases, September
  • 1992

DeNet User’s Guide

  • M. Livny
  • Version 1.5", Computer Sciences Department…
  • 1990
1 Excerpt

Similar Papers

Loading similar papers…