Advertisement

Supporting Similarity Range Queries Efficiently by Using Reference Points in Structured P2P Overlays

Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 20)

Abstract

In recent years, the research issues in peer to peer (P2P) systems have been discussed widely. In a P2P system, the role of each node is the same, and the nodes simultaneously function as both clients and servers to the other nodes on the network. Many studies have been proposed for solving different problems to improve the performance of P2P systems. To solve file availability and network flow problems, a method named distributed hash tables (DHT) has been proposed. However, these DHT-based systems are not able to support efficient queries such as similarity queries, range queries, and skyline queries.

In this paper, a novel method for supporting similarity searches in a structured P2P system is proposed. Compared to other existing works, our approach shows great improvement in precision and guarantees the file availability. The experimental results show the effectiveness of our approach.

Keywords

Peer to Peer Similarity Search Dimension Reduction iDistance 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Falchi, F., Gennaro, C., Zezula, P.: A Content–Addressable Network for Similarity Search in Metric Spaces. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, J.-H., Ouksel, A.M. (eds.) DBISP2P 2005 and DBISP2P 2006. LNCS, vol. 4125, pp. 98–110. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Jagadish, H.V., Ooi, B.C., Tan, K.-L., Yu, C., Zhang, R.: iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. ACM Transactions on Database System (TODS 2005) 30, 364–397 (2005)CrossRefGoogle Scholar
  3. 3.
    Li, M., Lee, G., Lee, W.-C., Sivasubramaniam, A.: PENS: An Algorithm for Density-Based Clustering in Peer-to-Peer Systems. In: Proceedings of INFOSCALE 2006. IEEE Computer Society, Hong Kong (2006)Google Scholar
  4. 4.
    Mass, Y., Sagiv, Y., Shmueli-Scheuer, M.: KMV-peer: a robust and adaptive peer-selection algorithm. In: Proceedings of the 4th ACM International Conference on Web Search and Data Mining, Hong Kong, China, pp. 157–166 (2011)Google Scholar
  5. 5.
    Novak, D., Zezula, P.: M-Chord: A Scalable Distributed Similarity Search Structure. In: Proceedings of the 1st International Conference on Scalable Information Systems, New York, USA, pp. 1–10 (May 2006)Google Scholar
  6. 6.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, San Diego USA, pp. 161–172 (August 2001)Google Scholar
  7. 7.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proceedings of the ACM SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, San Diego, USA, pp. 149–160 (2001)Google Scholar
  8. 8.
    Tang, C., Xu, Z., Mahalingam, M.: pSearch: Information Retrieval in Structured Overlays. ACM SIGCOMM Computer Communication Review 33, 89–94 (2003)CrossRefGoogle Scholar
  9. 9.
    Tang, Y., Xu, J., Zhou, S., Lee, W.C.: A Lightweight Multidimensional Index for Complex Queries over DHTs. IEEE Transactions on Parallel and Distributed Systems 22(12), 2046–2054 (2011)CrossRefGoogle Scholar
  10. 10.
    Tang, Y., Zhou, S., Xu, J.: Light: A Query-Efficient Yet Low-Maintenance Indexing Scheme over Dhts. IEEE Transactions on Knowledge Data Engineering 22(1), 59–75 (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Department of Computer Science and Information EngineeringNational Dong Hwa UniversityHualienTaiwan, R.O.C

Personalised recommendations