Fast trajectory range query with discrete Fréchet distance

Jiahao Zhang, Bo Tang, Man Lung Yiu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

6 Citations (Scopus)

Abstract

The discrete Fréchet distance (DFD) is widely used to measure the similarity between two trajectories. Trajectory range query has been extensively studied in trajectory analytical applications, e.g., outlier detection, movement pattern analysis. With the discrete Fréchet distance, the above applications are computation bound rather than disk I/O bound. In this work, we propose new lower and upper bound functions to speedup the evaluation of trajectory range queries. Experimental studies on three real datasets demonstrate the superiority of our proposal.

Original languageEnglish
Title of host publicationAdvances in Database Technology - EDBT 2019
Subtitle of host publication22nd International Conference on Extending Database Technology, Proceedings
EditorsBerthold Reinwald, Irini Fundulaki, Melanie Herschel, Zoi Kaoudi, Carsten Binnig, Helena Galhardas
PublisherOpenProceedings.org
Pages634-637
Number of pages4
ISBN (Electronic)9783893180813
DOIs
Publication statusPublished - 1 Jan 2019
Event22nd International Conference on Extending Database Technology, EDBT 2019 - Lisbon, Portugal
Duration: 26 Mar 201929 Mar 2019

Publication series

NameAdvances in Database Technology - EDBT
Volume2019-March
ISSN (Electronic)2367-2005

Conference

Conference22nd International Conference on Extending Database Technology, EDBT 2019
Country/TerritoryPortugal
CityLisbon
Period26/03/1929/03/19

ASJC Scopus subject areas

  • Information Systems
  • Software
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Fast trajectory range query with discrete Fréchet distance'. Together they form a unique fingerprint.

Cite this