Author:
Hadjieleftheriou Marios,Manolopoulos Yannis,Theodoridis Yannis,Tsotras Vassilis J.
Publisher
Springer International Publishing
Reference26 articles.
1. Ang C-H, Tan TC (1997) New linear node splitting algorithm for r-trees. In: Proceedings of symposium on advances in spatial databases (SSD), Berlin, 15–18 July 1997, pp 339–349
2. Beckmann N, Kriegel H, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of ACM management of data (SIGMOD), Atlantic City, 23–25 May 1990, pp 220–231
3. Brakatsoulas S, Pfoser D, Theodoridis Y (2002) Revisiting r-tree construction principles. In: Proceedings of the East European conference on advances in databases and information systems, Bratislava, 8–11 Sept 2002, pp 149–162
4. Driscoll JR, Sarnak N, Sleator DD, Tarjan RE (1989) Making data structures persistent. J Comput Syst Sci 38(1):86–124
5. Faloutsos C, Kamel I (1994) Beyond uniformity and independence: analysis of r-trees using the concept of fractal dimension. In: Proceedings of ACM symposium on principles of database systems (PODS), Minneapolis, 24–26 May 1994, pp 4–13
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献