Parallel database sorting

Information Sciences

Volumn 146, Issue 1-4, 2002, Pages 171-219

  Taniar, David ^a   Rahayu, J Wenny ^b  

^a MONASH UNIVERSITY   (Australia)

^b LA TROBE UNIVERSITY   (Australia)

Author keywords

External sorting; Internal sorting; Parallel databases; Parallel sorting; Sorting in database queries

Indexed keywords

COMPUTER SCIENCE; MERGING; PARALLEL PROCESSING SYSTEMS; SORTING;

PARALLEL MERGE-ALL SORT; PARALLEL REDISTRIBUTION BINARY-MERGE SORT;

QUERY LANGUAGES;

EID: 0036798522     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(02)00196-2     Document Type: Article

References (20)

1. Bergsten B., Couprie M., Valduriez P. Overview of parallel architecture for databases. The Computer Journal. 36(8):1993;734-740.
2. Bitton D.et al. Parallel algorithms for the execution of relational database operations. ACM Transactions on Database Systems. 8(3):1983;324-353.
3. Bitton D.et al. A taxonomy of parallel sorting. ACM Computing Surveys. 16(3):1984;287-318.
4. DeWitt D.J.et al. The gamma database machine project. IEEE Transactions on Knowledge and Data Engineering. 2(1):1990.
5. DeWitt D.J., Gray J. Parallel database systems: the future of high performance database systems. Communications of the ACM. 35(6):1992;85-98.
6. Elmasri R., Navathe S.B. Fundamental of Database Systems. second ed. 1994;Benjamin/Cummings, Menlo Park, CA.
7. Feldman M.B. Sorting external files. Data Structures with Ada. 1985;290-300 Prentice-Hall, Englewood Cliffs, NJ. (Chapter 10).
8. Graefe G. Query evaluation techniques for large databases. ACM Computing Surveys. 25(2):1993;73-170.
9. E. Hart, Transim: prototyping parallel algorithms, User Guide and Reference Manual, Transim Version 3.5, University of Westminster, August 1993.
10. Hua K.A., Lee C. Handling data skew in multiprocessor database computers using partition tuning. Proceedings of the 17th International Conference on Very Large Data Bases VLDB, Barcelona. 1991;525-535.
11. Hua K.A., Lee C., Hua C.M. Dynamic load balancing in multicomputer database systems using partition tuning. IEEE Transactions on Knowledge and Data Engineering. 7(6):1995;968-983.
12. Kitsuregawa M., Ogawa Y. Bucket spreading parallel hash: a new, robust, parallel hash join method for data skew in the Super Database Computer (SDC). Proceedings of the 16th VLDB Conference, Brisbane. 1990;210-221.
13. Knuth D.E. The Art of Computer Programming: Sorting and Searching. vol. 3:1973;Addison-Wesley, Reading, MA.
14. Liu K.H., Leung C.H.C., Jiang Y. Analysis and Taxonomy of skew in parallel databases. Proceedings of High Performance Computing Symposium HPDC'95, Montreal, Canada. 1995;304-315.
15. Melton J., Simon A.R. Understanding the New SQL: A Complete Guide. 1993;Morgan Kaufmann, San Fransisco, CA.
16. Mishra P., Eich M.H. Join processing in relational databases. ACM Computing Surveys. 24(1):1992;63-113.
17. Oracle, Oracle 8 Server Concepts, Release 8.0, Oracle Corporation, Redwood City, CA, 1998.
18. Su S.Y.W., Mikkilineni P. Parallel algorithms and their implementation in Micronet. Proceedings of the 8th VLDB Conference. 1982;310-324.
19. Wolf J.L., Dias D.M., Yu P.S. A parallel sort merge join algorithm for managing data skew. IEEE Transactions on Parallel and Distributed Systems. 4(1):1993;70-86.
20. Zipf G.K. Human Behaviour and the Principle of Least Effort. 1949;Addison-Wesley, Reading, MA.