Optimal information retrieval when queries are not random

DOI10.1016/0020-0255(84)90049-5MaRDI QIDQ1061507zbMATH OpenOpenAlexFDO

Authors 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

heuristic algorithmNP-hardmultiple key hashingaverage number of bucketshashing function rangesmultiattribute filequeries with probability

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• On the complexity of designing optimal partial-match retrieval systems
• Optimal multiple key hashing files for orthogonal range queries
• Optimal Partial-Match Hashing Design
• Optimal dynamic multi-attribute hashing for range queries
• On the File Design Problem for Partial Match Retrieval

Cites work

• scientific article; zbMATH DE number 3646329 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Algorithmic approach to the consecutive retrieval property
• Common Properties of Some Multiattribute File Systems
• Every Prime Has a Succinct Certificate
• Multi-dimensional clustering for data base organizations
• Optimality Properties of Multiple-Key Hashing Functions
• Partial-Match Retrieval Algorithms
• Performance Analyses of Cartesian Product Files and Random Files
• Reducing block accesses in inverted files by partial clustering
• Riemann's hypothesis and tests for primality
• Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries
• The hierarchical ordering in multiattribute files

Cited in

(15)

• Data base design with the constrained multiple attribute tree
• Optimal multiple key hashing files for orthogonal range queries
• Concatenated hash code selection
• Everywhere-Tight Information Cost Tradeoffs for Augmented Index
• Multidisk partial match file design with known access pattern
• On partial information retrieval: the unconstrained 100 prisoner problem
• Optimal Partial-Match Hashing Design
• Some properties of optimal cartesian product files for orthogonal range queries
• Fundamental limits for information retrieval
• scientific article; zbMATH DE number 4104389 (Why is no real title available?)
• Optimization of descriptor information retrieval systems with zone- hierarchical organization of the retrieval set
• On the complexity of designing optimal partial-match retrieval systems
• A note on allocating k-ary multiple key hashing files among multiple disks
• Optimal dynamic multi-attribute hashing for range queries
• scientific article; zbMATH DE number 3972242 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061507)