Efficient approximate query processing in peer-to-peer networks

IEEE Transactions on Knowledge and Data Engineering

Volumn 19, Issue 7, 2007, Pages 919-933

  Arai, Benjamin ^a,b   Das, Gautam ^c   Gunopulos, Dimitrios ^a,b   Kalogeraki, Vana ^a,b  

^a IEEE

^b University of California Riverside   (United States)

^c The University of Texas at Arlington   (United States)

Author keywords

Approximation methods; Computer networks; Database systems; Distributed database query processing; Distributed databases; Distributed estimation; Distributed systems

Indexed keywords

APPROXIMATION METHODS; DISTRIBUTED DATABASE QUERY PROCESSING; DISTRIBUTED DATABASES; DISTRIBUTED ESTIMATION;

AD HOC NETWORKS; APPROXIMATION THEORY; DISTRIBUTED DATABASE SYSTEMS; INTERNET; PARAMETER ESTIMATION; QUERY PROCESSING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34249807061     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2007.1064     Document Type: Article

References (39)

1. S. Acharya, P.B. Gibbons, and V. Poosala, "Aqua: A Fast Decision Support System Using Approximate Query Answers," Proc. 25th Int'l Conf. Very Large Data Bases (VLDB '99), 1999.
2. L. Adamic, R. Lukose, A. Puniyani, and B. Huberman, "Search in Power-Law Networks," Physical Rev. E, 2001.
3. B. Babcock, S. Chaudhuri, and G. Das, "Dynamic Sample Selection for Approximate Query Processing," Proc. 22nd ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '03), pp. 539-550, 2003.
4. A.R. Bharambe, M. Agrawal, and S. Seshan, "Mercury: Supporting Scalable Multi-Attribute Range Queries," Proc. ACM Ann. Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm. (SIGCOMM '04), 2004.
5. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Analysis and Optimization of Randomized Gossip Algorithms," Proc. 43rd IEEE Conf. Decision and Control (CDC '04), 2004.
6. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Gossip and Mixing Times of Random Walks on Random Graphs," Proc. IEEE INFOCOM '05, 2005.
7. M. Charikar, S. Chaudhuri, R. Motwani, and V. Narasayya, "Towards Estimation Error Guarantees for Distinct Values," Proc. 19th ACM Symp. Principles of Database Systems (PODS '00), 2000.
8. S. Chaudhuri, G. Das, M. Datar, R. Motwani, and V. Narasayya, "Overcoming Limitations of Sampling for Aggregation Queries," Proc. 17th IEEE Int'l Conf. Data Eng. (ICDE '01), pp. 534-542, 2001.
9. S. Chaudhuri, R. Motwani, and V. Narasayya, "Random Sampling for Histogram Construction: How Much Is Enough," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '98), pp. 436-447, 1998.
10. S. Chaudhuri, G. Das, and V. Narasayya, "A Robust Optimization-Based Approach for Approximate Answering of Aggregate Queries," Proc. 20th ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '01), 2001.
11. S. Chaudhuri, G. Das, and U. Srivastava, "Effective Use of Block-Level Sampling in Statistics Estimation," Proc. 23rd ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '04), 2004.
12. Y. Chu, S. Rao, and H. Zhang, "A Case for End System Multicast," Proc. ACM Int'l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS '00), 2000.
13. M.M. Espil and A.A. Vaisman, "Aggregate Queries in Peer-to-Peer OLAP," Proc. Seventh ACM Int'l Workshop Data Warehousing and On-Line Analytical Processing (DOLAP '04), 2004.
14. C. Faloutsos, P. Faloutsos, and M. Faloutsos, "On Power-Law Relationships of the Internet Topology," Proc. ACM Ann. Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm. (SIGCOMM '99), 1999.
15. Freenet Homepage, http://freenet.sourceforge.net, 2006.
16. C. Gkantsidis, M. Mihail, and A. Saberi, "Random Walks in Peer-to-Peer Networks," Proc. IEEE INFOCOM '04, 2004.
17. Gnutella Homepage, http://rfc-gnutella.sourceforge.net, 2006.
18. P. Haas and C. Konig, "A Bilevel Bernoulli Scheme for Database Sampling," Proc. 23rd ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '04), 2004.
19. R. Heubsch, J. Hellerstein, N. Lanhan, B.T. Loo, S. Shenker, and I. Stoica, "Querying the Internet with PIER," Proc. 29th Int'l Conf. Very Large Data Bases (VLDB '03), 2003.
20. JUNG Web Site, http://jung.sourceforge.net, 2006.
21. P. Kalnis, W.S. Ng, B.C. Ooi, D. Papadias, and K.-L. Tan, "An Adaptive Peer-to-Peer Network for Distributed Caching of OLAP Results," Proc. 21st ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '02), 2002.
22. Kazaa Homepage, http://www.kazaa.com, 2006.
23. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-Based Computation of Aggregate Information," Proc. 44th Ann. IEEE Symp. Foundations of Computer Science (FOCS '03), 2003.
24. V. King and J. Saia, "Choosing a Random Peer," Proc. 23rd Ann. ACM Symp. Principles of Distributed Computing (PODC '04), 2004.
25. F. Le Fessant, S. Handurukande, A.-M. Kermarrec, and L. Massoulié, "Clustering in Peer-to-Peer File Sharing Workloads," Proc. Third Int'l Workshop Peer-to-Peer Systems (IPTPS '04), 2004.
26. W. Lee, S.J. Stolfo, and K.W. Mok, "A Data Mining Framework for Building Intrusion Detection Models," Proc. IEEE Symp. Security and Privacy, p. 0120, 1999.
27. X. Li, Y.J. Kim, R. Govindan, and W. Hong, "Multi-Dimensional Range Queries in Sensor Networks," Proc. First ACM Int'l Conf. Embedded Networked Sensor Systems (SENSYS '03), 2003.
28. D. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J. Pruyne, B. Richard, S. Rollins, and Z. Xu, "Peer-to-Peer Computing," HP Technical Report HPL-2002-57, 2002.
29. B. Mukherjee, L. Heberlein, and K. Levitt, "Network Intrusion Detection," IEEE Network, vol. 8, no. 3, pp. 26-41, May/June 1994.
30. Napster Homepage, http://www.napster.com, 2006.
31. G. Pandurangan, P. Raghavan, and E. Upfal, "Building Low-Diameter P2P Networks," Proc. 42nd Ann. IEEE Symp. Foundations of Computer Science (FOCS '01), 2001.
32. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," Proc. ACM Ann. Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm. (SIGCOMM '01), 2001.
33. A. Rowstron and P. Druschel, "Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems," Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware '01), 2001.
34. O.D. Sahin, A. Gupta, D. Aggrawal, and A. El Abbadi, "A Peer-to-Peer Framework for Caching Range Queries," Proc. 20th IEEE Int'l Conf. Data Eng. (ICDE '04), 2004.
35. S. Sen, O. Spatscheck, and D. Wang, "Accurate, Scalable In-Network Identification of P2P Traffic Using Application Signatures," Proc. 13th Int'l World Wide Web Conf., 2004.
36. J.L. Simon, Resampling: The New Statistics, second ed., Oct. 1997.
37. I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," Proc. ACM Ann. Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm. (SIGCOMM '01), 2001.
38. D. Zeinalipour-Yazti, V. Kalogeraki, and D. Gunopulos, "Exploiting Locality for Scalable Information Retrieval in Peer-to-Peer Networks," Information System, vol. 30, no. 4, pp. 277-298, 2005.
39. J. Zhao, R. Govindan, and D. Estrin, "Computing Aggregates for Monitoring Wireless Sensor Networks," Proc. First IEEE Int'l Workshop Sensor Network Protocols and Applications (SNPA '03), 2003.