Optimal dynamic multi-attribute hashing for range queries

DOI10.1007/BF01990535MaRDI QIDQ1317859zbMATH OpenOpenAlexFDO

Authors Evan P. Harris, Kotagiri Ramamohanarao

Publication date 22 March 1994

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01990535

zbMATH Keywords

range queriespartial match retrievalmulti-attribute hashingdynamic files

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• Multi-attribute hashing with multiple file copies for high performance partial-match retrieval
• Optimal information retrieval when queries are not random
• Optimal multiple key hashing files for orthogonal range queries
• Optimal MMI file systems for orthogonal range retrieval
• On the File Design Problem for Partial Match Retrieval

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Adaptive hashing
• Dynamic Hashing Schemes
• Interpolation-based index maintenance
• Multi-attribute hashing with multiple file copies for high performance partial-match retrieval
• Multidimensional binary search trees used for associative searching
• On the complexity of designing optimal partial-match retrieval systems
• Optimal partial-match retrieval
• Partial-Match Retrieval Algorithms
• Partial-match retrieval for dynamic files

Cited in

(5)

• On GDM allocation method for partial range queries
• Optimal MMI file systems for orthogonal range retrieval
• Multidimensional extendible hashing for partial-match queries
• Multi-attribute hashing with multiple file copies for high performance partial-match retrieval
• Optimal information retrieval when queries are not random

This page was built for publication: Optimal dynamic multi-attribute hashing for range queries

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