Sorting of records with duplicate removal in a database system

作者: Thu K. Pham , Son Pham

DOI:

关键词:

摘要: A database system includes an enhanced technique for performing sorts in which removals of duplicate records are performed to compact the size segments being sorted. To enhance a query plan, record removal is as early plan possible. By removing number input/output (I/O) operations reduced, resulting more efficient usage resources. In example implementations, two type performed: heap sort (to successive input file, with sorting associated concurrent each segment so that smaller I/O accesses needed); and merge (in output files from prior passes merged sorted, process also further data reduce accesses).

参考文章(16)
Gary Graunke, Leonard D. Shapiro, Sujata Ramamoorthy, Parallel merge sort method and apparatus ,(1996)
Kyuseok Shim, Surajit Chaudhuri, Including Group-By in Query Optimization very large data bases. pp. 354- 366 ,(1994)
Grace Kwan-On Au, Optimizing an aggregate join query ,(2001)
A. Gupta, D. Quass, V. Harinarayan, Generalized Projections: A Powerful Approach To Aggregation Stanford InfoLab. ,(1995)
Shinji Fujiwara, Kazutomo Ushijima, Itaru Nishizawa, Grouping and duplicate removal method in a database ,(1999)
Stéphane Grumbach, Maurizio Rafanelli, Leonardo Tininini, Querying aggregate data symposium on principles of database systems. pp. 174- 184 ,(1999) , 10.1145/303976.303994