Please use this identifier to cite or link to this item: https://doi.org/10.1109/TKDE.2010.198
Title: Approximate aggregations in structured P2P networks
Authors: Sun, D.
Wu, S. 
Jiang, S.
Li, J.
Keywords: approximate query processing
BATON
Peer-to-Peer
Issue Date: 2011
Source: Sun, D.,Wu, S.,Jiang, S.,Li, J. (2011). Approximate aggregations in structured P2P networks. IEEE Transactions on Knowledge and Data Engineering 23 (11) : 1748-1752. ScholarBank@NUS Repository. https://doi.org/10.1109/TKDE.2010.198
Abstract: In corporate networks, daily business data are generated in gigabytes or even terabytes. It is costly to process aggregate queries in those systems. In this paper, we propose PACA, a probably approximately correct aggregate query processing scheme, for answering aggregate queries in structured Peer-to-Peer (P2P) network. PACA retrieves random samples from peers' databases and applies the samples to process queries. Instead of scanning the entire database of each peer, PACA only accesses a small random number of data. Moreover, based on the query distribution,PACA publishes a precomputed synopsis and uses the synopsis to answer future queries. Most queries are expected to be answered by the precomputed synopsis partially or fully. And the synopsis is adaptively tuned to follow the query distribution. Experiments on the PlanetLab show the effectiveness of the approach. © 2011 IEEE.
Source Title: IEEE Transactions on Knowledge and Data Engineering
URI: http://scholarbank.nus.edu.sg/handle/10635/39810
ISSN: 10414347
DOI: 10.1109/TKDE.2010.198
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

3
checked on Dec 5, 2017

WEB OF SCIENCETM
Citations

3
checked on Nov 2, 2017

Page view(s)

56
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.