Optimal distributed declustering using replication
From MaRDI portal
Recommendations
- Optimal parallel I/O for range queries through replication
- Asymptotically optimal declustering schemes for 2-dim range queries.
- Asymptotically optimal declustering schemes for range queries
- From discrepancy to declustering: near-optimal multidimensional declustering strategies for range queries
- Threshold-based declustering
Cited in
(8)- Asymptotically optimal declustering schemes for 2-dim range queries.
- An optimal voting scheme for minimizing the overall communication cost in replicated data management
- Optimal parallel I/O for range queries through replication
- A Hierarchical Technique for Constructing Efficient Declustering Schemes for Range Queries
- scientific article; zbMATH DE number 1919446 (Why is no real title available?)
- Partial replication: Achieving scalability in redundant arrays of inexpensive databases
- Minimizing message complexity of partially replicated data on hypercubes
- Threshold-based declustering
This page was built for publication: Optimal distributed declustering using replication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316589)