Sorting of records with duplicate removal in a database system

Details Sorting of records with duplicate removal in a database system Sorting of records with duplicate removal in a database system

2008-05-06

2008-05-06

Cottingham, John (Department: 2167)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C707S793000, C707S793000, C707S793000, C708S203000

Reexamination Certificate

active

07370068

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

REFERENCES:
patent: 4499555 (1985-02-01), Huang
patent: 5852826 (1998-12-01), Graunke et al.
patent: 5884299 (1999-03-01), Ramesh et al.
patent: 6105024 (2000-08-01), Graefe et al.
patent: 6115705 (2000-09-01), Larson
patent: 6374266 (2002-04-01), Shnelvar
patent: 6381601 (2002-04-01), Fujiwara et al.
patent: 6571244 (2003-05-01), Larson
patent: 6732096 (2004-05-01), Au
patent: 6775682 (2004-08-01), Ballamkonda et al.
S. Chaudhuri et al., “Optimizing Queries with Materialized Views,” Proceeding of International Conference on Data Engineering, pp. 1-25 (1995).
S. Chaudhuri et al., “Including Group-By in Query Optimization,” VLBD, pp. 354-366 (1994).
J. Gray et al., “Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals,” Proceeding 12thInternational Conference on Data Engineering, pp. 29-53 (1996).
A. Gupta, “Generalized Projections: A Powerful Approach to Aggregation,” VLBD, pp. 1-26 (1995).
S. Grumbach et al., “Querying Aggregate Data,” PODS '99, pp. 174-185 (1999).
M. Muralikrishna, “Improved Unnesting Algorithms for Join Aggregate SQL Queries,” Proceeding of 18thVLDB Conference, pp. 91-102 (1992).
M. Rafanelli et al., “The Aggregate Data Problem: a System for their Definition and Management,” ACM Sigmod Record, pp. 8-13 (Dec. 1996).

Affiliated with

Also associated with

Rating

Sorting of records with duplicate removal in a database system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Sorting of records with duplicate removal in a database system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sorting of records with duplicate removal in a database system will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2767077