Asymptotically optimal declustering schemes for 2-dim range queries.

DOI10.1016/S0304-3975(02)00742-9zbMath1045.68043OpenAlexW2615223816MaRDI QIDQ1401286

Randeep Bhatia, Rakesh Kumar Sinha, Chung-Min Chen

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00742-9

zbMATH Keywords

declustering techniques

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Improved bounds and schemes for the declustering problem ⋮ An Improved Discrepancy Approach to Declustering

Cites Work

• Good permutations for extreme discrepancy
• Low-discrepancy sequences and global function fields with many rational places
• Discrépance de suites associées à un système de numération (en dimension s)
• Disk allocation for Cartesian product files on multiple-disk systems
• On Irregularities of Distribution II
• Irregularities of distribution, VII
• On irregularities of distribution
• Geometric discrepancy. An illustrated guide
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotically optimal declustering schemes for 2-dim range queries.