Query workload-aware overlay construction using histograms

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2005, Pages 640-647

  Koloniari, Georgia ^a   Petrakis, Yannis ^a   Pitoura, Evaggelia ^a   Tsotsos, Thodoris ^a  

^a UNIVERSITY OF IOANNINA   (Greece)

Author keywords

Clustering; Overlay Network; Peer to Peer systems; Query Routing; Range Queries; Small Worlds

Indexed keywords

DATA ACQUISITION; INFORMATION ANALYSIS; KNOWLEDGE ACQUISITION;

CLUSTERING; OVERLAY NETWORK; PEER-TO-PEER SYSTEMS; QUERY ROUTING; RANGE QUERIES; SMALL WORLDS;

SECURITY OF DATA;

EID: 33745800708     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1099554.1099717     Document Type: Conference Paper

References (24)

1. K. Aberer, P. Cudré-Mauroux, A. Datta, Z. Despotovic, M. Hauswirth, M. Punceva, and R. Schmidt, P-Grid: A Self-organizing Structured P2P System. Sigmod Record, 32(2), 2003.
2. M. Bawa, G. S. Manku, and P. Raghavan. SETS: Search Enhanced by Topic Segmentation. In SIGIR, 2003.
3. A. R. Bharambe, M. Agrawal and S. Seshan. Mercury: Supporting Scalable Multi-Attribute Range Queries. In SIGCOMM, 2004
4. S-H Cha and S. N. Sribari. On Measuring the Distance Between Histograms. Pattern Recognition, 35:1355-1370, 2002.
5. E. Cohen, A. Fiat and H. Kaplan. Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. In INFOCOM, 2003.
6. A. Crespo and H. Garcia-Molina. Routing Indices for Peer-to-Peer Systems. In ICDCS, 2002.
7. A. Crespo and H. Garcia-Molina. Semantic Overlay Networks for P2P Systems. Technical report, 2002.
8. A. J. Demers, D. H. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. E. Sturgis, D. C. Swinehart and D. B. Terry. Epidemic Algorithms for Replicated Database Maintenance. In PODC, 1987.
9. P. Ganesan, B. Yang, and H. Garcia-Molina. One Torus to Rule Them All: Multidimensional Queries in P2P Systems. In WebDB, 2004.
10. R. Morris I. Stoica, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. IEEE/ACM Trans. on Networking, 11(1):17-32, 2003.
11. A. Iamnitchi, M. Ripeanu, and I. T. Foster. Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations. In IPTPS, 2002.
12. Y. Ioannidis. The History of Histograms. In VLDB, 2003.
13. A. Loser, F. Naumann, W. Siberski, W. Nejdl, and U. Thaden. Semantic Overlay Clusters within Super-Peer Networks. In DBISP2P, 2003.
14. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed Hashing in a Small World. In USENIX Symposium on Internet Technologies and Systems, 2003.
15. Y. Petrakis, G. Koloniari, and E. Pitoura. On Using Histograms as Routing Indexes in Peer-to-Peer Systems. In DBISP2P, 2004.
16. Y. Petrakis, G. Koloniari, T. Tsotsos, and E. Pitoura. On Constructing Workload-Aware Small-Worlds in Peer-to-Peer Systems (extended version of this paper). Technical Report TR2004-14, Univ. of Ioannina, Dept. of Computer Science, Oct 2004.
17. V. Poosala, Y. Ioannidis, P. Haas, and E. Shekita. Improved Histograms for Selectivity Estimation of Range Queries. In SIGMOD, 1996
18. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A Scalable Content-Addressable Network. In SIGCOMM, 2001.
19. O. D. Sahin, A. Gupta, D. Agrawal, and A. El Abbadi. A Peer-to-Peer Framework for Caching Range Queries. In ICDE, 2004.
20. C. Schmidt and M. Parashar. Flexible Information Discovery in Decentralized Distributed Systems. In HPDC, 2003.
21. C. Tang, Z. Xu, and S. Dwarkadas. Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Overlay Networks. In SIGCOMM, 2003.
22. P. Triantafillou, C. Xiruhaki, M. Koubarakis, and N. Ntarmos. Towards High Performance Peer-to-Peer Content and Resource Sharing Systems. In CIDR, 2003.
23. J. S. Vitter. Random Sampling with a Reservoir. ACM Trans. Math Software, 11:37-57,1985.
24. D. J. Watts and S. H. Strogatz. Collective Dynamics of Small-World Networks. Nature, 393:440-442, 1998.