Symbolic trajectories in Secondo: Pattern matching and rewriting

16Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we introduce a novel data model for representing symbolic trajectories along with a pattern language enabling both the matching and the rewriting of trajectories. We illustrate in particular the trajectory data type and two operations for querying symbolic trajectories inside the database system Secondo. As an important application of our theory, the classification and depiction of a set of real trajectories according to several criteria is demonstrated. © Springer-Verlag 2013.

Cite

CITATION STYLE

APA

Valdés, F., Damiani, M. L., & Güting, R. H. (2013). Symbolic trajectories in Secondo: Pattern matching and rewriting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7826 LNCS, pp. 450–453). https://doi.org/10.1007/978-3-642-37450-0_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free