Abstract
To provide complex query processing in peer-to-peer systems has attracted much attention in both academic and industrial community. We present GChord, a scalable technique for evaluating queries with multi-attributes. Both exact match and range queries can be handled by GChord. It has advantages over existing methods in that each tuple only needs to be indexed once, while the query efficiency is guaranteed. Thus, index maintenance cost and search efficiency are balanced. Additional optimization techniques further improves the performance of GChord. Extensive experiments are conducted to validate the efficiency of the proposed method.
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
Jagadish, H., Ooi, B., Vu, Q.: Baton: A balanced tree structure for peer-to-peer networks. In: VLDB (2005)
Jagadish, H., Ooi, B., Vu, Q., Zhang, R., Zhou, A.: Vbi-tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes. In: ICDE (2006)
Bharambe, R., Agrawal, M., Seshan, S.: Mercury: supporting scalble multi-attribute range queries. In: SIGCOMM (2004)
Cai, M., Frank, M., Chen, J., Szekely, P.: Maan: a multi-attribute addressable network for grid information services. In: Grid (2003)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Blalakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM, pp. 149–160 (2001)
Evangelidis, G., Lomet, D., Salzberg, B.: The hbpi-tree: a multi-attribute index supporting concurrency,recovery and node consolidation. VLDB Journal 6, 1–25 (1997)
Lomet, D., Salzberg, B.: The hb-tree: a multiattribute indexing method with good guaranteed performance. ACM Trans. Database Syst. 15, 625–658 (1990)
Lometand, D., Salzberg, B.: Access method concurrency with recovery. In: SIGMOD (1992)
Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Francis, S., Handley, P., Karp, M., Shenker, R.: A scalable content-addressable network. In: SIGCOMM (2001)
Jagadish, H., Ooi, B., LeeTan, K., Vu, Q., Zhang, R.: Speeding up search in peertopeer networks with a multiway tree structure. In: SIGMOD (2006)
Gray, F.: Pulse code communications. U.S. Patent 2632058 (1953)
Karnaugh, M.: The map method for synthesis of combinational logic circuits. AIEE 72, 593–599 (1953)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, M., Zhang, R., Qian, W., Zhou, A. (2007). GChord: Indexing for Multi-Attribute Query in P2P System with Low Maintenance Cost. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)