Abstract
In this paper, cell abstract indices are presented to process content-based approximate queries in 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, cell abstract indices have low system cost, can improve the query processing speed, and support very frequent updates and the set information publishing method. Simulation experiments are performed and analyzed to show the effectiveness of the proposed indices.
This work was supported by the 973 Research Plan of China under Grant No. G1999032704, the NSF of China under Grant No. 60273082, the 863 Research Plan of China under Grant No. 2002AA444110 and the Army Research Plan of China under Grant No.41315.2.3.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wang, C., Li, J., Shi, S.: An Approach to Content-Based Approximate Query Processing in Peer-to-Peer Data Systems. In: Proceedings of the Second International Workshop on Grid and Cooperative Computing, Shanghai, China (2003)
Wang, C., Li, J., Shi, S.: AbIx: An Approach to Content-Based Approximate Queries in Peer-to-Peer Data Systems. Tech. Report HIT/CSED-DB-03-0710, Database Lab. of Harbin Institute of Technology, Harbin, China (2003)
Yang, B., Garcia-Molina, H.: Efficient Search in Peer-to-Peer Networks. In: Proceedings of the 22nd International Conference on Distributed Computing Systems, pp. 5–14 (2002)
Crespo, A., Garcia-Molina, H.: Routing Indices for Peer-to-Peer Systems. In: Proceedings of the 22nd International Conference on Distributed Computing Systems, pp. 23–34 (2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A Scalable Content-Addressable Network. In: Proceedings of ACM SIGCOMM, pp. 161–172 (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp. 329–350 (2001)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. IEEE/ACM Transactions on Networking 11, 17–32 (2003)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An Infrastructure for Faulttolerant Wide-area Location and Routing. Tech. Report UCB/CSD-01-1141, University of California, Berkeley, California 94720 (2001)
Cuenca-Acuna, F.M., Nguyen, T.D.: Text-Based Content Search and Retrieval in ad hoc P2P Communities. In: Proceedings of the International Workshop on Peer-to-Peer Computing (2002)
Tang, C., Xu, Z., Mahalingam, M.: pSearch: Information Retrieval in Structured Overlays. In: Proceedings of the 1st HotNets-I, Princeton, New Jersey, USA. ACM Press, New York (2002)
Wang, C., Li, J., Shi, S.: A Kind of Content-Based Music Information Retrieval Method in a Peer-to-Peer Environment. In: Proceedings of the 3rd International Symposium on Music Information Retrieval, Paris, France, pp. 178–186 (2002)
Gao, J., Tzanetakis, G., Steenkiste, P.: Content-Based Retrieval of Music in Scalable Peer-to-Peer Networks. In: The 2003 IEEE International Conference on Multimedia & Expo(ICME 2003), Baltimore, MD, USA, IEEE CS Press, Los Alamitos (2003)
Gribble, S., Halevy, A., Ives, Z., Rodrig, M., Suciu, D.: What Can Database Do for Peer-to-Peer? In: Proceedings of the 4th International Workshop on the Web and Databases, pp. 31–36 (2001)
Halevy, A.Y., Ives, Z.G., Suciu, D., Tatarinov, I.: Schema Mediation in Peer Data Management Systems. In: Proceedings of the 19th International Conference on Data Engineering (2003)
Rowstron, A., Druschel, P.: Storage Management and Caching in PAST, a Large- Scale, Persistent Peer-to-Peer Storage Utility. In: Proceedings of ACM Symposium on Operating System Principles (SOSP 2001), Banff, Canada (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, C., Li, J., Shi, S. (2004). Cell Abstract Indices for Content-Based Approximate Query Processing in Structured Peer-to-Peer Data Systems. In: Yu, J.X., Lin, X., Lu, H., Zhang, Y. (eds) Advanced Web Technologies and Applications. APWeb 2004. Lecture Notes in Computer Science, vol 3007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24655-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-24655-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21371-0
Online ISBN: 978-3-540-24655-8
eBook Packages: Springer Book Archive