• Articles • Previous Articles     Next Articles

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

Chao-Kun Wang1, Jian-Min Wang1, Jia-Guang Sun1, Sheng-Fei Shi2, and Hong Gao2   

  1. 1School of Software, Tsinghua University, Beijing 100084, China 2School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China
  • Received:2006-05-01 Revised:2007-01-21 Online:2007-03-10 Published:2007-03-10

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.

Key words: keyword spotting; keyword spotter; vocabulary independent; acoustic modeling; continuous speech recognition;

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

[2] Balakrishnan H, Kaashoek M, Karger D \it et al. \rm Looking up data in P2P systems. -\it Commun. ACM}, 2003, 46(2): 43--48.

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

[4] Yang B, Garcia-Molina H. Efficient search in peer-to-peer networks. In -\it 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 -\it 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 -\it 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 -\it 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. -\it Computer Communication Review}, 2003, 33(1): 89--94.

[10] Wang C, Li J, Shi S. A kind of content-based music information retrieval method in a peer-to-peer environment. In -\it 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. -\it Computer Music Journal}, 2004, 28(2): 24--33.

[12] Ng W S, Ooi B C, Tan K L \it et al. \rm PeerDB: A P2P-based system for distributed data sharing. In -\it 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 -\it 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.
[1] ZHENG Fang(郑方),SONG Zhanjiang(宋战江),Pascale Fung and William Byrne. Mandarin Pronunciation Modeling Based on CASS Corpus [J]. , 2002, 17(3): 0-0.
[2] ZHENG Fang; XU Mingxing; MOU Xiaolong; WU Jian; WU Wenhu; FANG Ditang;. HarkMan—A Vocabulary-Independent Keyword Spotter for Spontaneons Chinese Speech [J]. , 1999, 14(1): 18-26.
Full text



[1] Chen Yangjun;. Graph Traversal and Top-Down Evaluation of Logic Queries[J]. , 1998, 13(4): 300 -316 .
[2] Sheng-En Li and Shan Wang. Semi-Closed Cube: An Effective Approach to Trading Off Data Cube Size and Query Response Time[J]. , 2005, 20(3): 367 -372 .
[3] Chang-Xuan Wan and Xi-Ping Liu. Structural Join and Staircase Join Algorithms of Sibling Relationship[J]. , 2007, 22(2): 171 -181 .
[4] Fu-Rong Dang, Jin-Tao Tang, Kun-Yuan Pang, Ting Wang, Sha-Sha Li, Xiao Li. Constructing an Educational Knowledge Graph with Concepts Linked to Wikipedia[J]. Journal of Computer Science and Technology, 2021, 36(5): 1200 -1211 .
[5] Yan-Hui Ding(丁艳辉), Member, CCF, Qing-Zhong Li(李庆忠), Senior Member, CCF Yong-Quan Dong(董永权), Member, CCF, and Zhao-Hui Peng(彭朝晖), Member, CCF. 2D Correlative-Chain Conditional Random Fields for Semantic Annotation of Web Objects[J]. , 2010, 25(4): 761 -770 .
[6] Yu Ji, You-Hui Zhang, Wei-Min Zheng. Modelling Spiking Neural Network from the Architecture Evaluation Perspective[J]. , 2016, 31(1): 50 -59 .
[7] Xin Bi, Xiang-Guo Zhao, Guo-Ren Wang. Efficient Processing of Distributed Twig Queries Based on Node Distribution[J]. , 2017, 32(1): 78 -92 .
[8] Mingming Wang, Qianhong Wu, Bo Qin, Qin Wang, Jianwei Liu, Zhenyu Guan. Lightweight and Manageable Digital Evidence Preservation System on Bitcoin[J]. , 2018, 33(3): 568 -586 .
[9] Zhao-Yang Wang, Bei-Hong Jin, Tingjian Ge, Tao-Feng Xue. Detecting Anomalous Bus-Driving Behaviors from Trajectories[J]. Journal of Computer Science and Technology, 2020, 35(5): 1047 -1063 .
[10] Xian-Hua Zeng, Bang-Gui Liu, Meng Zhou. Understanding and Generating Ultrasound Image Description[J]. Journal of Computer Science and Technology, 2018, 33(5): 1086 -1100 .

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: jcst@ict.ac.cn
  Copyright ©2015 JCST, All Rights Reserved