SECONDO: A Platform for Moving Objects Database Research and for Publishing and Integrating Research Implementations

Databases supporting time dependent and continuously changing geometries, called moving ob- jects databases , have been studied for about 15 years. The field has been flourishing and there exist many hundreds, more likely thousands, of publications. However, very few of these results have made it into systems (research prototypes or commercial) and are available for practical use today. It is not that the publications are purely theoretical. In most cases data structures and algorithms have been proposed, implemented, and experimentally evaluated. However, whereas there exists a well established infrastructure for publishing research papers through journals and conferences, no such facilities exist for the publication of the related prototypical implementations. Hence imple- mentations are just done for experiments in the paper and then usually abandoned. This is highly unfortunate even for research, as future proposals of improved algorithms most often have to reim- plement the previous techniques they need to compare to. In this paper we describe an infrastructure for research in moving objects databases that addresses some of these problems. Essentially it allows researchers to implement their new techniques within a system context and to make them available for practical use to all readers of their papers and users of the system. The infrastructure consists of S ECONDO , an extensible database system into which a lot of moving object technology has been built already. It offers BerlinMOD, a benchmark to generate large sets of realistic moving object trajectories together with a comprehensive set of queries. Finally, it offers S ECONDO Plugins as a facility to publish new research implementations that anyone can merge with a standard S ECONDO distribution to have them run in a complete system context.

[1]  Hans-Peter Kriegel,et al.  The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.

[2]  Yunjun Gao,et al.  Efficient Algorithms for Historical Continuous k NN Query Processing over Moving Object Trajectories , 2007, APWeb/WAIM.

[3]  Nikos Pelekis,et al.  Nearest Neighbor Search on Moving Object Trajectories , 2005, SSTD.

[4]  Andre Osterloh,et al.  A Lower Bound for Oblivious Dimensional Routing , 2009, Euro-Par.

[5]  Ralf Hartmut Güting,et al.  Modeling and querying moving objects in networks , 2006, The VLDB Journal.

[6]  Informatik Berichte,et al.  Relational Approaches to Knowledge Representation and Learning , 2009 .

[7]  Jörg Keller,et al.  Das GCA-Modell im Vergleich zum PRAM-Modell , 2009 .

[8]  Ralf Hartmut Güting,et al.  Efficient k-nearest neighbor search on moving object trajectories , 2010, The VLDB Journal.

[9]  Ralf Hartmut Güting,et al.  BerlinMOD: a benchmark for moving object databases , 2009, The VLDB Journal.

[10]  Hermann Helbig,et al.  The readability checker delite: technical report , 2008 .

[11]  Ralf Hartmut Güting,et al.  Operator-Based Query Progress Estimation , 2008 .

[12]  Ralf Hartmut Güting,et al.  User defined topological predicates in database systems , 2010, GeoInformatica.

[13]  Nikos Pelekis,et al.  Algorithms for Nearest Neighbor Search on Moving Object Trajectories , 2007, GeoInformatica.

[14]  Ralf Hartmut Güting,et al.  Spatiotemporal pattern queries , 2011, GeoInformatica.

[15]  Pavel Zezula,et al.  M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.

[16]  Ralf Hartmut Güting,et al.  A data model and data structures for moving objects databases , 2000, SIGMOD '00.

[17]  Claus Udo Hönig Optimales Task-Graph-Scheduling für homogene und heterogene Zielsysteme , 2008 .

[18]  Dieter Pfoser,et al.  Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.

[19]  Markus Schneider,et al.  A foundation for representing and querying moving objects , 2000, TODS.