Please use this identifier to cite or link to this item:
|Title:||VBI-Tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes||Authors:||Jagadish, H.V.
|Issue Date:||2006||Citation:||Jagadish, H.V.,Ooi, B.C.,Vu, Q.H.,Zhang, K.,Zhou, A. (2006). VBI-Tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes. Proceedings - International Conference on Data Engineering 2006 : 34-. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDE.2006.169||Abstract:||Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peer-to-Peer systems. In this paper, we propose a new Peer-to-Peer framework based on a balanced tree structure overlay, which can support extensible centralized mapping methods and query processing based on a variety of multidimensional tree structures, including R-Tree, X-Tree, SS-Tree, and M-Tree. Specifically, in a network with N nodes, our framework guarantees that point queries and range queries can be answered within O(logN) hops. We also provide an effective load balancing strategy to allow nodes to balance their work load efficiently. An experimental assessment validates the practicality of our proposal. © 2006 IEEE.||Source Title:||Proceedings - International Conference on Data Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/40574||ISBN:||0769525709||ISSN:||10844627||DOI:||10.1109/ICDE.2006.169|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 15, 2019
checked on Jun 14, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.