Query Responsive Index Structures

作者: Ludger Becker , Hannes Partzsch , Jan Vahrenhold

DOI: 10.1007/978-3-540-87473-7_1

关键词:

摘要: In this paper, we generalize the notion of self-adapting one-dimensional index structures to a wide class spatial structures. The resulting query responsive structurescan adapt their structure users' pattern and thus have potential improve response time in practice. We outline two general approaches providing responsiveness present results terms well-known R?-tree. Our experiments show that depending on significant improvements can be obtained

参考文章(36)
Vram Kouramajian, Mohammad Athar Khalil, Ibrahim Kamel, Bulk insertion in dynamic r-trees ,(1996)
Ibrahim Kamel, Faloutsos: "hilbert r-tree: an improved r-tree using fractals very large data bases. ,(1994)
K. V. Ravi Kanth, Ambuj Singh, Optimal Dynamic Range Searching in Non-replicating Index Structures international conference on database theory. pp. 257- 276 ,(1999) , 10.1007/3-540-49257-7_17
Scott T. Leutenegger, Mario A. Lopez, Yván J. García, On Optimal Node Splitting for R-trees very large data bases. pp. 334- 344 ,(1998)
Rupesh Choubey, Li Chen, Elke A. Rundensteiner, GBI: A Generalized R-Tree Bulk-Insertion Strategy Lecture Notes in Computer Science. pp. 91- 108 ,(1999) , 10.1007/3-540-48482-5_8
David B. Lomet, Grow and Post Index Trees: Roles, Techniques and Future Potential SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases. pp. 183- 206 ,(1991) , 10.1007/3-540-54414-3_38
Hector Garcia-Molina, Proceedings of the 1990 ACM SIGMOD international conference on Management of data international conference on management of data. ,(1990)
Ibrahim Kamel, Christos Faloutsos, Hilbert R-tree: An Improved R-tree using Fractals very large data bases. pp. 500- 509 ,(1994)