Author:
Ravi Kanth K. V.,Singh Ambuj
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. J. L. Bentley. Multi-dimensional binary search trees used for associative searching. Communications of the ACM, 18:509–517, 1975.
2. S. Berchtold, D. A. Keim, and H. P. Kriegel. The X-tree: An index structure for high dimensional data. In Proc. Int. Conf. on Very Large Data Bases, pages 28–39, 1996.
3. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R* tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 322–331, May 23–25 1990.
4. B. Chazelle. Lower bounds for orthogonal range searching: I. The reporting case. Journal of the ACM, 37(2):200–212, April 1990.
5. A. A. Diwan, S. Rane, S. Seshadri, and M. Sudarshan. Clustering techniques for minimizing external path length. Proc. Int. Conf. on Very Large Data Bases, pages 342–353, 1996.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献