Brief announcement: ART--sub-logarithmic decentralized range query processing with probabilistic guarantees

Authors:
Spyros Sioutas;George Papaloukopoulos;Evangelos Sakkopoulos;Kostas Tsichlas;Yannis Manolopoulos;Peter Triantafillou
Affiliations:
Ionian University, Corfu, Greece;University of Patras, Patras, Greece;University of Patras, Patras, Greece;Aristotle University of Thessaloniki, Thessaloniki, Greece;Aristotle University of Thessaloniki, Thessaloniki, Greece;University of Patras, Patras, Greece
Venue:
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2010

Citing 1
Cited 3

P2P Networking and Applications

P2P Networking and Applications

SART: dynamic P2P query processing in sensor networks with probabilistic guarantees

Proceedings of the 27th Annual ACM Symposium on Applied Computing
DREAM: a distributed fRamework for customized dEployment of a vAriety of indexing engines over million-node overlays

Proceedings of the 27th Annual ACM Symposium on Applied Computing
SART: speeding up query processing in sensor networks with an autonomous range tree structure

ACM SIGAPP Applied Computing Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

We focus on range query processing on large-scale, typically distributed infrastructures. In this work we present the ART (Autonomous Range Tree) structure, which outperforms the most popular decentralized structures, including Chord (and some of its successors), BATON (and its successor) and Skip-Graphs. ART supports the join/leave and range query operations in O(log log N) and O(log2b logN +|A|) expected w.h.p number of hops respectively, where the base b is a double-exponentially power of two, N is the total number of peers and |A| the answer size.