104 search results - page 2 / 21 » Range queries over skip tree graphs |
ICDCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
P2P
2009
IEEE
13 years 12 months ago
2009
IEEE
Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such system...
WADS
1989
Springer
13 years 9 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
NBIS
2007
Springer
13 years 11 months ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...