The design and analysis of spatial data structures
The design and analysis of spatial data structures
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
The performance of current B-tree algorithms
ACM Transactions on Database Systems (TODS)
Implementing deletion in B+-trees
ACM SIGMOD Record
Topological relations in the world of minimum bounding rectangles: a study with R-trees
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
DOT: A Spatial Access Method Using Fractals
Proceedings of the Seventh International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Indexing Valid Time Databases via B+-Trees
IEEE Transactions on Knowledge and Data Engineering
Interval Sequences: An Object-Relational Approach to Manage Spatial Data
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |