skip to main content
10.1145/170791.170896acmconferencesArticle/Chapter ViewAbstractPublication PagescscConference Proceedingsconference-collections
Article
Free Access

An incremental algorithm for building temporal quadtrees

Published:01 March 1993Publication History

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.

References

  1. Arm88.M.P. Armstrong. Temporality in spstisl databases. In Proceedings oJ GIS/LIS '88, pages 880-889, San Antonio, Texas, December 1988.Google ScholarGoogle Scholar
  2. Aro89.Stan Aronoff. Geographic Information Systems: A Management Perspective. WDL Publications, Ottawa, Ontario, 1989.Google ScholarGoogle ScholarCross RefCross Ref
  3. 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 ScholarGoogle Scholar
  4. Lan89a.Gall Langran. Accessing spatiotemporal data in temporal GIS. In Proceedings of Auto- Carlo 9, pages 191-198, Baltimore, Maryland, April 1980.Google ScholarGoogle Scholar
  5. Lan89b.Gail Langran. Time in Geographic Information Systems. PhD thesis, University of Washington, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. LC88.Gall Langran and N. R. Chrismann. A framework for temporal geographic information. Carlographica, 25(1), 1988.Google ScholarGoogle Scholar
  7. MS87.Edwin McKenzie and Richard Snodgrass. Extending the relational algebra to support transaction time. A CM SIGMOD Record, 16:467-478, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. SA86.Richard Snodgrass and Ilsoo Ahn. Temporal databases. Computer, 19(9):35-41, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Sam89.H. Samet. The Design and Analysis of Spatial Da~a Sgradures. Addison Wesley, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Sno90.Richard Snodgrass. Temgoral databases status and research directions. ACM SIGMOD Record, 19(4):83-89, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. SS87.Arie Segev and Arie Shoshani. Logical modeling of temporal data. ACM SIGMOD Record, 16:454--466, 198"/. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An incremental algorithm for building temporal quadtrees

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          CSC '93: Proceedings of the 1993 ACM conference on Computer science
          March 1993
          543 pages
          ISBN:0897915585
          DOI:10.1145/170791

          Copyright © 1993 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 March 1993

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader