Scalable distributed aggregate computations through collaboration

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Computing aggregates over distributed data sets constitutes an interesting class of distributed queries. Recent advances in peer-to-peer discovery of data sources and query processing techniques have made such queries feasible and potentially more frequent. The concurrent execution of multiple and often identical distributed aggregate queries can place a high burden on the data sources. This paper identifies the scalability bottlenecks that can arise in large peer-to-peer networks from the execution of large numbers of aggregate computations and proposes a solution. In our approach peers are assigned the role of aggregate computation maintainers, which leads to a substantial decrease in requests to the data sources and also avoids duplicate computation by the sites that submit identical aggregate queries. Moreover, a framework is presented that facilitates the collaboration of peers in maintaining aggregate query results. Experimental evaluation of our design demonstrates that it achieves very good performance and scales to thousands of peers. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Galanis, L., & DeWitt, D. J. (2005). Scalable distributed aggregate computations through collaboration. In Lecture Notes in Computer Science (Vol. 3588, pp. 797–807). Springer Verlag. https://doi.org/10.1007/11546924_78

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free