On the File Design Problem for Partial Match Retrieval

DOI10.1109/TSE.1985.232197MaRDI QIDQ3681969zbMATH OpenFDO

Authors H. C. Du

Publication date 1985

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSE.1985.232197

zbMATH Keywords

NP-hardpartial match retrievalfile structuremultikey hashing

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• Partial-match retrieval using hashing and descriptors
• On the complexity of designing optimal partial-match retrieval systems
• Optimal Partial-Match Hashing Design
• Optimal multidisk partial match file designs
• Multi-attribute hashing with multiple file copies for high performance partial-match retrieval

Cited in

(14)

• Optimal Partial-Match Hashing Design
• Optimality Properties of the Disc Modulo Allocation Method for k-ary Multiple Key Hashing Files
• Optimal multidisk partial match file designs
• Partial-match retrieval using hashing and descriptors
• On the complexity of designing optimal partial-match retrieval systems
• scientific article; zbMATH DE number 1481756 (Why is no real title available?)
• The optimal size of a signature
• Cyclic multiple-valued filing schemes for higher-order queries
• Multi-attribute hashing with multiple file copies for high performance partial-match retrieval
• Optimal dynamic multi-attribute hashing for range queries
• Optimal multiple key hashing files for orthogonal range queries
• Partial match retrieval in implicit data structures
• Optimal information retrieval when queries are not random
• Multidisk partial match file design with known access pattern

This page was built for publication: On the File Design Problem for Partial Match Retrieval

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