Q-Tree: A multi-attribute based range query solution for tele-immersive framework

Md Ahsan Arefin, Md Yusuf Sarwar Uddin, Indranil Gupta, Klara Nahrstedt

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publication2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09
Pages299-307
Number of pages9
DOIs
StatePublished - Oct 27 2009
Event2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09 - Montreal, QC, Canada
Duration: Jun 22 2009Jun 26 2009

Publication series

NameProceedings - International Conference on Distributed Computing Systems

Other

Other2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09
CountryCanada
CityMontreal, QC
Period6/22/096/26/09

Fingerprint

Pavement overlays
Composite materials
Resource allocation
Agglomeration
Topology
Engines
Monitoring

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Arefin, M. A., Uddin, M. Y. S., Gupta, I., & Nahrstedt, K. (2009). Q-Tree: A multi-attribute based range query solution for tele-immersive framework. In 2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09 (pp. 299-307). [5158438] (Proceedings - International Conference on Distributed Computing Systems). https://doi.org/10.1109/ICDCS.2009.41

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 proceedingConference contribution

Arefin, MA, Uddin, MYS, Gupta, I & Nahrstedt, K 2009, Q-Tree: A multi-attribute based range query solution for tele-immersive framework. in 2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09., 5158438, Proceedings - International Conference on Distributed Computing Systems, pp. 299-307, 2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09, Montreal, QC, Canada, 6/22/09. https://doi.org/10.1109/ICDCS.2009.41
Arefin MA, Uddin MYS, Gupta I, Nahrstedt K. Q-Tree: A multi-attribute based range query solution for tele-immersive framework. In 2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09. 2009. p. 299-307. 5158438. (Proceedings - International Conference on Distributed Computing Systems). https://doi.org/10.1109/ICDCS.2009.41
Arefin, Md Ahsan ; Uddin, Md Yusuf Sarwar ; Gupta, Indranil ; Nahrstedt, Klara. / Q-Tree : A multi-attribute based range query solution for tele-immersive framework. 2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09. 2009. pp. 299-307 (Proceedings - International Conference on Distributed Computing Systems).
@inproceedings{e173c186bbd844eba0f9bdb38068bddc,
title = "Q-Tree: A multi-attribute based range query solution for tele-immersive framework",
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.",
author = "Arefin, {Md Ahsan} and Uddin, {Md Yusuf Sarwar} and Indranil Gupta and Klara Nahrstedt",
year = "2009",
month = "10",
day = "27",
doi = "10.1109/ICDCS.2009.41",
language = "English (US)",
isbn = "9780769536606",
series = "Proceedings - International Conference on Distributed Computing Systems",
pages = "299--307",
booktitle = "2009 29th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS, 09",

}

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 -