The effect of buffering on the performance of R-trees
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 8 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
- STR: a simple and efficient algorithm for R-tree packingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A model for the prediction of R-tree performancePublished by Association for Computing Machinery (ACM) ,1996
- Towards an analysis of range query performance in spatial data structuresPublished by Association for Computing Machinery (ACM) ,1993
- 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
- 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