An analytic solution to the alibi query in the bead model for moving object data

Authors Bart Kuijpers, Walied Othman



PDF
Thumbnail PDF

File

DagSemProc.07212.4.pdf
  • Filesize: 366 kB
  • 22 pages

Document Identifiers

Author Details

Bart Kuijpers
Walied Othman

Cite As Get BibTex

Bart Kuijpers and Walied Othman. An analytic solution to the alibi query in the bead model for moving object data. In Constraint Databases, Geometric Elimination and Geographic Information Systems. Dagstuhl Seminar Proceedings, Volume 7212, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007) https://doi.org/10.4230/DagSemProc.07212.4

Abstract

Moving objects produce trajectories, which are stored in databases by means of finite samples of time-stamped locations. When
also speed limitations in these sample points are known,
beads can be used to model the
uncertainty about the object's location in between sample points.

In this setting, a query of particular interest, that has been
studied in the literature of geographic information systems (GIS),
is the alibi query. This boolean query asks whether two
moving objects can have physically met. This adds up to deciding
whether the necklaces of beads of these objects intersect. This
problem can be reduced to deciding whether two beads intersect.
Since, existing software to solve this problem fails to answer this
question within a reasonable time, we propose an analytical solution
to the alibi query, which can be used to answer the alibi query in
constant time, a matter of milliseconds or less, for two single
beads and in time proportional to the product of their lengths for
necklaces of beads.

Subject Classification

Keywords
  • Beads
  • uncertainty
  • alibi
  • query
  • solution
  • quantifier elimination
  • constraint database

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail