Multidimensional extendible hashing for partial-match queries

DOI10.1007/BF00996923zbMATH Open0609.68080MaRDI QIDQ3750158FDOQ3750158

Shou-Hsuan S. Huang

Publication date: 1985

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Recommendations

• Partial-match retrieval using hashing and descriptors
• Partial match queries in relaxed multidimensional search trees
• Optimal dynamic multi-attribute hashing for range queries
• Partial match retrieval of multidimensional data
• Indexed extendible hashing
• Multi-attribute hashing with multiple file copies for high performance partial-match retrieval
• Partial match retrieval in implicit data structures
• Optimal Partial-Match Hashing Design

zbMATH Keywords

multidimensional data structuresmergingbucket splittingDirectory managementmulti-attribute keys

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• Multidimensional binary search trees used for associative searching
• Dynamic hashing
• Partial-match retrieval for dynamic files

Cited In (4)

• Multi-directory hashing
• Indexed extendible hashing
• Multi-attribute hashing with multiple file copies for high performance partial-match retrieval
• Concurrent operations in multi-attribute linear hashing

This page was built for publication: Multidimensional extendible hashing for partial-match queries

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