Optimal information retrieval when queries are not random

DOI10.1016/0020-0255(84)90049-5zbMath0571.68081OpenAlexW2072772767MaRDI QIDQ1061507

Chin-Chen Chang

Publication date: 1984

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(84)90049-5

zbMATH Keywords

NP-hardheuristic algorithmmultiple key hashingaverage number of bucketshashing function rangesmultiattribute filequeries with probability

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (4)

Optimal multiple key hashing files for orthogonal range queries ⋮ A note on allocating k-ary multiple key hashing files among multiple disks ⋮ Some properties of optimal cartesian product files for orthogonal range queries ⋮ Multidisk partial match file design with known access pattern

Cites Work

• Unnamed Item
• Unnamed Item
• The hierarchical ordering in multiattribute files
• Reducing block accesses in inverted files by partial clustering
• Riemann's hypothesis and tests for primality
• Multi-dimensional clustering for data base organizations
• Performance Analyses of Cartesian Product Files and Random Files
• Algorithmic approach to the consecutive retrieval property
• Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries
• Every Prime Has a Succinct Certificate
• Partial-Match Retrieval Algorithms
• Common Properties of Some Multiattribute File Systems
• Optimality Properties of Multiple-Key Hashing Functions

This page was built for publication: Optimal information retrieval when queries are not random