INDEXING THE EVOLUTION OF MOVING OBJECTS WITHIN A 2D SPACE USING THE BRICKR STRUCTURES
Andreea Sabau
Abstract
Andreea Sabau
Abstract
Abstract. A growing number of applications manage mobile objects. The storage and the organization within databases of data describing the evolution of these objects is an open challenge. Data must be managed in efficient structures with respect to both the storage space consumed and the data access through these structures. An indexing method that organizes the evolutions of spatial objects within a 2D space is proposed in this paper. The Dynamic-BrickR access method uses two structures: an underlying permanent R*-Tree structure, and an in-memory dynamic space grid structure, that it used for building the terminal nodes to feed the R*-Tree. Experiments show significant improvements of the Dynamic-BrickR method over the R*-Tree index, regarding the dead space and the overlapping volumes. The Dynamic-BrickR inherits from the R*-Tree the capability to be used in answering spatial, temporal and spatio-temporal queries. 1.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract. A growing number of applications manage mobile objects. The storage and the organization within databases of data describing the evolution of these objects is an open challenge. Data must be managed in efficient structures with respect to both the storage space consumed and the data access through these structures. An indexing method that organizes the evolutions of spatial objects within a 2D space is proposed in this paper. The Dynamic-BrickR access method uses two structures: an underlying permanent R*-Tree structure, and an in-memory dynamic space grid structure, that it used for building the terminal nodes to feed the R*-Tree. Experiments show significant improvements of the Dynamic-BrickR method over the R*-Tree index, regarding the dead space and the overlapping volumes. The Dynamic-BrickR inherits from the R*-Tree the capability to be used in answering spatial, temporal and spatio-temporal queries. 1.
Key concepts: Search engine indexing, Access method, Computer science, Tree (set theory), Data structure, Grid, Space (punctuation), Data mining