Key space analysis method for improved record sorting and file m

Details Key space analysis method for improved record sorting and file m Key space analysis method for improved record sorting and file m

1992-05-12

1995-05-30

Black, Thomas G.

Boots, shoes, and leggings

364DIG1, G06F 1540

Patent

active

054210070

ABSTRACT:
Key space analysis is provided to improve the merge phase of a sorting process or a computer merge operation where strings of records or files of presorted records are to be merged in order of a key. Key spaces are identified as strings or groups of strings, files or groups of files, whose range of entries does not overlap the range of entries of another key space. The strings or files within each key space are then combined and/or merged, as needed, independently of strings or files in other key spaces, and written directly to the output destination.

REFERENCES:
patent: 3697697 (1972-10-01), Audretsch, Jr. et al.
patent: 5301317 (1994-04-01), Lohman et al.
Savasere et al. "On Applying Classification to Schema Integration" Proc. First Int'l Workshop on Interoperability in Multidatabase Systems, IEEE Comp. Soc. Press, pp. 258-261. 1991.
Donald Knuth, "The Art of Computer Programming" vol. 3, Addison-Wesley, pp. 181-187. 1973.

Affiliated with

Also associated with

Rating

Key space analysis method for improved record sorting and file m does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Key space analysis method for improved record sorting and file m, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Key space analysis method for improved record sorting and file m will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-369691