| | |
Summary: Range queries in trie-structured overlays
Anwitaman Datta, Manfred Hauswirth, Renault John, Roman Schmidt, Karl Aberer
Ecole Polytechnique F´ed´erale de Lausanne (EPFL)
CH-1015 Lausanne, Switzerland
Abstract
Among the open problems in P2P systems, support
for non-trivial search predicates, standardized query lan-
guages, distributed query processing, query load balancing,
and quality of query results have been identified as some of
the most relevant issues. This paper describes how range
queries as an important non-trivial search predicate can
be supported in a structured overlay network that provides
O(log n) search complexity on top of a trie abstraction. We
provide analytical results that show that the proposed ap-
proach is efficient, supports arbitrary granularity of ranges,
and demonstrate that its algorithmic complexity in terms of
messages is independent of the size of the queried ranges
and only depends on the size of the result set. In contrast to
other systems which provide evaluation results only through
simulations, we validate the theoretical analysis of the al-
|
