Method of sorting and compressing data
US5274805A · kind A · utility
100Cited by
9References
38Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jun 5, 1992 |
| Grant date | Dec 28, 1993 |
| Priority date | — |
| Expiry date | Jun 5, 2012 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99937
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method for sorting data in a computer data storage system that has particular advantages in implementing a key index tree structure. The sorting method uses buffer-size substrings to sort strings of key records into a linked list structure that can be directly transformed into an index tree. The sorting method also may be used for sorting large sets of data records in place on a computer storage system. The method further integrates prefix compression and suffix compression of key records with the sorting method to reduce the number of input/output operations required to create a more compact key index tree structure.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.