article

Free access

Partial-match retrieval using hashing and descriptors

Editor: Robert W. Taylor Authors:

K. Ramamohanarao,

James A. Thom,

John W. LloydAuthors Info & Claims

ACM Transactions on Database Systems (TODS), Volume 8, Issue 4

Pages 552 - 576

https://doi.org/10.1145/319996.320006

Published: 01 December 1983 Publication History

PDF eReader

Abstract

This paper studies a partial-match retrieval scheme based on hash functions and descriptors. The emphasis is placed on showing how the use of a descriptor file can improve the performance of the scheme. Records in the file are given addresses according to hash functions for each field in the record. Furthermore, each page of the file has associated with it a descriptor, which is a fixed-length bit string, determined by the records actually present in the page. Before a page is accessed to see if it contains records in the answer to a query, the descriptor for the page is checked. This check may show that no relevant records are on the page and, hence, that the page does not have to be accessed. The method is shown to have a very substantial performance advantage over pure hashing schemes, when some fields in the records have large key spaces. A mathematical model of the scheme, plus an algorithm for optimizing performance, is given.

References

[1]

AHO, A.V., AND ULLMAN, J.D. Optimal partial-match retrieval when fields are independently specified. ACM Trans. Database Syst. 4, 2 (June 1979), 168-179.

Digital Library

Google Scholar

[2]

BOLOUR, A. Optimality properties of multiple-key hashing functions. J. ACM. 26, 2 (April 1979), 196-210.

Digital Library

Google Scholar

[3]

FAGIN, R., NIEVERGELT, J., PIPPENGER, N., AND STRONG, H.R. Extendible hashing--a fast access method for dynamic files. ACM Trans. Database Syst. 4, 3 (Sept. 1979}, 315-344.

Digital Library

Google Scholar

[4]

KNUTrl, D. The Art of Computer Programming. vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.

Google Scholar

[5]

LARSON, P. Linear hashing with partial expansions. In Proc. 6th Int. Conf. Very Large Databases, 1980, pp. 224-232.

Google Scholar

[6]

LITWlN, W. Linear hashing: A new tool for file and table addressing. In Proc. 6th Int. Conf. Very Large Databases, 1980, pp. 212-223.

Google Scholar

[7]

LLOYD, J.W. Optimal partial-match retrieval. BIT 20 (1980), 406-413.

Digital Library

Google Scholar

[8]

LLOYD, J.W., AND RAMAMOHANARAO, K. Partial-match retrieval for dynamic files. BIT 22 (1982), 150-168.

Digital Library

Google Scholar

[9]

PFALTZ, J.L., BERMAN, W.J., AND CAGLEY, E.M. Partial-match retrieval using indexed descriptor files. Commun. ACM 23, 9 (Sept. 1980), 522-528.

Digital Library

Google Scholar

[10]

RAMAMOHANARAO, K., AND LLOYD, J.W. Dynamic hashing schemes. Comput. J. 25, 4 (Nov. 1982), 478-485.

Crossref

Google Scholar

[11]

RIVEST, R.L. Partial-match retrieval algorithms. SIAM J. Comput. 5, 1 (1976), 19-50.

Crossref

Google Scholar

[12]

ROBERTS, C.S. Partial-match retrieval via the method of superimposed codes. Proc. IEEE 67, 12 (Dec. 1979), 1624-1642.

Crossref

Google Scholar

[13]

ROTHNIE, J.B. AND LOZANO, T. Attribute based file organization in a paged memory environment. Commun. ACM 17, 2 (Feb. 1974), 63-69.

Digital Library

Google Scholar

[14]

SCHOLL, M. New file organizations based on dynamic hashing. ACM Trans. Database Syst. 6, 1 (March 1981), 194-211.

Digital Library

Google Scholar

Cited By

View all

Ramamohanarao KShepherd JSacks-Davis R(2005)Partial-match retrieval for dynamic files using linear hashing with partial expansionsFoundations of Data Organization and Algorithms10.1007/3-540-51295-0_128(202-216)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-51295-0_128
Ramamohanarao KShepherd J(2005)A superimposed codeword indexing scheme for very large Prolog databasesThird International Conference on Logic Programming10.1007/3-540-16492-8_105(569-576)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-16492-8_105
Choi JSong MJeong KKwon HHan SKim Y(2005)A Prolog-based Korean-English Machine Translation System and its efficient method of dictionary managementLogic Programming '8510.1007/3-540-16479-0_23(236-245)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-16479-0_23
Show More Cited By

Index Terms

Partial-match retrieval using hashing and descriptors
1. Information systems
  1. Data management systems
    1. Data structures
      1. Data access methods
  2. Information storage systems
    1. Record storage systems
      1. Record storage alternatives
        Hashed file organization
        Indexed file organization

Recommendations

Optimal partial-match retrieval when fields are independently specified

This paper considers the design of a system to answer partial-match queries from a file containing a collection of records, each record consisting of a sequence of fields. A partial-match query is a specification of values for zero or more fields of a ...
Partial-match retrieval for dynamic files
Abstract
This paper studies file designs for answering partial-match queries for dynamic files. A partial-match query is a specification of the value of zero or more fields in a record. An answer to a query consists of a listing of all records in the ...
Optimal partial-match retrieval
Abstract
This paper studies the design of a system to handle partial-match queries from a file. A partial-match query is a specification of the value of zero or more fields in a record. An answer to a query consists of a listing of all records in the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems

ACM Transactions on Database Systems Volume 8, Issue 4

Dec. 1983

184 pages

ISSN:0362-5915

EISSN:1557-4644

DOI:10.1145/319996

Editor:
Robert W. Taylor
IBM Research Lab, San Jose, CA

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1983

Published in TODS Volume 8, Issue 4

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

22
Total Citations
View Citations
520
Total Downloads

Downloads (Last 12 months)118
Downloads (Last 6 weeks)12

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ramamohanarao KShepherd JSacks-Davis R(2005)Partial-match retrieval for dynamic files using linear hashing with partial expansionsFoundations of Data Organization and Algorithms10.1007/3-540-51295-0_128(202-216)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-51295-0_128
Ramamohanarao KShepherd J(2005)A superimposed codeword indexing scheme for very large Prolog databasesThird International Conference on Logic Programming10.1007/3-540-16492-8_105(569-576)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-16492-8_105
Choi JSong MJeong KKwon HHan SKim Y(2005)A Prolog-based Korean-English Machine Translation System and its efficient method of dictionary managementLogic Programming '8510.1007/3-540-16479-0_23(236-245)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-16479-0_23
Liu XXu W(2002)A Stochastic Programming Approach for Range Query Retrieval ProblemsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2002.101921914:4(867-880)Online publication date: 1-Jul-2002
https://dl.acm.org/doi/10.1109/TKDE.2002.1019219
Hodge VAustin J(2001)An evaluation of standard retrieval algorithms and a binary neural approachNeural Networks10.1016/S0893-6080(00)00097-614:3(287-303)Online publication date: 1-Apr-2001
https://dl.acm.org/doi/10.1016/S0893-6080%2800%2900097-6
Ross KZaman K(2000)Serving Datacube Tuples from Main MemoryProceedings of the 12th International Conference on Scientific and Statistical Database Management10.1109/SSDM.2000.869787Online publication date: 26-Jul-2000
https://dl.acm.org/doi/10.1109/SSDM.2000.869787
Chang CLee C(1998)A two‐level signature file based on a block‐oriented data model for spatial match retrievalJournal of the Chinese Institute of Engineers10.1080/02533839.1998.967040921:4(467-478)Online publication date: Jun-1998
https://doi.org/10.1080/02533839.1998.9670409
Sung SHsu W(1995)The optimal size of a signatureMathematical and Computer Modelling: An International Journal10.1016/0895-7177(95)00008-P21:4(67-75)Online publication date: 1-Feb-1995
https://dl.acm.org/doi/10.1016/0895-7177%2895%2900008-P
Chen CChang CLee R(1993)Optimal MMI file systems for orthogonal range retrievalInformation Systems10.1016/0306-4379(93)90041-X18:1(37-54)Online publication date: 1-Jan-1993
https://dl.acm.org/doi/10.1016/0306-4379%2893%2990041-X
Zhou SWilliams M(1991)Assessment of two-level codeword indexing applied to Prolog databaseInformation and Software Technology10.1016/0950-5849(91)90061-F33:2(157-162)Online publication date: 1-Mar-1991
https://dl.acm.org/doi/10.1016/0950-5849%2891%2990061-F
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

Index Terms

Recommendations

Optimal partial-match retrieval when fields are independently specified

Partial-match retrieval for dynamic files

Optimal partial-match retrieval

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

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations