Skip to main content

Processing of Spatiotemporal Queries in Image Databases

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1691))

  • 260 Accesses

Abstract

Overlapping Linear Quadtrees is a structure suitable for storing consecutive raster images according to transaction time (a database of evolving images). This structure saves considerable space without sacrificing time performance in accessing every single image. Moreover, it can be used for answering efficiently window queries for a number of consecutive images (spatio-temporal queries). In this paper, we present three such temporal window queries: strict containment, border intersect and cover. Besides, based on a method of producing synthetic pairs of evolving images (random images with specified aggregation) we present empirical results on the I/O performance of these queries.

Abstract

Research performed under the European Union’s TMR Chorochronos project, contract number ERBFMRX-CT96-0056 (DG12-BDCN).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. F.W. Burton, M.W. Huntbach and J. Kollias: “Multiple Generation Text Files Using Overlapping Tree Structures”, The Computer Journal, Vol.28,No.4, pp.414–416, 1985.

    Article  Google Scholar 

  2. F.W. Burton, J.G. Kollias, V.G. Kollias and D.G. Matsakis: “Implementation of Overlapping B-trees for Time and Space Efficient Representation of Collection of Similar Files”, The Computer Journal, Vol.33,No.3, pp.279–280, 1990.

    Article  Google Scholar 

  3. V. Gaede and O. Guenther: “Multidimensional Access Methods”, ACM Computer Surveys, Vol.30,No.2, pp.170–231, 1998.

    Article  Google Scholar 

  4. C.S. Jensen, J. Clifford, R. Elmasri, S.K. Gadia, P. Hayes and S. Jajodia (ed.): “A Consensus Glossary of Temporal Database Concepts”, ACM SIGMOD Record, Vol.23,No.1, pp.52–64, 1994.

    Google Scholar 

  5. Y. Manolopoulos and G. Kapetanakis: “Overlapping B+trees for Temporal Data”, Proceedings of the 5th Jerusalem Conference on Information Technology (JCIT), pp.491–498, Jerusalem, Israel, 1990. Address for downloading: http://delab.csd.auth.gr/publications.html

  6. Y. Manolopoulos, E. Nardelli, G. Proietti and M. Vassilakopoulos: “On the Generation of Aggregated Random Spatial Regions”, Proceedings of the 4th International Conference on Information and Knowledge Management (CIKM), pp.318–325, Washington DC, 1995.

    Google Scholar 

  7. M. Nascimento and M. Eich: “An Introductory Survey to Indexing Techniques for Temporal Databases”, Southern Methodist University, Technical Report, 1995.

    Google Scholar 

  8. M.A. Nascimento and J.R.O. Silva: “Towards Historical R-trees”, Proceedings of ACM Symposium on Applied Computing (ACM-SAC), 1998.

    Google Scholar 

  9. B. Saltzberg and V. Tsotras: “A Comparison of Access Methods for Time Evolving Data”, ACM Computing Surveys, to appear. Address for downloading: ftp://ftp.ccs.neu.edu/pub/people/salzberg/tempsurvey.ps.gz.

  10. H. Samet: “The Design and Analysis of Spatial Data Structures”, Addison-Wesley, Reading MA, 1990.

    Google Scholar 

  11. H. Samet: “Applications of Spatial Data Structures”, Addison-Wesley, Reading MA, 1990.

    Google Scholar 

  12. Y. Theodoridis, M. Vazirgiannis and T. Sellis: “Spatio-Temporal Indexing for Large Multimedia Applications”, Proceedings of the 3rd IEEE Conference on Multimedia Computing and Systems (ICMCS), 1996.

    Google Scholar 

  13. Y. Theodoridis, T. Sellis, A. Papadopoulos and Y. Manolopoulos: “Specifications for Efficient Indexing in Spatiotemporal Databases”, Proceedings of the 7th Conference on Statistical and Scientific Database Management Systems (SSDBM), pp.123–132, Capri, Italy, 1998.

    Google Scholar 

  14. T. Tzouramanis, Y. Manolopoulos and N. Lorentzos: “Overlapping B+trees–an Implementation of a Transaction Time Access Method”, Data and Knowledge Engineering, Vol.29,No.3, pp.381–404, 1999.

    Article  Google Scholar 

  15. T. Tzouramanis, M. Vassilakopoulos and Y. Manolopoulos, “Overlapping Linear Quadtrees: a Spatio-temporal Access Method”, Proceedings of the 6th ACM Symposium on Advances in Geographic Information Systems (ACM-GIS), pp.1–7, Bethesda MD, November 1998.

    Google Scholar 

  16. M. Vassilakopoulos, Y. Manolopoulos and K. Economou: “Overlapping for the Representation of Similar Images”, Image and Vision Computing, Vol.11,No.5, pp.257–262, 1993.

    Article  Google Scholar 

  17. M. Vassilakopoulos, Y. Manolopoulos and B. Kroell: “Efficiency Analysis of Overlapped Quadtrees”, Nordic Journal of Computing, Vol.2, pp.70–84, 1995.

    MathSciNet  MATH  Google Scholar 

  18. X. Xu, J. Han, and W. Lu: “RT-tree–an Improved R-tree Index Structure for Spatiotemporal Databases”, Proceedings of the 4th International Symposium on Spatial Data Handling (SDH), 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tzouramanis, T., Vassilakopoulos, M., Manolopoulos, Y. (1999). Processing of Spatiotemporal Queries in Image Databases. In: Eder, J., Rozman, I., Welzer, T. (eds) Advances in Databases and Information Systems. ADBIS 1999. Lecture Notes in Computer Science, vol 1691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48252-0_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48252-0_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66485-7

  • Online ISBN: 978-3-540-48252-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics