Content-based overlay networks for XML peers based on multi-level bloom filters

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2944, Issue , 2004, Pages 232-247

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

^a UNIVERSITY OF IOANNINA   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; OVERLAY NETWORKS; XML;

BLOOM FILTERS; CONTENT-BASED; DISTRIBUTED DATA; MULTILEVELS; PATH QUERIES; PEER-TO-PEER SYSTEM; RELEVANT DOCUMENTS;

PEER TO PEER NETWORKS;

EID: 35048851144     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24629-9_17     Document Type: Article

References (20)

1. B. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, pages 13(7): 422-426, July 1970.
2. L. Fan, P. Cao, J. Almeida, A. Broder. Summary cache: A scalable wide-area Web cache sharing protocol. In Procs of ACM SIGCOMM Conference, pages 254-265, Sept. 1998.
3. S.D. Gribble, E.A. Brewer, J.M. Hellerstein, D. Culler. Scalable Distributed Data Structures for Internet Service Construction. In Procs of the Fourth Symposium on Operating Systems Design and Implementation, 2000.
4. T.D. Hodes, S.E Czerwinski, B.Y. Zhao, A.D. Joseph, R.H. Kate. Architecture for Secure Wide-Area Service Discovery. Mobicom '99.
5. M.V. Ramakrishna. Practical performance of Bloom Filters and parallel free-text searching. Communications of the ACM, 32 (10), 1237-1239.
6. A. Crespo and H. Garcia-Molina. Routing Indices for Peer-to-peer Systems. In ICDCS, 2002.
7. S. C. Rhea, J. Kubiatowicz. Probabilistic Location and Routing. In INFOCOM, 2002.
8. A. Crespo and H. Garcia-Molina. Semantic Overlay Networks for P2P Systems. Submitted for publication.
9. G. Koloniari and E. Pitoura. Bloom-Based Filters for Hierarchical Data. WDAS 2003.
10. P. Triantafillou, C. Xiruhaki, M. Koubarakis, N. Ntarmos. Towards High Performance Peer-to-Peer Content and Resource Sharing Systems. CIDR 2003.
11. A. Mohan and V. Kalogeraki. Speculative Routing and Update Propagation: A Kundali Centric Approach. IEEE International Conference on Communications (ICC'03), May 2003.
12. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. Procs. of the 2001 ACM SIGCOMM Conference.
13. The MD5 Message-Digest Algorithm. RFC1321.
14. The Niagara generator, http://www.cs.wisc.edu/niagara
15. W. Nejdl, M. Wolpers, W. Siberski, C. Schmitz, M. Schlosser, I. Brunkhorst, A. Loser. Super-Peer-Based Routing and Clustering Strategies for RDF-Based Peer-To-Peer Networks. WWW 2003, May 2003, Budapest, Hungary. ACM 1-58113-680-3/03/0005.
16. M. Khambatti, K. Ryu, P. Dasgupta. Peer-to-Peer Communities: Formation and Discovery. Fourteenth IASTED International Conference on Parallel and Distributed Computing and Systems, Cambridge, 2002.
17. D. S. 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
18. S. Abiteboul, A. Bonifati, G. Cobéna, I. Manolescu, T. Milo. Dynamic XML Documents with Distribution and Replication. SIGMOD 2003.June 2003, San Diego, CA.
19. S. Saroiu.K. Gummadi and S. Gobble. A measurement study of peer-to-peer file sharing systems. Proceedings of Multimedia Conferencing and Networking 2002.
20. F. S. Annexstein, K. A. Berman and M. A. Jovanovic. Latency Effects on Reachability in Large-scale Peer-to-Peer Networks. Procs of the 13th annual ACM symposium on Parallel algorithms and architectures, Crete, Greece 2001.