Efficient data sampling in heterogeneous peer-to-peer networks

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2007, Pages 23-32

  Arai, Benjamin ^a   Lin, Song ^a   Gunopulos, Dimitrios ^a  

^a University of California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ACCURACY; CARDINALITY; DATA SAMPLING; INTERNATIONAL CONFERENCES; LARGE DATASETS; LOCAL OPTIMIZATIONS; MINING TASKS; OVERHEAD COSTS; PEER-TO-PEER DATABASES; PEER-TO-PEER NETWORKS; SAMPLE QUALITY; SAMPLE RATE; TOTAL VARIANCE;

ADMINISTRATIVE DATA PROCESSING; DATA MINING; DATABASE SYSTEMS; DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; MINING; SAMPLING; SEARCH ENGINES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 49749112019     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2007.71     Document Type: Conference Paper

References (28)

1. R. Ananthakrishna, A. Das, J. Gehrke, F. Korn, S. Muthukrishnan, and D. Srivastava. Efficient approximation of correlated sums on data streams. IEEE Transactions on Knowledge and Data Engineering, 15(3):569-572, 2003.
2. B. Arai, G. Das, D. Gunopulos, and V. Kalogeraki. Approximating aggregation queries in peer-to-peer networks. ICDE, 2006.
3. A. Awan, R. A. Ferreira, S. Jagannathan, and A. Grama. Distributed uniform sampling in unstructured peer-to-peer networks. HICSS, 2006.
4. B. Babcock, S. Chaudhuri, and G. Das. Dynamic sample selection for approximate query processing. In SIGMOD '03:Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pages 539-550, New York, NY, USA, 2003. ACM Press.
5. F. Banaei-Kashani and C. Shahabi. Partial selection query in peer-to-peer databases. ICDE, 2006.
6. A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: supporting scalable multi-attribute range queries. In SIGCOMM, pages 353-366, 2004.
7. D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, B. Zhao, and J. Kubiatowicz. Oceanstore: An extremely wide-area storage system. In Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems, November 2000.
8. P. G. Brown and P. J. Haas. Techniques for warehousing of sample data. In Proceedings of the 22nd International Conference on Data Engineering, page 6, 2006.
9. F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. E. Gruber. Bigtable: A distributed storage system for structured data. In OSDI, pages 205-218, 2006.
10. M. Charikar, S. Chaudhuri, R. Motwani, and V. Narasayya. Towards estimation error guarantees for distinct values. In PODS '00: Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 268-279, New York, NY, USA, 2000.
11. S. Chaudhuri, G. Das, M. Datar, R. Motwani, and V. R. Narasayya. Overcoming limitations of sampling for aggregation queries. In ICDE, pages 534-542, 2001.
12. S. Chaudhuri, R. Motwani, and V. Narasayya. Random sampling for histogram construction: how much is enough? pages 436-447, 1998.
13. W. G. Cochran. Sampling Techniques. John Wiley & Sons, New York, NY, 1977.
14. S. Datta and H. Kargupta. Uniform data sampling from a peer-to-peer network. ICDCS, page 50, 2007.
15. eMule. http://www.emule-project.net.
16. P. B. Gibbons, Y. Matias, and V. Poosala. Fast incremental maintenance of approximate histograms. ACM Trans. Database Syst., 27(3):261-298, 2002.
17. P. B. Gibbons, V. Poosala, S. Acharya, Y. Bartal, Y. Matias, S. Muthukrishnan, S. Ramaswamy, and T. Suel. AQUA: System and techniques for approximate query answering. Technical report, Murray Hill, New Jersey, U.S.A., 1998.
18. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In Proceedings of IEEE INFOCOM, 2004.
19. Gnutella. http://www.gnutella.com.
20. J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. In S. Y. W. Su, editor, Proceedings of the Twelfth International Conference on Data Engineering, February 26 - March 1, 1996, New Orleans, Louisiana, pages 152-159. IEEE Computer Society, 1996.
21. P. J. Haas and C. Konig. A bi-level bernoulli scheme for database sampling. In Proceedings of the 2004 ACM SIGMOD international conference on Management of data, pages 275-286, 2004.
22. V. King and J. Saia. Choosing a random peer. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 125-130, 2004.
23. W. Kowalczyk and N. Vlassis. Newscast em. NIPS, pages 713-720, 2004.
24. J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for global-scale persistent storage. In Proceedings of ACM AS-PLOS. ACM, November 2000.
25. F. Olken. Random sampling from databases. In PhD thesis, University of California, Berkeley, 1993.
26. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329-350, Nov 2001.
27. C. Shahabi and F. Banaei-Kashani. Modelling peer-to-peer data networks under complex system theory. IJCSE, 2006.
28. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In In Proceedings of ACM SIGCOMM, August 2001.