On the Generation of Spatiotemporal Datasets

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.

[1]  Yannis Manolopoulos,et al.  Overlapping B+trees for temporal data , 1990, Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'.

[2]  David B. Lomet,et al.  Access methods for multiversion data , 1989, SIGMOD '89.

[3]  Timos K. Sellis,et al.  Spatio-temporal indexing for large multimedia applications , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[4]  Vassilis J. Tsotras,et al.  Comparison of access methods for time-evolving data , 1999, CSUR.

[5]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[6]  Oliver Günther,et al.  Benchmarking spatial joins a la carte , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[7]  A. Prasad Sistla,et al.  Modeling and querying moving objects , 1997, Proceedings 13th International Conference on Data Engineering.

[8]  Timos K. Sellis,et al.  Specifications for efficient indexing in spatiotemporal databases , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[9]  Dimitrios Gunopulos,et al.  On indexing mobile objects , 1999, PODS '99.

[10]  Nectaria Tryfona,et al.  Modeling Phenomena in Spatiotemporal Databases: Desiderata and Solutions , 1998, DEXA.

[11]  David J. DeWitt,et al.  Building a scaleable geo-spatial DBMS: technology, implementation, and evaluation , 1997, SIGMOD '97.

[12]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[13]  Miron Livny,et al.  Zoo: a desktop experiment management environment , 1997, SIGMOD '97.

[14]  Nectaria Tryfona Modeling Phenomena in Spatiotemporal Applications: Desiderata and Solutions , 1998 .

[15]  David J. DeWitt,et al.  Benchmarking Database Systems A Systematic Approach , 1983, VLDB.

[16]  J TsotrasVassilis,et al.  Designing Access Methods for Bitemporal Databases , 1998 .

[17]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[18]  Mario A. Nascimento,et al.  Towards historical R-trees , 1998, SAC '98.

[19]  Bo Xu,et al.  Moving objects databases: issues and solutions , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[20]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[21]  Vassilis J. Tsotras,et al.  A Comparison of Access Methods for Temporal Data Title a Comparison of Access Methods for Temporal Data Individual Participants , 2022 .

[22]  Michael Stonebraker,et al.  The SEQUOIA 2000 Project , 1993, SSD.

[23]  Christos Faloutsos,et al.  Hilbert R-tree: An Improved R-tree using Fractals , 1994, VLDB.

[24]  Yannis Manolopoulos,et al.  Overlapping linear quadtrees: a spatio-temporal access method , 1998, GIS '98.

[25]  Dieter Pfoser,et al.  Capturing the Uncertainty of Moving-Object Representations , 1999, SSD.

[26]  Michael Stonebraker,et al.  The SEQUOIA 2000 storage benchmark , 1993, SIGMOD '93.

[27]  Christos Faloutsos,et al.  Designing Access Methods for Bitemporal Databases , 1998, IEEE Trans. Knowl. Data Eng..

[28]  Michel Scholl,et al.  A Performance Evaluation of Spatial Join Processing Strategies , 1999, SSD.

[29]  Kenneth Baclawski,et al.  Quickly generating billion-record synthetic databases , 1994, SIGMOD '94.

[30]  Ralf Hartmut Güting,et al.  Abstract and discrete modeling of spatio-temporal data types , 1998, GIS '98.

[31]  James M. Morand,et al.  A performance evaluation , 1980 .

[32]  Kotagiri Ramamohanarao,et al.  Guidelines for presentation and comparison of indexing techniques , 1996, SGMD.

[33]  Christos Faloutsos,et al.  Access Methods for Bi-Temporal Databases , 1995, Temporal Databases.