A HIGH-PERFORMANCE SCHEDULER FOR JOIN QUERIES EXECUTION OVER GRID

Charalampos Manifavas, Nikos Papadakis, Antonis Misargopoulos, and Maria Psaraki

References

  1. [1] I. Foster and C. Kesselman, The Grid: Blueprint for a new computing infrastructure, 2nd ed. (San Francisco, CA: Morgan-Kaufmann, 2003).
  2. [2] R. Elmasri and S.B. Navathe, Fundamentals of database systems, 2nd ed. (CA: The Benjamin/Cummings Publishing Company Inc., 1994).
  3. [3] I. Foster and C. Kesselman, The Globus project: A status report, Proc. Heterogeneous Computing Workshop, IEEE Press (reprinted in Future Generation Computer Science), 1998, 4–18.
  4. [4] A. Misargopoulos, A framework for high performance relational join queries scheduling in distributed database systems over grid architectures, Master Thesis, Computer Science Department, University of Crete, April 2005.
  5. [5] M. Jang, and J.-W. Chang, A grid-based approximate K-NN query processing algorithm for privacy protection in location-based services, Grid and Pervasive Computing, Springer Berlin Heidelberg, 2013, 526–535.
  6. [6] P. Mishra and M.H. Eich, Join processing in relational databases, ACM Computing Surveys (CSUR), 24(1), 1992, 63–113.
  7. [7] D. Schneider and D.J. DeWitt, A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment, Proc. ACM SIGMOD Int. Conf. on Management of Data, ACM Press, NY, 1989, 110–121.
  8. [8] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to algorithms, 2nd ed. (The MIT Press, Cambridge, MA, London, England, and McGraw-Hill Book Company, USA and Canada, 2001).

Important Links:

Go Back