An incremental algorithm for building temporal quadtrees

Authors:
George F. Frazier
Affiliations:
Computer Science Department, University of Kansas, Lawrence, KS
Venue:
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Year:
1993

Citing 7
Cited 0

Temporal Databases

Computer
Logical modeling of temporal data

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Extending the relational algebra to support transaction time

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Time in geographic information systems

Time in geographic information systems
The design and analysis of spatial data structures

The design and analysis of spatial data structures
Temporal databases status and research directions

ACM SIGMOD Record - Directions for future database research & development
A taxonomy of time databases

SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

Research involving applications such as geographic information systems, digital cartography, machine-drawing understanding systems, and medical imaging systems has recently focused considerable attention on spatial databases that support temporal reasoning. To develop such applications, several spatiotemporal data models have been proposed. In this work, an incremental algorithm is presented for building temporal quadtrees from a sequence of time-stamped grids. The temporal quadtree data model is particularly well-suited for applications involving highly homogeneous spatiotemporal data. Analysis of the algorithm reveals that an upper bound on its execution time is proportional to the product of the number of time-stamped grids involved and the number of cells in each grid.