STR: a simple and efficient algorithm for R-tree packing
- 22 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A simple analysis of the LRU buffer policy and its relationship to buffer warm-up transientPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The effect of buffering on the performance of R-treesIEEE Transactions on Knowledge and Data Engineering, 2000
- An Advancing Front Delaunay Triangulation Algorithm Designed for RobustnessJournal of Computational Physics, 1995
- On packing R-treesPublished by Association for Computing Machinery (ACM) ,1993
- The R*-tree: an efficient and robust access method for points and rectanglesPublished by Association for Computing Machinery (ACM) ,1990
- Fractals for secondary key retrievalPublished by Association for Computing Machinery (ACM) ,1989
- Filtering Search: A New Approach to Query-AnsweringSIAM Journal on Computing, 1986
- Direct spatial search on pictorial databases using packed R-treesPublished by Association for Computing Machinery (ACM) ,1985
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- Time- and space-optimality in B-treesACM Transactions on Database Systems, 1981