VBI-Tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes

Proceedings - International Conference on Data Engineering

Volumn 2006, Issue , 2006, Pages 25-34

  Jagadish, H V ^a,b   Ooi, Beng Chin ^b   Vu, Quang Hieu ^b   Zhang, Kong ^c   Zhou, Aoying ^c  

^a UNIVERSITY OF MICHIGAN   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c FUDAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; DATA STRUCTURES; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; INDEXING (OF INFORMATION); QUERY LANGUAGES;

CENTRALIZED DATABASE; MULTI DIMENSIONAL INDEXING; PEER TO PEER SYSTEMS (P2P); TREE STRUCTURES;

TREES (MATHEMATICS);

EID: 33749626994     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2006.169     Document Type: Conference Paper

References (21)

1. J. Aspnes and G. Shah. Skip graphs. In Proceeding of The 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 384-393, 2003.
2. N. Beckmann, H.-P.Kriegel, R.Schneider, and B.Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proceedings of the ACM SIGMOD, pages 322-331, 1990.
3. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509-517, Sep 1975.
4. S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-tree: An index structure for high-dimensional data. In Proceedings of the 22nd VLDB Conference, 1996.
5. E. Bertino, B. C. Ooi, R. Sacks-Davis, K.-L. Tan, J. Zobel, B. Shidlovsky, and B. Cantania. Indexing Techniques for Advanced Database Applications. Kluwer Academics, 1997.
6. C. Böhm, S. Berchtold, and D. A. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. 33(3):322-373, Sep 2001.
7. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of the 23rd VLDB Conference, pages 426-435, 1997.
8. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD, pages 47-57, 1984.
9. K. Hinrichs and J. Nievergelt. The grid file: A data structure designed to support proximity queries on spatial objects. In Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science, 1983.
10. H. V. Jagadish, B. C. Ooi, and Q. H. Vu. BATON: A balanced tree structure for peer-to-peer networks. In Proceedings of the 31st VLDB Conference, 2005.
11. D. E. Knuth. The Art of Computer Programming, volume 3. Addison-Wesley Professional, 1998.
12. J. Lee, H. Lee, S. Kang, S. Choe, and J. Song. CISS: An efficient object clustering framework for DHT-based peer-to-peer applications. In DBISP2P, pages 215-229, 2004.
13. W. S. Ng, B. C. Ooi, and K.-L. Tan. Bestpeer: A self-configurable peer-to-peer system. In Proceedings of the 18th ICDE Conference, 2002.
14. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of the 2001 ACM Annual Conference of the Special Interest Group on Data Communication, pages 161-172, 2001.
15. O. D. Sahin, A. Gupta, D. Agrawal, and A. El Abbadi. A peer-to-peer framework for caching range queries. In Proceedings of the 20th ICDE Conference, 2004.
16. C. Schmidt and M. Parashar. Flexible information discovery in decentralized distributed systems. In Proceedings of HPDC-12, 2003.
17. T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-tree: A dynamic index for multi-dimensional objects. In Proceedings of the 13th VLDB Conference, pages 507-518, 1987.
18. Y. Shu, K.-L. Tan, and A. Zhou. Adapting the content native space for load balanced. In DBISP2P, pages 122-135, 2004.
19. C. Tang, Z. Xu, and S. Dwarkadas. Peer-to-peer information retrieval using self-organizing semantic overlay networks. In Proceedings. of the ACM SIGCOMM, 2003.
20. D. A. White and R. Jain. Similarity indexing with the SS-tree. In Proceedings of the 12th ICDE Conference, pages 516-523, 1996.
21. C. Zhang, A. Krishnamurthy, and R. Y. Wang. Skipindex: Towards a scalable peer-to-peer index service for high dimensional data. Technical report, Princeton University, 2004.