Document Open Access Logo

On the Complexity of the Realisability Problem for Visit Events in Trajectory Sample Databases

Authors Arthur Jansen , Bart Kuijpers

PDF

File

Thumbnail PDF
PDF
LIPIcs.TIME.2025.12.pdf
  • Filesize: 0.69 MB
  • 14 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Information systems → Spatial-temporal systems
  • Information systems → Query languages
Keywords
  • Trajectory sample databases
  • uncertain databases
  • query languages
  • complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Trajectory sample databases store finite sequences of measured space-time locations of moving objects, along with a speed bound for each object. These databases can be seen as uncertain databases. We propose a language that allows the formulation of queries about the uncertainty in trajectory sample databases. As part of that language, we introduce the notion of visit events, which are used to describe certain constraints on the movement of an object. In our language, an atomic query asks whether a moving object can, given its limitations, realise such an event. We give complexity results for this realisability problem, in various settings.

Cite As Get BibTex

Arthur Jansen and Bart Kuijpers. On the Complexity of the Realisability Problem for Visit Events in Trajectory Sample Databases. In 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 355, pp. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.TIME.2025.12

Author Details

Arthur Jansen
  • Hasselt University, Databases and Theoretical Computer Science Group and Data Science Institute (DSI), Agoralaan, Building D, 3590 Diepenbeek, Belgium
Bart Kuijpers
  • Hasselt University, Databases and Theoretical Computer Science Group and Data Science Institute (DSI), Agoralaan, Building D, 3590 Diepenbeek, Belgium

Funding

  • Jansen, Arthur: Bijzonder Onderzoeksfonds (BOF22OWB06) from UHasselt

References

  1. Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison-Wesley, 1995. URL: http://webdam.inria.fr/Alice/.
  2. S. Basu, R. Pollack, and M.-F. Roy. Algorithms in real algebraic geometry. Algorithms and Computation in Mathematics 10. Springer, Berlin, 2003. Google Scholar
  3. Jacek Bochnak, Michel Coste, and Marie-Françoise Roy. Real Algebraic Geometry, volume 36 of Ergebnisse der Mathematik und ihrer Grenzgebiete. Springer-Verlag, 1998. Google Scholar
  4. Vania Bogorny, Bart Kuijpers, and Luis Otávio Alvares. ST-DMQL: A semantic trajectory data mining query language. Int. J. Geogr. Inf. Sci., 23(10):1245-1276, 2009. URL: http://www.informaworld.com/smpp/content%7Edb=all%7Econtent=a915093101%7Efrm=abslink.
  5. L. Burns. Transportation, Temporal, and Spatial Components of Accessibility. Lexington Books, Lexington, MA, 1979. Google Scholar
  6. Max J. Egenhofer. Approximation of geospatial lifelines. In Elisa Bertino and Leila De Floriani, editors, SpadaGIS, Workshop on Spatial Data and Geographic Information Systems. University of Genova, 2003. Google Scholar
  7. Fosca Giannotti and Dino Pedreschi, editors. Mobility, Data Mining and Privacy - Geographic Knowledge Discovery. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-75177-9.
  8. R. Güting and M. Schneider. Moving Object Databases. Morgan Kaufmann, 2005. Google Scholar
  9. T. Hägerstrand. What about people in regional science? Papers of the Regional Science Association, 24:7-21, 1970. Google Scholar
  10. Kathleen Hornsby and Max J. Egenhofer. Modeling moving objects over multiple granularities. Ann. Math. Artif. Intell., 36(1-2):177-194, 2002. URL: https://doi.org/10.1023/A:1015812206586.
  11. Tomasz Imieliński and Witold Lipski. Incomplete information in relational databases. J. ACM, 31(4):761-791, September 1984. URL: https://doi.org/10.1145/1634.1886.
  12. Donald Janelle and Michael Goodchild. Diurnal patterns of social group distributions in a canadian city. Economic Geography, 59(4):403-425, 1983. URL: http://www.jstor.org/stable/144166.
  13. B. Lenntorp. Paths in Space-Time Environments: A Time-Geographic Study of the Movement Possibilities of Individuals. Number 44 in Series B. Lund Studies in Geography, 1976. Google Scholar
  14. H.J. Miller. Modeling accessibility using space-time prism concepts within geographical information systems. International Journal of Geographical Information Systems, 5:287-301, 1991. URL: https://doi.org/10.1080/02693799108927856.
  15. H.J. Miller. A measurement theory for time geography. Geographical Analysis, 2005. URL: https://doi.org/10.1111/j.1538-4632.2005.00575.x.
  16. Christos H. Papadimitriou. The Euclidean travelling salesman problem is NP-complete. Theoretical Computer Science, 4(3):237-244, 1977. URL: https://doi.org/10.1016/0304-3975(77)90012-3.
  17. Christine Parent, Stefano Spaccapietra, Chiara Renso, Gennady L. Andrienko, Natalia V. Andrienko, Vania Bogorny, Maria Luisa Damiani, Aris Gkoulalas-Divanis, José Antônio Fernandes de Macêdo, Nikos Pelekis, Yannis Theodoridis, and Zhixian Yan. Semantic trajectories modeling and analysis. ACM Comput. Surv., 45(4):42:1-42:32, 2013. URL: https://doi.org/10.1145/2501654.2501656.
  18. Dieter Pfoser and Christian S. Jensen. Capturing the uncertainty of moving-object representations. In Ralf Hartmut Güting, Dimitris Papadias, and Frederick H. Lochovsky, editors, Advances in Spatial Databases, 6th International Symposium, SSD'99, Proceedings, volume 1651 of Lecture Notes in Computer Science, pages 111-132. Springer, 1999. URL: https://doi.org/10.1007/3-540-48482-5_9.
  19. Alfred Tarski and J. C. C. McKinsey. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951. Google Scholar
  20. G. Trajcevski, O. Wolfson, K. Hinrichs, and S. Chamberlain. Managing uncertainty in moving objects databases. ACM Trans. Database Syst., 29(3):463-507, 2004. URL: https://doi.org/10.1145/1016028.1016030.
  21. Zhixian Yan, Dipanjan Chakraborty, Christine Parent, Stefano Spaccapietra, and Karl Aberer. Semantic trajectories: Mobility data computation and annotation. ACM Trans. Intell. Syst. Technol., 4(3):49:1-49:38, 2013. URL: https://doi.org/10.1145/2483669.2483682.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact