Towards a unifying framework for complex query processing over structured peer-to-peer data networks

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

Volumn 2944, Issue , 2004, Pages 169-183

  Triantafillou, Peter ^a   Pitoura, Theoni ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; QUERY LANGUAGES; QUERY PROCESSING; SEARCH ENGINES;

COMPLEX QUERIES; DHT BASED PEER TO PEERS; JOIN OPERATORS; RESEARCH APPROACH; SEARCH ALGORITHMS; SELECTION OPERATORS; STRUCTURED PEER-TO-PEER; SUPPORT FOR PROCESSING;

PEER TO PEER NETWORKS;

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

References (23)

1. Gnutella: http://gnutella.wego.coni
2. st International Workshop on Peer-to-Peer Systems, IPTPS'02 (2002)
3. Stoica, I., Morris, R., Karger, D., Kaashoek, K. F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications. ACM Press (2001) 149-160
4. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable Content-Addressable Network. ACM SIGCOMM '01 (2001)
5. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for larg-scale peer-to-peer systems. In Middleware, vol. 2218 of Lecture Notes in Computer Science. Springer (2001) 329-350
6. Zhao, Y. B., Kubiatowitcz, J., Joseph, A.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, University of California at Berkley, Computer Science Department (2001)
7. th International Conference on Cooperative Information Systems (CoopIS 2001), Trento, Italy (2001)
8. Gribble, S., Halevy, A., Ives, Z., Rodrig, M, Suciu, D.: What Can Databases Do for Peer-to-Peer? In Proc. of the WebDB Workshop on Databases and the Web (2001)
9. Gupta, A., Agrawal, D., Abbadi, A. E.: Approximate Range Selection Queries in Peer-to-Peer Systems. In Proc. of the 2003 CIDR Conference (2003)
10. Broder, A., Charikar, M., Frieze, A., Mitzenmacher M.: Min-wise independent permutations (extended abstract). In Proc. of the thirtieth annual ACM symposium on Theory of computing. ACM Press (1998) 327-336
11. Sahin, O. D., Gupta, A., Agrawal, D., Abbadi, A. E.: Query Processing Over Peer-to-Peer Data Sharing Systems. Technical Report UCSB/CSD-2002-28, University of California at Santa Barbara (2002)
12. nd IEEE International Conference on Peer-to-Peer (2002)
13. Asano, T., Ranjan, D., Roos, T., Welzl, E., Widmaier, P.: Space Filling Curves and their use in Geometric Data Structures. Theoretical Computer Science, 181, (1997) 3-15
14. Felber, P.A., Biersack, E. W., Garces-Erice, L., Ross, K.W., Urvoy-Keller, G.: Data Indexing and querying in DHT Peer-to-Peer Networks. Working paper.
15. st International Workshop on Peer-to-Peer Systems, IPTPS'02 (2002)
16. th VLDB Conference, Berlin, Germany (2003)
17. FIPS180-1. Secure hash Standard. U.S. Department of Commerce/NIST, National Technical Information Service, Springield, VA (1995)
18. st International Workshop on Peer-to-Peer Systems, IPTPS'02 (2002)
19. Mishra, P., Eich, M.: Join Processing in Relational Databases. ACM Computing Surveys, Vol. 24, No. 1 (1992)
20. Kossman, D.: The State of the Art in Distributed Query Processing. ACM Computing Surveys (2000)
21. Clarke, I., et al: Freenet: A Distributed, Anonymous Information Storage and Retrieval System. In Proc. ICSI Works, on Design Issues in Anonymity and Unobservability (2000)
22. Triantafillou, P. et al: Towards High Performance Peer-to-Peer Content and Resource Sharing Systems. In Proc. CIDR Conf. on Innovative Data Systems Research (2003).
23. Triantafillou, P.: Peer-to-Peer Network Architectures: The Next Step. Invited presentation at SIGCOMM'03/FDNA'03 (www.ceid.upatras.gr/faculty/peter/papers/fdna03.pdf).