Journal Article10.1007/S00778-009-0142-5
BerlinMOD: a benchmark for moving object databases
Christian Düntgen,Thomas Behr,Ralf Hartmut Güting +2 more
- 01 Dec 2009
- Vol. 18, Iss: 6, pp 1335-1368
168
TL;DR: This document presents a method to design scalable and representative moving object data (MOD) and two sets of queries for benchmarking spatio-temporal DBMS and demonstrates the data generator’s extensibility by showing how to achieve more natural movement generation patterns, and how to disturb the vehicles’ positions to create noisy data.
read more
Abstract: This document presents a method to design scalable and representative moving object data (MOD) and two sets of queries for benchmarking spatio-temporal DBMS. Instead of programming a dedicated generator software, we use the existing Secondo DBMS to create benchmark data. The benchmark is based on a simulation scenario, where the positions of a sample of vehicles are observed for an arbitrary period of time within the street network of Berlin. We demonstrate the data generator's extensibility by showing how to achieve more natural movement generation patterns, and how to disturb the vehicles' positions to create noisy data. As an application and for reference, we also present first benchmarking results for the Secondo DBMS. Whereas the benchmark focuses on range queries, we demonstrate its ability to incorporate new future classes of queries by presenting a preliminary extension handling various nearest neighbour queries. Such a benchmark is useful in several ways: It provides well-defined data sets and queries for experimental evaluations; it simplifies experimental repeatability; it emphasizes the development of complete systems; it points out weaknesses in existing systems motivating further research. Moreover, the BerlinMOD benchmark allows one to compare different representations of the same moving objects.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Trajectory Data Mining: An Overview
TL;DR: A systematic survey on the major research into trajectory data mining, providing a panorama of the field as well as the scope of its research topics, and introduces the methods that transform trajectories into other data formats, such as graphs, matrices, and tensors.
Nearest neighbor selection for iteratively kNN imputation
TL;DR: The gray distance is much better than the Minkowski distance at both capturing the proximity relationship (or nearness) of two instances and dealing with mixed attributes, and experimental results show that the GkNN algorithm is much more efficient than existent kNN imputation methods.
432
The Long Road to Computational Location Privacy: A Survey
TL;DR: The protection mechanisms between online and offline use cases are divided into six categories depending on the nature of their algorithm, and the evaluation metrics used to assess protection mechanisms in terms of privacy, utility and performance are surveyed.
154
•Journal Article
SECONDO: a platform for moving objects database research and for publishing and integrating research implementations
TL;DR: An infrastructure for research in moving objects databases that 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.
UlTraMan: a unified platform for big trajectory data management and analytics
Xin Ding,Lu Chen,Yunjun Gao,Christian S. Jensen,Bao Hujun +4 more
- 01 Mar 2018
TL;DR: This work extends Apache Spark with respect to both data storage and computing by seamlessly integrating a key-value store, and enhances the MapReduce paradigm to allow flexible optimizations based on random data access to achieve scalability, efficiency, persistence, and flexibility.
References
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Fast subsequence matching in time-series databases
Christos Faloutsos,M. Ranganathan,Yannis Manolopoulos +2 more
- 24 May 1994
TL;DR: An efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance.
Nearest neighbor queries
Nick Roussopoulos,Stephen Kelley,Frédéric Vincent +2 more
- 22 May 1995
TL;DR: This paper presents an efficient branch-and-bound R-tree traversal algorithm to find the nearest neighbor object to a point, and then generalizes it to finding the k nearest neighbors.
1.6K
A Framework for Generating Network-Based Moving Objects
TL;DR: In this paper, the most important properties of network-based moving objects are presented and discussed and a framework is proposed where the user can control the behavior of the generator by re-defining the functionality of selected object classes.
988