Author:
Choubey Rupesh,Chen Li,Rundensteiner Elke A.
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. L. Arge, K. Hinrichs, J. Vahrenhold, and J. Vitter. Efficient Bulk Operations on Dynamic R-trees. Workshop on Algorithm Engineering and Experimentation ALENEX 99, pages 92–103, 1999.
2. M. R. Anderberg. Probability and Mathematical Statistics. Academic Press, New York, San Francisco, London, 1973.
3. C.H. Ang and T.C. Tan. New Linear Node Splitting Algorithm for R-trees. Advances in Spatial Databases, pages 339–349, 1997.
4. N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. Proceedings of SIGMOD, pages 322–331, 1990.
5. J. Bercken, P. Widmayer, and B. Seeger. A Generic Approach to Bulk Loading Multidimensional Index Structures. International Conference on Very Large Data Bases, pages 406–415, 1997.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献