Computational geometry: an introduction
Computational geometry: an introduction
Proceedings of the sixteenth international conference on Very large databases
Database transaction models for advanced applications
Database transaction models for advanced applications
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Multidimensional binary search trees used for associative searching
Communications of the ACM
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Globally Order Preserving Multidimensional Linear Hashing
Proceedings of the Fourth International Conference on Data Engineering
An Efficient Object-based Algorithm for Spatial Searching, Insertion and Deletion
Proceedings of the Eighth International Conference on Data Engineering
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
The CORDS multidatabase project
IBM Systems Journal
| Hi-index | 0.00 |
Spatial object management is important in numerous application areas, including geographic data, CAD, and VLSI design. It often involves insertion, deletion, and range search of spatial objects, so requires efficient dynamic indexing of objects.This paper describes an (in memory) indexing algorithm developed in the context of concurrency control for large, unstructured objects in non-traditional database applications. It supports insertion, deletion, and range search of orthogonal spatial objects. Our analysis shows it to have a good average-case runtime for databases with relatively low degree of object overlapping, such as the locking application at hand.