Modular Path Queries with Arithmetic release_2cl6kz7wh5arpa3owbaexp7tge

by Jakub Michaliszyn and Jan Otop and Piotr Wieczorek

Released as a article .

2020  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  444.0 kB
file_kw26issuwjffvbn4rq7nvx4cc4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-10-16
Version   v2
Language   en ?
arXiv  2002.04460v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: f53584b0-21d9-4ec3-b587-5aef48f29b34
API URL: JSON