Asymptotically optimal declustering schemes for range queries
From MaRDI portal
Recommendations
- Asymptotically optimal declustering schemes for 2-dim range queries.
- From discrepancy to declustering: near-optimal multidimensional declustering strategies for range queries
- Improved bounds and schemes for the declustering problem
- Improved bounds and schemes for the declustering problem
- Threshold-based declustering
Cited in
(11)- Asymptotically optimal declustering schemes for 2-dim range queries.
- Improved bounds and schemes for the declustering problem
- Optimal parallel I/O for range queries through replication
- A Hierarchical Technique for Constructing Efficient Declustering Schemes for Range Queries
- Declustering spatial objects by clustering for parallel disks
- Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Improved bounds and schemes for the declustering problem
- Optimal distributed declustering using replication
- From discrepancy to declustering: near-optimal multidimensional declustering strategies for range queries
- Threshold-based declustering
This page was built for publication: Asymptotically optimal declustering schemes for range queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473267)