Please use this identifier to cite or link to this item:
|Title:||Approximate aggregations in structured P2P networks|
|Keywords:||approximate query processing|
|Citation:||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|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 19, 2018
WEB OF SCIENCETM
checked on Sep 4, 2018
checked on Jun 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.