Abstract
One of the goals of computer science is to invent effective and efficient methods towards problem solving. However, even if the best method (time optimal) is applied to solve a particular problem, the results may not be satisfactory to use the method in a real-life situation. For example, even if we apply the best sorting algorithm on a set of 10,000,000 records, the real-time constraints that are posed by the application may not be satisfied. Therefore, apart from the design and implementation of efficient algorithms, the research community is still developed new techniques aiming at more efficient processing. One such technique is the exploitation of multiple resources (processors, disks) to reduce the processing costs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balakrishna, R., Iyer, D., and Dias, M. (1990). System Issues in Parallel Sorting for Database Systems. In Proceedings of the 6 th IEEE International Conference on Data Engineering, pages 246–255
Beck, M., Bitton, D., and Wilkinson, W.K. (1988). Sorting Large Files on a Backend Multiprocessor. IEEE Transactions on Computers, 37(7):769–778.
Bitton, D. (1982). Design, Analysis and Implementation of Parallel External Sorting Algorithms. Ph.D. Dissertation, TR 464, Departemnt of Computer Science, University of Wisconsin-Madison.
DeWitt, D.J., Naughton, J.F., and Schneider, D.A. (1991). Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting. In Proceedings of the 1 st International Conference on Parallel and Distributed Information Systems, pages 280–291.
DeWitt, D.J. and Gray, J. (1992). Parallel Database Systems: the Future of High Performance Database Systems. Communications of the ACM, 35(6):85–98.
Graefe, G. (1990). Encapsulation of Parallelism in the Volcano Query Processing System. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 102–111.
Graefe, G. (1993). Query Evaluation Techniques for Large Databases. A CM Computing Surveys, 25(2):73–170.
Gray, J., Stewart, M., Tsukerman, A., Uren, S., and Vaughan, B. (1986). Fastsort: an External Sort using Parallel Processing. Tandem Systems Review, 2.
Iyer, B.R., Ricard, G.R., and Varman, P.J. (1989). Percentile Finding Algorithm for Multiple Sorted Runs. In Proceedings of the 15 th International Conference on Very Large Data Bases, pages 135–144.
Knuth, D.E. (1973). The Art of Computer Programming, Vol.3: Sorting and Searching. Addison-Wesley.
Kumar, A., Lee, T., and Tsotras, J. (1995). A Load-Balanced Parallel Sorting Algorithm for Shared-Nothing Architectures. Distributed and Parallel Databases, 3(1):37–68.
Lu, H., Ooi, B.-C, and Tan, K.L. (1994). Query Processing in Parallel Relational Database Systems. IEEE CS Press.
Menezes, B.L., Ricarte, I.L.M., and Thurimella, R. (1993). Analysis of Pipelined External Sorting on a Reconfigurable Message-Passing Multicomputer. Parallel Computing, 19(8):839–858.
Menon, J. (1986). A Study of Sort Algorithms for Multiprocessor Database Machines. In Proceedings of the 12 th International Conference on Very Large Data Bases, pages 197–206.
Nyberg, C, Barclay, T., Cvetanovic, Z., Gray, J., and Lomet, D. (1995). Alphasort: A Cache-Sensitive Parallel External Sort. The VLDB Journal, 4(4):603–627.
Pai, V.S. and Varman, P.J. (1992). Prefetching with Multiple Disks for External Mergesort-Simulation and Analysis. In Proceedings of the 8 th IEEE International Conference on Data Engineering, pages 273–282.
Verkamo, A.I. (1988). External Quicksort. Performance Evaluation, 8(4):271–288.
Wegner, L.M. and Teuhola, J.I. (1989). The External Heapsort. IEEE Transactions on Software Engineering, 15(7):917–925.
Wolf, J.L., Dias, D.M., and Yu, P.S. (1990). An Effective Algorithm for Parallelizing Sort Merge in the Presence of Data Skew. In Proceedings of the 2 nd International Symposium on Parallel and Distributed Systems, pages 103–115.
Zhang, W. and Larson, P. A. (1997). Dynamic Memory Adjustment for External Mergesort. In Proceedings of the 23 rd International Conference on Very Large Data Bases, pages 376–385.
Zhang, W. and Larson, P.A. (1998). Buffering and Read-Ahead Strategies for External Mergesort. In Proceedings of the 24 th International Conference on Very Large Data Bases, pages 523–533.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Manolopoulos, Y., Theodoridis, Y., Tsotras, V.J. (2000). Parallel External Sorting. In: Advanced Database Indexing. Advances in Database Systems, vol 17. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8590-3_10
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8590-3_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4641-8
Online ISBN: 978-1-4419-8590-3
eBook Packages: Springer Book Archive