Skip to main content

The Po-tree: a Real-time Spatiotemporal Data Indexing Structure

  • Conference paper
Developments in Spatial Data Handling

Abstract

This document describes the Po-tree, a new indexing structure for spatiotemporal databases with real-time constraints. Natural risks management and other system can use arrays of spatially referenced sensors, each of them sending their measurements to a central database. Our solution tries to facilitate the indexing of these data, while favoring the newer ones. It does so by combining two sub-structures for the spatial and temporal components. While Mobility is not yet supported, evolutions of the structures shall be able to deal with it.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  • Adam N., Atluri V., Yu S. & al, 2002, Efficient Storage and Management of Environmental Information, in Proceedings of the 19th IEEE Symposium on Mass Storage Systems, (USA, Maryland)

    Google Scholar 

  • Bentley J.L., 1975, Multidimensional binary search trees in database application, IEEE Transaction on software engineering, 5(4), 333–340.

    Google Scholar 

  • Bliujute R., Jensen C.S., Saltenis S. & al., 2000, Light-Weight Indexing of Bitem-poral Data, in Proceedings of the 12th International Conference on Scientific and Statistical Database Management (Germany, Berlin), pp. 125–138.

    Google Scholar 

  • CENAPRED, 2003, Monitoreo y Vigilancia del Volcan Popocatepetl, http://tornado.cenapred.unam.mx/mvolcan.html

    Google Scholar 

  • Erwif M., Güting R.H., Schenider M. & al, 1999, Spatio-Temporal Data Types: An Approach to Modeling and Querying Moving Objects in Databases, GeoInformatica, 3(3), 269–296

    Google Scholar 

  • Guttman A., 1984, R-trees: a dynamic index structure for spatial searching. In Proceedings 1984 ACM SIGMOD International Conference on Management of Data, (USA, Boston) pp. 47–57

    Google Scholar 

  • Hadjieleftheriou M., 2003, Spatial Index Library, http://www.cs.ucr.edu/~marioh/spatialindex/

    Google Scholar 

  • Haritsa J.R., Seshadri S., 2001, Real-time index concurrency control. In Real Time Database System — Architecture and Techniques, edited by K.Y. Lam and T.W. Kuo (Boston: KluwerAcademic Publishers) ISBN: 0-7923-7218-2, pp. 60–74

    Google Scholar 

  • Lam K.Y., Kuo T.W., 2001, Real time database systems: an overview of systems characteristics and issues. IIn Real Time Database System — Architecture and Techniques, edited by K.Y. Lam and T.W. Kuo (Boston: KluwerAcademic Publishers) ISBN: 0-7923-7218-2, pp. 4–16

    Google Scholar 

  • Lam K.Y., Kuo T.W., Tsang N.W.H., & al, 2000, The reduced ceiling Protocol for concurrency control in real-time database with mixed transactions, The computer journal, 43(1), 65–80

    Article  Google Scholar 

  • Mokbel M., Ghanem T.M. & Aref W.G., 2003, Spatio-temporal Access Methods, IEEE Data Engineering Bulletin, 26(2), pp. 40–49

    Google Scholar 

  • Nascimento, M. & Silva J., 1998, Towards Historical R-trees. In Proceedings of 1998 ACM Symposium on Applied Computing, (USA, Atlanta) pp. 235–240

    Google Scholar 

  • Ooi B.C., Tan K.L., 1997, temporal databases. In Indexing Techniques for Advanced Database Systems, edited by E. Bertino B.C. Ooi, R. Sack-Davies & al (Boston, Kluwer Academic Publishers), ISBN 0-7923-9985-4, 113–150

    Google Scholar 

  • Paspalis N., 2003, Implementation of Range searching Data-Structures and Algorithms, http://www.cs.ucsb.edu/~nearchos/cs235/cs235.html

    Google Scholar 

  • Theodoridis Y., Vazirgiannis M. & Sellis T., 1996, Spatio-temporal indexing for large multimedia application, In Proceedings of the 3rdIEEE conference on multimedia computing and systems, (Japan, Hiroshima)

    Google Scholar 

  • Tzouramanis T., Vassilakopoulos M. & Manolopoulos Y, 2000, Multiversion Linear Quadtrees for Spatio-temporal Data, Proceedings 4th East-European Conference on Advanced Databases and Information Systems, (Czec Republic, Prague) pp.279–292

    Google Scholar 

  • Xu X., Han J. & Lu W.,1990, RT-Tree: an improved R-tree indexing structure for temporal spatial databases, in Proceedings of the 4th International Symposium on Spatial Data Handling, (Switzerland, Zurich) pp. 1040–1049

    Google Scholar 

  • Wang X., Zhou X., Lu S., 2000, Spatiotemporal Data Modeling and Management: A Survey, In Proceedings of the 36th International Conference on Technology of Object-Oriented languages and Systems, (China, Xi’an), pp. 202–221

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Noël, G., Servigne, S., Laurini, R. (2005). The Po-tree: a Real-time Spatiotemporal Data Indexing Structure. In: Developments in Spatial Data Handling. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-26772-7_20

Download citation

Publish with us

Policies and ethics