Load balancing and locality in range-queriable data structures
From MaRDI portal
Publication:5501490
Recommendations
- A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems
- Simple efficient load-balancing algorithms for peer-to-peer systems
- Algorithms and Computation
- A novel robust on-line protocol for load-balancing in structured peer-to-peer systems
- Skip-webs, efficient distributed data structures for multi-dimensional data sets
Cited in
(5)- On character-based index schemes for complex wildcard search in peer-to-peer networks
- Simple efficient load-balancing algorithms for peer-to-peer systems
- A novel robust on-line protocol for load-balancing in structured peer-to-peer systems
- \(D^2\)-tree: a new overlay with deterministic bounds
- A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems
This page was built for publication: Load balancing and locality in range-queriable data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501490)