Sciweavers

2 search results - page 1 / 1
» Multidimensional Dynamic Quantile Hashing is Very Efficient ...
Sort
View
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
13 years 8 months ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger
TPDS
2010
126views more  TPDS 2010»
12 years 11 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...