Squid: Enabling search in DHT-based systems

A fundamental problem in large scale, decentralized distributed systems is the efficient discovery of information. This paper presents Squid, a peer-to-peer information discovery system that supports flexible searches and provides search guarantees. The fundamental concept underlying the approach is the definition of multi-dimensional information spaces and the maintenance of locality in these spaces. The key innovation is a dimensionality reducing indexing scheme that effectively maps the multi-dimensional information space to physical peers while preserving lexical locality. Squid supports complex queries containing partial keywords, wildcards and ranges. Analytical and simulation results show that Squid is scalable and efficient.

[1]  Ashwin Machanavajjhala,et al.  P-Ring: An Index Structure for Peer-to-Peer Systems , 2004 .

[2]  Zhen Li,et al.  Rudder: a rule-based multi-agent infrastructure for supporting autonomic Grid applications , 2004, International Conference on Autonomic Computing, 2004. Proceedings..

[3]  Manish Parashar,et al.  Flexible information discovery in decentralized distributed systems , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[4]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[5]  Charles E. Catlett,et al.  Standards for Grid Computing: Global Grid Forum , 2003, Journal of Grid Computing.

[6]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM '04.

[7]  Elizabeth R. Jessup,et al.  Matrices, Vector Spaces, and Information Retrieval , 1999, SIAM Rev..

[8]  Min Cai,et al.  MAAN: A Multi-Attribute Addressable Network for Grid Information Services , 2003, Journal of Grid Computing.

[9]  Sriram Ramabhadran,et al.  A case study in building layered DHT applications , 2005, SIGCOMM '05.

[10]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[11]  Amin Vahdat,et al.  Design and implementation tradeoffs for wide-area resource discovery , 2005, HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005..

[12]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[13]  Nanyan Jiang,et al.  Content-based Middleware for De-coupled Interactions in Pervasive Environments , 2004 .

[14]  Cristina Simona Schmidt,et al.  FLEXIBLE INFORMATION DISCOVERY WITH GUARANTEES IN DECENTRALIZED DISTRIBUTED SYSTEMS , 2005 .

[15]  Zhichen Xu,et al.  PeerSearch: Efficient Information Retrieval in Peer-to-Peer Networks , 2002 .

[16]  Manish Parashar,et al.  Engineering a peer-to-peer collaboratory for tissue microarray research , 2004, Proceedings of the Second International Workshop on Challenges of Large Applications in Distributed Environments, 2004. CLADE 2004..

[17]  Hector Garcia-Molina,et al.  One torus to rule them all: multi-dimensional queries in P2P systems , 2004, WebDB '04.

[18]  Gary Carpenter 동적 사용자를 위한 Scalable 인증 그룹 키 교환 프로토콜 , 2005 .

[19]  Amin Vahdat,et al.  Efficient Peer-to-Peer Keyword Searching , 2003, Middleware.

[20]  Artur Andrzejak,et al.  Scalable, efficient range queries for grid information services , 2002, Proceedings. Second International Conference on Peer-to-Peer Computing,.

[21]  Abraham Silberschatz,et al.  Database Systems Concepts , 1997 .

[22]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[23]  Christos Faloutsos,et al.  Analysis of the Clustering Properties of the Hilbert Space-Filling Curve , 2001, IEEE Trans. Knowl. Data Eng..

[24]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[25]  Abraham Silberschatz,et al.  Database System Concepts , 1980 .

[26]  Sujata Banerjee,et al.  NodeWiz: peer-to-peer resource discovery for grids , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..