Optimal multiple key hashing files for orthogonal range queries

DOI10.1016/0020-0255(94)90044-2zbMath0815.68052OpenAlexW2039512549MaRDI QIDQ1331032

V. Pereyra

Publication date: 17 August 1994

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

Full work available at URL: https://doi.org/10.1016/0020-0255(94)90044-2

zbMATH Keywords

orthogonal range retrievalmultiple key hasting file

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20)

Cites Work

• Optimal MMI file systems for orthogonal range retrieval
• Interpolation-based index maintenance
• Optimal information retrieval when queries are not random
• Multi-dimensional clustering for data base organizations
• A note on Euclidean near neighbor searching in the plane
• Organization and maintenance of large ordered indexes
• On the File Design Problem for Partial Match Retrieval
• Multidimensional binary search trees used for associative searching
• Optimality Properties of Multiple-Key Hashing Functions

This page was built for publication: Optimal multiple key hashing files for orthogonal range queries