Asymptotically optimal declustering schemes for 2-dim range queries.
From MaRDI portal
Publication:1401286
DOI10.1016/S0304-3975(02)00742-9zbMATH Open1045.68043OpenAlexW2615223816MaRDI QIDQ1401286FDOQ1401286
Authors: Rakesh Kumar Sinha, Randeep Bhatia, 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
Recommendations
Cites Work
- Low-discrepancy sequences and global function fields with many rational places
- Good permutations for extreme discrepancy
- Title not available (Why is that?)
- Irregularities of distribution, VII
- On irregularities of distribution
- Geometric discrepancy. An illustrated guide
- Discrépance de suites associées à un système de numération (en dimension s)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Irregularities of Distribution II
- Title not available (Why is that?)
- Disk allocation for Cartesian product files on multiple-disk systems
Cited In (10)
- An Improved Discrepancy Approach to Declustering
- Title not available (Why is that?)
- Database Theory - ICDT 2005
- General store placement for response time minimization in parallel disks
- From discrepancy to declustering: near-optimal multidimensional declustering strategies for range queries
- A Hierarchical Technique for Constructing Efficient Declustering Schemes for Range Queries
- Improved bounds and schemes for the declustering problem
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2004
- Title not available (Why is that?)
This page was built for publication: Asymptotically optimal declustering schemes for 2-dim range queries.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401286)
