Abstract
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 several distributed query and aggregation systems, the clustered structure of tele-immersive interactive frameworks and their time-sensitive nature and application requirements represent a new class of systems which poses different challenges on this distributed search. Multi-attribute composite range queries are one of the key features in this class. Queries are given in high level descriptions and then transformed into multi-attribute composite range queries. Designing such a query engine with minimum traffic overhead, low service latency, and with static and dynamic nature of large datasets, is a challenging task. In this paper, we propose a general multi-attribute based range query framework, Q-Tree, that provides efficient support for this class of systems. In order to serve efficient queries, Q-Tree builds a single topology-aware tree overlay by connecting the participating nodes in a bottom-up approach, and assigns range intervals on each node in a hierarchical manner. We show the relative strength of Q-Tree by analytically comparing it against P-Tree, P-Ring, Skip-Graph and Chord. With fine-grained load balancing and overlay maintenance, our simulations with PlanetLab traces show that our approach can answer complex queries within a fraction of a second.
| Original language | English (US) |
|---|---|
| Title of host publication | 2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09 |
| Pages | 299-307 |
| Number of pages | 9 |
| DOIs | |
| State | Published - Oct 27 2009 |
| Event | 2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09 - Montreal, QC, Canada Duration: Jun 22 2009 → Jun 26 2009 |
Publication series
| Name | Proceedings - International Conference on Distributed Computing Systems |
|---|
Other
| Other | 2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09 |
|---|---|
| Country | Canada |
| City | Montreal, QC |
| Period | 6/22/09 → 6/26/09 |
Fingerprint
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications
Cite this
Q-Tree : A multi-attribute based range query solution for tele-immersive framework. / Arefin, Md Ahsan; Uddin, Md Yusuf Sarwar; Gupta, Indranil; Nahrstedt, Klara.
2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09. 2009. p. 299-307 5158438 (Proceedings - International Conference on Distributed Computing Systems).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Q-Tree
T2 - A multi-attribute based range query solution for tele-immersive framework
AU - Arefin, Md Ahsan
AU - Uddin, Md Yusuf Sarwar
AU - Gupta, Indranil
AU - Nahrstedt, Klara
PY - 2009/10/27
Y1 - 2009/10/27
N2 - 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 several distributed query and aggregation systems, the clustered structure of tele-immersive interactive frameworks and their time-sensitive nature and application requirements represent a new class of systems which poses different challenges on this distributed search. Multi-attribute composite range queries are one of the key features in this class. Queries are given in high level descriptions and then transformed into multi-attribute composite range queries. Designing such a query engine with minimum traffic overhead, low service latency, and with static and dynamic nature of large datasets, is a challenging task. In this paper, we propose a general multi-attribute based range query framework, Q-Tree, that provides efficient support for this class of systems. In order to serve efficient queries, Q-Tree builds a single topology-aware tree overlay by connecting the participating nodes in a bottom-up approach, and assigns range intervals on each node in a hierarchical manner. We show the relative strength of Q-Tree by analytically comparing it against P-Tree, P-Ring, Skip-Graph and Chord. With fine-grained load balancing and overlay maintenance, our simulations with PlanetLab traces show that our approach can answer complex queries within a fraction of a second.
AB - 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 several distributed query and aggregation systems, the clustered structure of tele-immersive interactive frameworks and their time-sensitive nature and application requirements represent a new class of systems which poses different challenges on this distributed search. Multi-attribute composite range queries are one of the key features in this class. Queries are given in high level descriptions and then transformed into multi-attribute composite range queries. Designing such a query engine with minimum traffic overhead, low service latency, and with static and dynamic nature of large datasets, is a challenging task. In this paper, we propose a general multi-attribute based range query framework, Q-Tree, that provides efficient support for this class of systems. In order to serve efficient queries, Q-Tree builds a single topology-aware tree overlay by connecting the participating nodes in a bottom-up approach, and assigns range intervals on each node in a hierarchical manner. We show the relative strength of Q-Tree by analytically comparing it against P-Tree, P-Ring, Skip-Graph and Chord. With fine-grained load balancing and overlay maintenance, our simulations with PlanetLab traces show that our approach can answer complex queries within a fraction of a second.
UR - http://www.scopus.com/inward/record.url?scp=70350241665&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70350241665&partnerID=8YFLogxK
U2 - 10.1109/ICDCS.2009.41
DO - 10.1109/ICDCS.2009.41
M3 - Conference contribution
AN - SCOPUS:70350241665
SN - 9780769536606
T3 - Proceedings - International Conference on Distributed Computing Systems
SP - 299
EP - 307
BT - 2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09
ER -