Moara: Flexible and scalable group-based querying system

Steven Y. Ko, Praveen Yalagandula, Indranil Gupta, Vanish Talwar, Dejan Milojicic, Subu Iyer

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

Abstract

Users and administrators of large-scale infrastructures (e.g., datacenters and PlanetLab) are frequently in need of monitoring groups of machines in the infrastructure. Though there exist several distributed querying systems for this monitoring purpose, they are not group-based; they mostly focus on querying the entire system. In this paper, we present Moara, a new querying system that makes two novel contributions. First, Moara builds aggregation trees for different groups and adaptively maintains the trees to optimize the total message cost. Second, Moara supports a query language allowing groups to be specified implicitly via predicates consisting of arbitrarily nested unions and intersections. Our evaluations on Emulab, on PlanetLab, and with large-scale simulations, demonstrate Moara's ability to answer complex queries within a fraction of a second, to deal with high levels of dynamism in groups, and to incur a low bandwidth overhead per host per query in comparison to existing centralized and distributed aggregation systems.

Original languageEnglish (US)
Title of host publicationMiddleware 2008 - ACM/IFIP/USENIX 9th International Middleware Conference, Proceedings
Pages408-428
Number of pages21
DOIs
StatePublished - Dec 31 2008
EventACM/IFIP/USENIX 9th International Middleware Conference, Middleware 2008 - Leuven, Belgium
Duration: Dec 1 2008Dec 5 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5346 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherACM/IFIP/USENIX 9th International Middleware Conference, Middleware 2008
CountryBelgium
CityLeuven
Period12/1/0812/5/08

Fingerprint

Agglomeration
Monitoring
Query languages
Aggregation
Bandwidth
Infrastructure
Query
Query Language
Costs
Predicate
Distributed Systems
Union
Intersection
Optimise
Entire
Evaluation
Demonstrate
Simulation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Ko, S. Y., Yalagandula, P., Gupta, I., Talwar, V., Milojicic, D., & Iyer, S. (2008). Moara: Flexible and scalable group-based querying system. In Middleware 2008 - ACM/IFIP/USENIX 9th International Middleware Conference, Proceedings (pp. 408-428). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5346 LNCS). https://doi.org/10.1007/978-3-540-89856-6_21

Moara : Flexible and scalable group-based querying system. / Ko, Steven Y.; Yalagandula, Praveen; Gupta, Indranil; Talwar, Vanish; Milojicic, Dejan; Iyer, Subu.

Middleware 2008 - ACM/IFIP/USENIX 9th International Middleware Conference, Proceedings. 2008. p. 408-428 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5346 LNCS).

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

Ko, SY, Yalagandula, P, Gupta, I, Talwar, V, Milojicic, D & Iyer, S 2008, Moara: Flexible and scalable group-based querying system. in Middleware 2008 - ACM/IFIP/USENIX 9th International Middleware Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5346 LNCS, pp. 408-428, ACM/IFIP/USENIX 9th International Middleware Conference, Middleware 2008, Leuven, Belgium, 12/1/08. https://doi.org/10.1007/978-3-540-89856-6_21
Ko SY, Yalagandula P, Gupta I, Talwar V, Milojicic D, Iyer S. Moara: Flexible and scalable group-based querying system. In Middleware 2008 - ACM/IFIP/USENIX 9th International Middleware Conference, Proceedings. 2008. p. 408-428. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-89856-6_21
Ko, Steven Y. ; Yalagandula, Praveen ; Gupta, Indranil ; Talwar, Vanish ; Milojicic, Dejan ; Iyer, Subu. / Moara : Flexible and scalable group-based querying system. Middleware 2008 - ACM/IFIP/USENIX 9th International Middleware Conference, Proceedings. 2008. pp. 408-428 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{68c2bf938c4243c2b5adfa2e32c70779,
title = "Moara: Flexible and scalable group-based querying system",
abstract = "Users and administrators of large-scale infrastructures (e.g., datacenters and PlanetLab) are frequently in need of monitoring groups of machines in the infrastructure. Though there exist several distributed querying systems for this monitoring purpose, they are not group-based; they mostly focus on querying the entire system. In this paper, we present Moara, a new querying system that makes two novel contributions. First, Moara builds aggregation trees for different groups and adaptively maintains the trees to optimize the total message cost. Second, Moara supports a query language allowing groups to be specified implicitly via predicates consisting of arbitrarily nested unions and intersections. Our evaluations on Emulab, on PlanetLab, and with large-scale simulations, demonstrate Moara's ability to answer complex queries within a fraction of a second, to deal with high levels of dynamism in groups, and to incur a low bandwidth overhead per host per query in comparison to existing centralized and distributed aggregation systems.",
author = "Ko, {Steven Y.} and Praveen Yalagandula and Indranil Gupta and Vanish Talwar and Dejan Milojicic and Subu Iyer",
year = "2008",
month = "12",
day = "31",
doi = "10.1007/978-3-540-89856-6_21",
language = "English (US)",
isbn = "3540898557",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "408--428",
booktitle = "Middleware 2008 - ACM/IFIP/USENIX 9th International Middleware Conference, Proceedings",

}

TY - GEN

T1 - Moara

T2 - Flexible and scalable group-based querying system

AU - Ko, Steven Y.

AU - Yalagandula, Praveen

AU - Gupta, Indranil

AU - Talwar, Vanish

AU - Milojicic, Dejan

AU - Iyer, Subu

PY - 2008/12/31

Y1 - 2008/12/31

N2 - Users and administrators of large-scale infrastructures (e.g., datacenters and PlanetLab) are frequently in need of monitoring groups of machines in the infrastructure. Though there exist several distributed querying systems for this monitoring purpose, they are not group-based; they mostly focus on querying the entire system. In this paper, we present Moara, a new querying system that makes two novel contributions. First, Moara builds aggregation trees for different groups and adaptively maintains the trees to optimize the total message cost. Second, Moara supports a query language allowing groups to be specified implicitly via predicates consisting of arbitrarily nested unions and intersections. Our evaluations on Emulab, on PlanetLab, and with large-scale simulations, demonstrate Moara's ability to answer complex queries within a fraction of a second, to deal with high levels of dynamism in groups, and to incur a low bandwidth overhead per host per query in comparison to existing centralized and distributed aggregation systems.

AB - Users and administrators of large-scale infrastructures (e.g., datacenters and PlanetLab) are frequently in need of monitoring groups of machines in the infrastructure. Though there exist several distributed querying systems for this monitoring purpose, they are not group-based; they mostly focus on querying the entire system. In this paper, we present Moara, a new querying system that makes two novel contributions. First, Moara builds aggregation trees for different groups and adaptively maintains the trees to optimize the total message cost. Second, Moara supports a query language allowing groups to be specified implicitly via predicates consisting of arbitrarily nested unions and intersections. Our evaluations on Emulab, on PlanetLab, and with large-scale simulations, demonstrate Moara's ability to answer complex queries within a fraction of a second, to deal with high levels of dynamism in groups, and to incur a low bandwidth overhead per host per query in comparison to existing centralized and distributed aggregation systems.

UR - http://www.scopus.com/inward/record.url?scp=58049115892&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58049115892&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-89856-6_21

DO - 10.1007/978-3-540-89856-6_21

M3 - Conference contribution

AN - SCOPUS:58049115892

SN - 3540898557

SN - 9783540898559

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 408

EP - 428

BT - Middleware 2008 - ACM/IFIP/USENIX 9th International Middleware Conference, Proceedings

ER -