The DR-tree: A main memory data structure for complex multi-dimensional objects

GeoInformatica

Volumn 5, Issue 2, 2001, Pages 181-207

  Lee, Y J ^a   Chung, C W ^b  

^a Kyungpook National University   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Analytical model; Complex multi dimensional objects; Multi dimensional index structure; Spatial query processing

Indexed keywords

COMPUTER AIDED DESIGN; DATABASE SYSTEMS; ERROR ANALYSIS; MULTIMEDIA SYSTEMS; QUERY LANGUAGES;

MEMORY DATA STRUCTURES;

GEOGRAPHIC INFORMATION SYSTEMS;

COMPUTER AIDED DESIGN; DATABASE; GIS; INDEX METHOD; MULTIMEDIA;

EID: 0035358121     PISSN: 13846175     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011494316133     Document Type: Article

References (23)

1. The LSD tree: Spatial access to multi-dimensional point and non-point objects
2. The R*-tree: An efficient and robust access method for points and rectangles
3. The X-tree: An index structure for high-dimensional data
4. Spatial query processing in an object-oriented database system
5. The TR*-tree: A new representation of polygonal objects supporting spatial queries and operations
6. Redundancy in spatial databases
7. Controlled decomposition strategy for complex spatial objects
8. GENESYS: A system for efficient spatial query processing
9. Multi-step processing of spatial joins
10. R-Trees: A dynamic index structure for spatial searching
11. The grid file: An adaptable, symmetric multikey file structure
12. The quadtree and related hierarchical data structures
13. The R-file: An efficient access for proximity queries
14. Shoring up persistent applications
15. Efficient processing of spatial joins using R-trees
16. A model for the prediction of R-tree performance
17. Analysis of object oriented spatial access methods
18. On packing R-trees
19. A cost model for estimating the performance of spatial joins using R-trees
20. Cost models for join queries in spatial databases