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.
- Arm88.M.P. Armstrong. Temporality in spstisl databases. In Proceedings oJ GIS/LIS '88, pages 880-889, San Antonio, Texas, December 1988.Google Scholar
- Aro89.Stan Aronoff. Geographic Information Systems: A Management Perspective. WDL Publications, Ottawa, Ontario, 1989.Google ScholarCross Ref
- Fra92.George F. Frazier. Temporal quadtrees (note: upcoming conference, paper has been accepted). In First International Conference on Information and Knowledge Management, Baltimore, Maryland, November 1992.Google Scholar
- Lan89a.Gall Langran. Accessing spatiotemporal data in temporal GIS. In Proceedings of Auto- Carlo 9, pages 191-198, Baltimore, Maryland, April 1980.Google Scholar
- Lan89b.Gail Langran. Time in Geographic Information Systems. PhD thesis, University of Washington, 1989. Google ScholarDigital Library
- LC88.Gall Langran and N. R. Chrismann. A framework for temporal geographic information. Carlographica, 25(1), 1988.Google Scholar
- MS87.Edwin McKenzie and Richard Snodgrass. Extending the relational algebra to support transaction time. A CM SIGMOD Record, 16:467-478, 1987. Google ScholarDigital Library
- SA85.Richard Snodgrass and Ilsoo Ahn. A taxonomy of time in databases. In P,'oceedings of the International Conference on the Managemen~ of Da~a, A CM Sigmod, pages 236-246, Austin, Texas, May 1985. Google ScholarDigital Library
- SA86.Richard Snodgrass and Ilsoo Ahn. Temporal databases. Computer, 19(9):35-41, 1986. Google ScholarDigital Library
- Sam89.H. Samet. The Design and Analysis of Spatial Da~a Sgradures. Addison Wesley, 1989. Google ScholarDigital Library
- Sno90.Richard Snodgrass. Temgoral databases status and research directions. ACM SIGMOD Record, 19(4):83-89, 1990. Google ScholarDigital Library
- SS87.Arie Segev and Arie Shoshani. Logical modeling of temporal data. ACM SIGMOD Record, 16:454--466, 198"/. Google ScholarDigital Library
Index Terms
- An incremental algorithm for building temporal quadtrees
Recommendations
Navigating through triangle meshes implemented as linear quadtrees
Techniques are presented for navigating between adjacent triangles of greater or equal size in a hierarchical triangle mesh where the triangles are obtained by a recursive quadtree-like subdivision of the underlying space into four equilateral ...
Building and Managing the eMinerals Clusters: A Case Study in Grid-Enabled Cluster Operation
This article describes the configuration, monitoring, management, and use of compute clusters in an environment in which users access resources via grid middleware tools rather than direct logins. The work described here shows that setting up and ...
An efficient temporal verification algorithm for intersectant constraints in scientific workflow
It is usually essential to conduct temporal verification in order to ensure overall temporal correctness for the usefulness of execution results in a scientific workflow. For improving the efficiency of temporal verification, many efforts have been ...
Comments