Indirect indexed searching and sorting

作者: Luther J Woodrum

DOI:

关键词: Index (publishing)Table (database)Database indexSortingRowIndirectionAlgorithmComputer scienceBinary search algorithmSpace (punctuation)Arithmetic

摘要: A sorting method by insertion among sequenced indexes, involving two levels of address indirection for keys T data records being sorted. The second level comprises a table containing the addresses T. can be in any arbitrary order their table, and located anywhere reachable addresses. However location each entry is indicated an assigned index. These indexes are placed highest-level S which they represent. An ordering operation occurs new key placing its into available having corresponding then compared to represented index obtained binary search using S. ends at particular when either compares equal currently examined key, or not more than i have been compared, where contains less -1+2i 1 entries. inserted after space made moving all entries from beginning up including index, inserting space. More record may same way.

参考文章(3)
Philip N Armstrong, Minimal storage sorter ,(1958)
Raymond J Nelson, Daniel G O'connor, Sorting system with two-line sorting switch ,(1963)