Skip to main content
SpringerLink
Log in

AbIx: An Approach to Content-Based Approximate Query Processing in Peer-to-Peer Data Systems

  • Short Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In recent years there has been a significant interest in peer-to-peer (P2P) environments in the community of data management. However, almost all work, so far, is focused on exact query processing in current P2P data systems. The autonomy of peers also is not considered enough. In addition, the system cost is very high because the information publishing method of shared data is based on each document instead of document set. In this paper, abstract indices (AbIx) are presented to implement content-based approximate queries in centralized, distributed and structured P2P data systems. It can be used to search as few peers as possible but get as many returns satisfying users’ queries as possible on the guarantee of high autonomy of peers. Also, abstract indices have low system cost, can improve the query processing speed, and support very frequent updates and the set information publishing method. In order to verify the effectiveness of abstract indices, a simulator of 10,000 peers, over 3 million documents is made, and several metrics are proposed. The experimental results show that abstract indices work well in various P2P data systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ratnasamy S, Francis P, Handley M et al. A scalable content-addressable network. In Proc. ACM SIGCOMM, UC San Diego, USA, 2001, pp.161–172.

  2. Balakrishnan H, Kaashoek M, Karger D et al. Looking up data in P2P systems. Commun. ACM, 2003, 46(2): 43–48.

    Article  Google Scholar 

  3. Stoica I, Morris R, Liben-Nowell D et al. Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Trans. Networking, 2003, 11(1): 17–32.

    Article  Google Scholar 

  4. Yang B, Garcia-Molina H. Efficient search in peer-to-peer networks. In Proc. Int. Conf. Distributed Computing Systems, Vienna, Austria, 2002, pp.5–14.

  5. Crespo A, Garcia-Molina H. Routing indices for peer-to-peer systems. In Proc. Int. Conf. Distributed Computing Systems, Vienna, Austria, 2002, pp.23–34.

  6. Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. IFIP/ACM Int. Conf. Distributed Systems Platforms (Middleware), Heidelberg, Germany, 2001, pp.329–350.

  7. Zhao B Y, Kubiatowicz J, Joseph A D. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Report UCB/CSD-01-1141, University of California, Berkeley, USA, 2001.

  8. Cuenca-Acuna F M, Nguyen T D. Text-based content search and retrieval in ad hoc p2p communities. In Proc. the International Workshop on Peer-to-Peer Computing, Cambridge, MA, USA, 2002, pp.220–234.

  9. Tang C, Xu Z, Mahalingam M. pSearch: Information retrieval in structured overlays. Computer Communication Review, 2003, 33(1): 89–94.

    Article  Google Scholar 

  10. Wang C, Li J, Shi S. A kind of content-based music information retrieval method in a peer-to-peer environment. In Proc. Int. Symp. Music Information Retrieval, Paris, France, 2002, pp.178–186.

  11. Tzanetakis G, Gao J, Steenkiste P. A scalable peer-to-peer system for music information retrieval. Computer Music Journal, 2004, 28(2): 24–33.

    Article  Google Scholar 

  12. Ng W S, Ooi B C, Tan K L et al. PeerDB: A P2P-based system for distributed data sharing. In Proc. Int. Conf. Data Engineering, Bangalore, India, 2003, pp.633–644.

  13. Tatarinov I, Halevy A. Efficient query reformulation in peer data management systems. In Proc. SIGMOD, Paris, France, 2004, pp.539–550.

  14. Wang C. Research on key techniques of music data management and retrieval [Dissertation]. Harbin Institute of Technology, China, 2005.

Download references

Author information

Authors and Affiliations

  1. School of Software, Tsinghua University, Beijing, 100084, China

    Chao-Kun Wang, Jian-Min Wang & Jia-Guang Sun

  2. School of Computer Science and Technology, Harbin Institute of Technology, Harbin, 150001, China

    Sheng-Fei Shi & Hong Gao

Authors
  1. Chao-Kun Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jian-Min Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jia-Guang Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sheng-Fei Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hong Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chao-Kun Wang.

Additional information

Supported by the National Natural Science Foundation of China under Grant No. 60473077 and the Program for New Century Excellent Talents in University.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, CK., Wang, JM., Sun, JG. et al. AbIx: An Approach to Content-Based Approximate Query Processing in Peer-to-Peer Data Systems. J Comput Sci Technol 22, 280–286 (2007). https://doi.org/10.1007/s11390-007-9035-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-007-9035-5

Keywords

Search

Navigation