Skip to main content

On the Generation of Spatiotemporal Datasets

  • Conference paper
  • First Online:
Advances in Spatial Databases (SSD 1999)

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

Included in the following conference series:

Abstract

An efficient benchmarking environment for spatiotemporal access methods should at least include modules for generating synthetic datasets, storing datasets (real datasets included), collecting and running access structures, and visualizing experimental results. Focusing on the dataset repository module, a collection of synthetic data that would simulate a variety of real life scenarios is required. Several algorithms have been implemented in the past to generate static spatial (point or rectangular) data, for instance, following a predefined distribution in the workspace. However, by introducing motion, and thus temporal evolution in spatial object definition, generating synthetic data tends to be a complex problem. In this paper, we discuss the parameters to be considered by a generator for such type of data, propose an algorithm, called “Generate_Spatio_Temporal_Data” (GSTD), which generates sets of moving point or rectangular data that follow an extended set of distributions. Some actual generated datasets are also presented. The GSTD source code and several illustrative examples are currently available to all researchers through the Internet.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  1. N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger, “The R*-tree: An Efficient and Robust Access Method for Points and Rectangles”, Proceedings of ACM SIGMOD Conference, 1990.

    Google Scholar 

  2. D. Bitton, D. J. DeWitt, C. Turbyfill, “Benchmarking Database Systems: A Systematic Approach”, Proceedings of the 9th International Conference on Very Large Data Bases (VLDB), 1983.

    Google Scholar 

  3. M. Erwig, R. H. Güting, M. Schneider, M. Vazirgiannis, “Abstract and Discrete Modeling of Spatio-Temporal Data Types”, Proceedings of the 6th ACM International Workshop on Geographical Information Systems (ACM-GIS), 1998.

    Google Scholar 

  4. V. Gaede, O. Günther, “Multidimensional Access Methods”, ACM Computing Surveys, 30(2): 170–231, June 1998.

    Article  Google Scholar 

  5. J. Gray, P. Sundaresan, S. Englert, K. Backlawski, P.J. Weinberger, “Quickly Generating Billion-Record Synthetic Databases”, Proceedings of ACM SIGMOD Conference, 1994.

    Google Scholar 

  6. O. Günther, V. Oria, P. Picouet, J.-M. Saglio, M. Scholl, “Benchmarking Spatial Joins A La Carte”, Proceedings of the 10th International Conference on Scientific and Statistical Database Managemen (SSDBM), 1998.

    Google Scholar 

  7. A. Guttman, “R-trees: A Dynamic Index Structure for Spatial Searching”, Proceedings of ACM SIGMOD Conference, 1984.

    Google Scholar 

  8. Y. Ioannidis, M. Livny, S. Gupta, N. Ponnekanti, “ZOO: A Desktop Experiment Management Environment”, Proceedings of the 22nd International Conference on Very Large Data Bases (VLDB), 1996.

    Google Scholar 

  9. I. Kamel, C. Faloutsos, “Hilbert R-tree: An Improved R-tree Using Fractals”, Proceedings of the 20th International Conference on Very Large Data Base (VLDB), 1994.

    Google Scholar 

  10. A. Kumar, V.J. Tsotras, C. Faloutsos, “Designing Access Methods for Bi-temporal Databases”, IEEE Transactions on Knowledge and Data Engineering, 10(1): 1–20, January-February 1998.

    Article  Google Scholar 

  11. D. Lomet, B. Saltzberg, “Access Methods for Multiversion Data”, Proceedings of ACM SIGMOD Conference, 1989.

    Google Scholar 

  12. Y. Manolopoulos, G. Kapetanakis, “Overlapping B+-trees for Temporal Data”, Proceedings of the 5th Jerusalem Conference on Information Technology (JCIT), 1990.

    Google Scholar 

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

    Google Scholar 

  14. M.A. Nascimento, J.R.O. Silva, Y. Theodoridis, “Access Structures for Moving Points”, TimeCenter Technical Report TR-33, August 1998.

    Google Scholar 

  15. A.N. Papadopoulos, P. Rigaux, M. Scholl, “A Performance Evaluation of Spatial Join Processing Strategies”, Proceedings of the 6th International Symposium on Large Spatial Databases (SSD), 1999.

    Google Scholar 

  16. D. Pfoser, C.S. Jensen, “Capturing the Uncertainty of Moving-Object Representations”, Proceedings of the 6th International Symposium on Large Spatial Databases (SSD), 1999.

    Google Scholar 

  17. B. Salzberg, V.J. Tsotras, “A Comparison of Access Methods for Temporal Data”, ACM Computing Surveys, 31(1), 1999.

    Google Scholar 

  18. H. Samet, “The Quadtree and Related Hierarchical Data Structures”, ACM Computing Surveys, 16(2): 187–260, 1984.

    Article  MathSciNet  Google Scholar 

  19. A. P. Sistla, O. Wolfson, S. Chamberlain, S. Dao, “Modeling and Querying Moving Objects”, Proceedings of the 13th IEEE Conference on Data Engineering (ICDE), 1997.

    Google Scholar 

  20. M. Stonebraker, J. Frew, J. Dozier, “The SEQUOIA 2000 Project”, Proceedings of the 3rd International Symposium on Large Spatial Databases (SSD), 1993.

    Google Scholar 

  21. M. Stonebraker, J. Frew, K. Gardels, J. Meredith, “The SEQUOIA 2000 Storage Benchmark”, Proceedings of ACM SIGMOD Conference, 1993.

    Google Scholar 

  22. Y. Theodoridis, T. Sellis, A. Papadopoulos, Y. Manolopoulos, “Specifications for Efficient Indexing in Spatiotemporal Databases”, Proceedings of the 10th International Conference on Scientific and Statistical Database Management (SSDBM), 1998.

    Google Scholar 

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

    Google Scholar 

  24. N. Tryfona, “Modeling Phenomena in Spatiotemporal Applications: Desiderata and Solutions”, Proceedings of the 9th International Conference on Database and Expert Systems Applications (DEXA), 1998.

    Google Scholar 

  25. T. Tzouramanis, M. Vassilakopoulos, Y. Manolopoulos, “Overlapping Linear Quadtrees: a Spatiotemporal Access Method”, Proceedings of the 6th ACM International Workshop on Geographical Information Systems (ACM-GIS), 1998.

    Google Scholar 

  26. O. Wolfson, B. Xu, S. Chamberlain, L. Jiang, “Moving Objects Databases: Issues and Solutions”, Proceedings of the 10th International Conference on Scientific and Statistical Database Management (SSDBM), 1998.

    Google Scholar 

  27. X. Xu, J. Han, 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 

  28. J. Zobel, A. Moffat, K. Ramamohanarao, “Guidelines for Presentation and Comparison of Indexing Techniques”, ACM SIGMOD Record, 25(3): 10–15, 1996.

    Article  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

Theodoridis, Y., Silva, J.R.O., Nascimento, M.A. (1999). On the Generation of Spatiotemporal Datasets. In: Güting, R.H., Papadias, D., Lochovsky, F. (eds) Advances in Spatial Databases. SSD 1999. Lecture Notes in Computer Science, vol 1651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48482-5_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-48482-5_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66247-1

  • Online ISBN: 978-3-540-48482-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics