Paper Info
Title
dragon: Multidimensional range queries on distributed aggregation trees
Abstract
Distributed query processing is of paramount importance in next-generation distribution services, such as Internet of Things (IoT) and cyber–physical systems. Even if several multi-attribute range queries supports have been proposed for peer-to-peer systems, these solutions must be rethought to fully meet the requirements of new computational paradigms for IoT, like fog computing. This paper proposes dragon, an efficient support for distributed multi-dimensional range query processing targeting efficient query resolution on highly dynamic data. In dragon nodes at the edges of the network collect and publish multi-dimensional data. The nodes collectively manage an aggregation tree storing data digests which are then exploited, when resolving queries, to prune the sub-trees containing few or no relevant matches. Multi-attribute queries are managed by linearizing the attribute space through space filling curves. We extensively analysed different aggregation and query resolution strategies in a wide spectrum of experimental set-ups. We show that dragon manages efficiently fast changing data values. Further, we show that dragon resolves queries by contacting a lower number of nodes when compared to a similar approach in the state of the art.
Year
DOI
Venue
2016
10.1016/j.future.2015.07.020
Future Generation Computer Systems
Keywords
Field
DocType
Internet of things,Tree data structures,Overlay networks,Query processing,Peer-to-peer computing,Distributed computing
Computer science,Range query (data structures),Tree (data structure),Internet of Things,Draco (constellation),Peer to peer computing,Fog computing,Dynamic data,Overlay network,Distributed computing
Journal
Volume
ISSN
Citations 
55
0167-739X
7
PageRank 
References 
Authors
0.48
24
3
Name
Order
Citations
PageRank
Emanuele Carlini116620.15
Alessandro Lulli28210.35
L. Ricci38214.76