M. H. McKinney
ABSTRACT
A method is presented for implementing multi-attribute files using hashing. All inverted values are stored in a single shared hash area. The entries in the hash area are stored in variable-length form and contain the attribute values, the attribute name identifier, and one or more identifiers of records in the file which possess the attribute values. The file itself is directly accessable and stored in entry-sequence. In addition to retrieval methodology, the physical methodology for loading the hash area with the inverted values is given. Also, considerations for adding new records, and deleting and changing existing records are given.
- Lefkovitz, D. File Structures for On-line Systems, Spartan Books, New York, 1974.Google Scholar
- McKinney, M. H., Variable length hash area entries, to appear in Proc. 1977 NCC (June 1977). Google ScholarDigital Library
- Maurer, W. D.; and Lewis, T. G., Hash table methods, Computing Surveys 7, 1 (March 1975) pp. 5--19.Google ScholarDigital Library
- Knuth, D. E., The Art of Computer Programming: Vol. III: Sorting and Searching, Addison-Wesley, Reading, Mass., 1973. Google ScholarDigital Library
Index Terms
- Multi-attribute inverted files implemented with hashing
Recommendations
Compressing Inverted Files
AbstractResearch into inverted file compression has focused on compression ratio—how small the indexes can be. Compression ratio is important for fast interactive searching. It is taken as read, the smaller the index, the faster the search.
The premise “...
Linear Spiral Hashing for Expansible Files
The goal of dynamic hashing is to design a function and a file structure that allow the address space allocated to the file to be increased and reduced without reorganizing the whole file. In this paper, we propose a new scheme for dynamic hashing in ...
Inverted files versus signature files for text indexing
Two well-known indexing methods are inverted files and signature files. We have undertaken a detailed comparison of these two approaches in the context of text indexing, paying particular attention to query evaluation speed and space requirements. We ...
Comments