On character-based index schemes for complex wildcard search in peer-to-peer networks

We present a family of character-based index schemes for wildcard search in peer-to-peer networks. The supported query format allows the two wildcard matching operators '?' and '*' to be used arbitrarily. To our knowledge, no distributed solution for this general form of wildcard search has been proposed thus far. Moreover, the schemes can achieve balanced loads, avoid hot-spots and single points of failure, reduce storage and maintenance costs, and offer ranking mechanisms for matching objects. The main focus is on a thorough comparative study on these index schemes from the following perspectives: query expressiveness, encoding effectiveness, load balance, and search performance.

[1]  Yuh-Jzer Joung,et al.  KISS: A Simple Prefix Search Scheme in P2P Networks , 2006, WebDB.

[2]  Gang Chen,et al.  Supporting multi-dimensional queries in mobile P2P network , 2011, Inf. Sci..

[3]  Peter Triantafillou,et al.  Substring Matching in P2P Publish/Subscribe Data Management Networks , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[4]  Yuh-Jzer Joung,et al.  Keyword Search in DHT-Based Peer-to-Peer Networks , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[5]  Florian Schintke,et al.  Range queries on structured overlay networks , 2008, Comput. Commun..

[6]  Karl Aberer,et al.  Range queries in trie-structured overlays , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[7]  Aoying Zhou,et al.  Personalized query evaluation in ring-based P2P networks , 2013, Inf. Sci..

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

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

[10]  Christian Scheideler,et al.  Peer-to-peer systems for prefix search , 2003, PODC '03.

[11]  Peter Triantafillou,et al.  PastryStrings: A Comprehensive Content-Based Publish/Subscribe DHT Network , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[12]  Yunhao Liu,et al.  Optimizing Bloom Filter Settings in Peer-to-Peer Multikeyword Searching , 2012, IEEE Transactions on Knowledge and Data Engineering.

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

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

[15]  Scott Shenker,et al.  Complex Queries in Dht-based Peer-to-peer Networks , 2002 .

[16]  Jonathan Kirsch,et al.  Load balancing and locality in range-queriable data structures , 2004, PODC '04.

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

[18]  Ben Y. Zhao,et al.  Approximate Object Location and Spam Filtering on Peer-to-Peer Systems , 2003, Middleware.

[19]  Weidong Xiao,et al.  P2P-based multidimensional indexing methods: A survey , 2011, J. Syst. Softw..

[20]  Yiwei Thomas Hou,et al.  Guest Editorial Recent Advances in Service Overlay Networks , 2004 .

[21]  Sandhya Dwarkadas,et al.  Hybrid Global-Local Indexing for Efficient Peer-to-Peer Information Retrieval , 2004, NSDI.

[22]  Sriram Ramabhadran,et al.  Brief announcement: prefix hash tree , 2004, PODC '04.

[23]  Wolfgang Nejdl,et al.  HyperCuP - Hypercubes, Ontologies, and Efficient Search on Peer-to-Peer Networks , 2002, AP2PC.

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

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

[26]  Beng Chin Ooi,et al.  Supporting multi-dimensional range queries in peer-to-peer systems , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[27]  Jun Gao,et al.  An adaptive protocol for efficient support of range queries in DHT-based systems , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[28]  Hector Garcia-Molina,et al.  Adlib: a self-tuning index for dynamic peer-to-peer systems , 2005, 21st International Conference on Data Engineering (ICDE'05).

[29]  Kang-Won Lee,et al.  Keyword fusion to support efficient keyword-based search in peer-to-peer file sharing , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[30]  Bin Liu,et al.  Supporting Complex Multi-Dimensional Queries in P2P Systems , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[31]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[32]  Dimitrios Tsoumakos,et al.  Replica-aware, multi-dimensional range queries in Distributed Hash Tables , 2010, Comput. Commun..

[33]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[34]  Yuh-Jzer Joung,et al.  Wildcard Search in Structured Peer-to-Peer Networks , 2007, IEEE Transactions on Knowledge and Data Engineering.

[35]  Guangwen Yang,et al.  Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning , 2004, IPTPS.

[36]  Frank van Harmelen,et al.  Expertise-based peer selection in Peer-to-Peer networks , 2008, Knowledge and Information Systems.