Logical Methods in Computer Science (Sep 2021)

Modular Path Queries with Arithmetic

  • Jakub Michaliszyn,
  • Jan Otop,
  • Piotr Wieczorek

DOI
https://doi.org/10.46298/lmcs-17(3:27)2021
Journal volume & issue
Vol. Volume 17, Issue 3

Abstract

Read online

We propose a new approach to querying graph databases. Our approach balances competing goals of expressive power, language clarity and computational complexity. A distinctive feature of our approach is the ability to express properties of minimal (e.g. shortest) and maximal (e.g. most valuable) paths satisfying given criteria. To express complex properties in a modular way, we introduce labelling-generating ontologies. The resulting formalism is computationally attractive - queries can be answered in non-deterministic logarithmic space in the size of the database.

Keywords