Given a query object q , a dataset D , a distance threshold ?, and a similarity function that returns how similar two objects are, a similarity query returns a subset of objects from D that has at least ? similar to the query object q .
Published in Chapter:
Complex Motion Pattern Queries in Spatio-Temporal Databases
Marcos R. Vieira (IBM Research, Brazil)
Copyright: © 2016
|Pages: 25
DOI: 10.4018/978-1-4666-8767-7.ch009
Abstract
With the recent advancements and wide usage of location detection devices, very large quantities of data are collected by GPS and cellular technologies in the form of trajectories. The wide and increasing availability of such collected data has led to research advances in behavioral aspects of the monitored subjects (e.g., wild animals, people, and vehicles). Using trajectory data harvested by mobile devices, trajectories can be explored using motion pattern queries based on specific events of interest. While most research works on trajectory-based queries has focused on traditional range, nearest-neighbor, and similarity and join queries, there has been an increasing need to query trajectories using complex, yet more intuitive, motion patterns. In this chapter, we describe in detail complex motion pattern queries, which allow users to focus on trajectories that follow a specific sequence of spatio-temporal events. We demonstrate how these motion pattern queries can greatly help users to get insights from very large trajectory datasets.