article

Free access

An encoding method for multifield sorting and indexing

Authors:

Michael W. Blasgen,

Richard G. Casey,

Kapali P. EswaranAuthors Info & Claims

Communications of the ACM, Volume 20, Issue 11

Pages 874 - 878

https://doi.org/10.1145/359863.359892

Published: 01 November 1977 Publication History

PDF eReader

Abstract

Sequences of character strings with an order relation imposed between sequences are considered. An encoding scheme is described which produces a single, order-preserving string from a sequence of strings. The original sequence can be recovered from the encoded string, and one sequence of strings precedes another if and only if the encoding of the first precedes the encoding of the second. The strings may be variable length, without a maximum length restriction, and no symbols need be reserved for control purposes. Hence any symbol may occur in any string. The scheme is useful for multifield sorting, multifield indexing, and other applications where ordering on more than one field is important.

References

[1]

Astrahan, M.M., and Chamberlin, D.D. Implementation of a structured English query language. Comm. ACM 18, 10 (Oct. 1975), 580-588.

Digital Library

Google Scholar

[2]

Astrahan, M.M., et al. System R: A relational approach to database management. ACM Trans. Database Syst. 1, 2 (June 1976), 97-137.

Digital Library

Google Scholar

[3]

Bayer, R., and McCreight, E.M. Organization and maintenance of large ordered indexes. Acta Informatica 1 (1972), 173-189.

Digital Library

Google Scholar

[4]

Blasgen, M.W., and Eswaran, K.P. On the evaluation of queries in a relational database system. Res. Rep. RJ1745, IBM Res. Lab., San Jose, Calif., April 1976.

Google Scholar

[5]

Brinch Hansen, P. Operating System Principles, Prentice-Hall, Englewood Cliffs, N.J., 1973.

Digital Library

Google Scholar

[6]

Codd, E.F. A relational model of data for large shared data banks. Comm. ACM 13, 6 (June 1970), 377-387.

Digital Library

Google Scholar

[7]

Lum, V.Y. Multi-attribute retrieval with combined indexes. Comm. ACM, 13, 11 (Nov. 1970), 660-666.

Digital Library

Google Scholar

Cited By

View all

Kuiper LMühleisen H(2023)These Rows Are Made for Sorting and That’s Just What We’ll Do2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00159(2050-2062)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00159
Härder THaustein MMathis CWagner M(2007)Node labeling schemes for dynamic XML documents reconsideredData & Knowledge Engineering10.1016/j.datak.2005.11.00860:1(126-149)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1016/j.datak.2005.11.008
Graefe G(2006)Implementing sorting in database systemsACM Computing Surveys10.1145/1132960.113296438:3(10-es)Online publication date: 30-Sep-2006
https://dl.acm.org/doi/10.1145/1132960.1132964
Show More Cited By

Recommendations

Tighter upper bound for sorting permutations with prefix transpositions

Permutations are sequences where each symbol in the given alphabet Σ appears exactly once. A transposition is an operation that exchanges two adjacent sublists in a permutation; if one of these sublists is restricted to be a prefix then one obtains a ...
Improved upper bound for sorting permutations by prefix transpositions
Abstract
Modelling of chromosomes with permutations has triggered the research of sorting permutations using global rearrangement operations in computational molecular biology. One such rearrangement is transposition which swaps two adjacent ...
Sorting unsigned permutations by weighted reversals, transpositions, and transreversals

Reversals, transpositions and transreversals are common events in genome rearrangement. The genome rearrangement sorting problem is to transform one genome into another using the minimum number of given rearrangement operations. An integer permutation ...

Comments

Information & Contributors

Information

Published In

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1977

Published in CACM Volume 20, Issue 11

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
796
Total Downloads

Downloads (Last 12 months)287
Downloads (Last 6 weeks)71

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kuiper LMühleisen H(2023)These Rows Are Made for Sorting and That’s Just What We’ll Do2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00159(2050-2062)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00159
Härder THaustein MMathis CWagner M(2007)Node labeling schemes for dynamic XML documents reconsideredData & Knowledge Engineering10.1016/j.datak.2005.11.00860:1(126-149)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1016/j.datak.2005.11.008
Graefe G(2006)Implementing sorting in database systemsACM Computing Surveys10.1145/1132960.113296438:3(10-es)Online publication date: 30-Sep-2006
https://dl.acm.org/doi/10.1145/1132960.1132964
Lomet D(2001)The evolution of effective B-treeACM SIGMOD Record10.1145/603867.60387830:3(64-69)Online publication date: 1-Sep-2001
https://dl.acm.org/doi/10.1145/603867.603878
Blasgen MAstrahan MChamberlin DGray JKing WLindsay BLorie RMehl JPrice TPutzolu GSchkolnick MSellinger PSlutz DStrong HTraiger IWade BYost R(1999)System RIBM Systems Journal10.1147/sj.382.037538:2-3(375-396)Online publication date: 1-Jun-1999
https://dl.acm.org/doi/10.1147/sj.382.0375
Antoshenkov G(1997)Dictionary-based order-preserving string compressionThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s0077800500316:1(26-39)Online publication date: 2-Feb-1997
https://dl.acm.org/doi/10.1007/s007780050031
Härder TReinert J(1996)Access path support for referential integrity in SQL2The VLDB Journal — The International Journal on Very Large Data Bases10.1007/s0077800500245:3(196-214)Online publication date: 8-Aug-1996
https://dl.acm.org/doi/10.1007/s007780050024
Valduriez PViemont Y(1984)A multikey hashing scheme using predicate treesACM SIGMOD Record10.1145/971697.60227514:2(107-114)Online publication date: 1-Jun-1984
https://dl.acm.org/doi/10.1145/971697.602275
Valduriez PViemont YSmith DYormark B(1984)A multikey hashing scheme using predicate treesProceedings of the 1984 ACM SIGMOD international conference on Management of data10.1145/602259.602275(107-114)Online publication date: 18-Jun-1984
https://dl.acm.org/doi/10.1145/602259.602275
Eastman CMcGill MKoll M(1983)Current practice in the evaluation of multikey search algorithmsProceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval10.1145/511793.511823(197-204)Online publication date: 8-Jun-1983
https://dl.acm.org/doi/10.1145/511793.511823
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Tighter upper bound for sorting permutations with prefix transpositions

Improved upper bound for sorting permutations by prefix transpositions

Sorting unsigned permutations by weighted reversals, transpositions, and transreversals

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations