Scheduling of query execution plans in symmetric multiprocessor database systems

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 11-20

  Wu, Jun ^a   Chen, Jian Jia ^b   Hsueh, Chih Wen ^a   Kuo, Tei Wei ^b  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BENCHMARKING; BOUNDARY VALUE PROBLEMS; COMPETITION; DATABASE SYSTEMS; ONLINE SYSTEMS; OPTIMIZATION; PLANNING; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING; STORAGE ALLOCATION (COMPUTER); TREES (MATHEMATICS);

LOAD BALANCING; QUERY EXECUTION PLAN (QEP); SHARED-MEMORY MULTIPROCESSOR DATABASE SYSTEM; SYMMETRIC MULTIPROCESSOR (SMP) DATABASE SYSTEMS;

MULTIPROCESSING SYSTEMS;

EID: 12444281106     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. F. N. Afrati, C. Li, and J. D. Ullman. Pages generating efficient plans for queries using views. In Proceedings of the 2001 ACM SIGMOD international conference on Management of data, pages 319-330, Santa Barbara, California, May 2001.
2. L. Bouganim, D. Florescu, and P. Valduriez. Dynamic load balancing in hierarchical parallel database systems. In Proceedings of the International Conference on Very Large Data Bases (VLDB), pages 436-447, Bombay, India, September 1996.
3. N. Bruno and S. Chaudhuri. Exploiting statistics on query expressions for optimization. In Proceedings of the 2002 ACM SIGMOD international conference on Management of data, pages 263-274, June 2002.
4. S. Chatterji, S. S. K. Evani, S. Ganguly, and M. D. Yemmanuru. On the complexity of approximate query optimization. In Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database systems, pages 282-292, Madison, Wisconsin, 2002.
5. R. Elmasri and S. B. Navathe. Fundamentals of Database Systems. Addison-Wesley, second edition, 1994.
6. R. Elmasri and S. B. Navathe. Fundamentals of Database Systems. Pearson Addison Wesley, fourth edition, July 2003.
7. H. Garcia-Molina, J. D. Ullman, and J. D. Widom. Database Systems: The Complete Book. Prentice Hall, October 2001.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman Press, June 1979.
9. M. N. Garofalakis and Y. E. Ioannidis. Multi-dimensional resource scheduling for parallel queries. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 365-376, Montreal, Canada, June 1996.
10. M. N. Garofalakis and Y. E. Ioannidis. Parallel query scheduling and optimization with time- and space-shared resources. In Proceedings of the International Conference on Very Large Data Bases (VLDB), pages 296-305, 1997.
11. R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563-1581, 1966.
12. R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17:263-269, 1969.
13. R. L. Graham. Bounds on multiprocessing anomalies and related packing algorithms. In Proceedings of the Spring Joint Computer Conference (SJCC), pages 205-217, 1972.
14. T. C. Hu. Parallel sequencing and assemble line problems. Operations Research, 9:841-848, 1961.
15. S. Lam and R. Sethi. Worst case of two scheduling algorithms. SIAM Journal on Computing, 6(3):518-536, September 1977.
16. M. M. Astrahan, et al. System R: A relational approach to data base management. ACM Transactions on Database Systems (TODS), 1(2):97-137, June 1976.
17. M. Murphy and D. Rotem. Processor scheduling for multiprocessor joins. In Proceedings of the IEEE Data Engineering Conference, pages 140-148, Los Angeles, California, February 1989.
18. M. Murphy and M.-C. Shan. Execution plan balancing. In Proceedings of the IEEE International Conference on Data Engineering (ICDE), pages 698-706, 1991.
19. M. T. Ozsu and P. Valduriez. Principles of Distributed Database Systems. Prentice Hall, second edition, January 1999.
20. P. Selinger, et al. Access path selection in a relational database management system. In Proceeding of ACM SIGMOD International Conference on Management of Data, pages 23-34, Boston, MA, June 1979.
21. A. Silberschatz, H. F. Korth, and S. Sudarshan. Database Systems Concepts. McGraw-Hill, fourth edition, October 2001.
22. J. Smith and P. Chang. Optimizing the performance of a relational algebra interface. Communications of the ACM (CACM), 18(10):568-579, October 1975.
23. Transaction Processing Performance Council (TPC). TPC Benchmark C, standard specification, revision 5.1. Deceber 2002.