| Autor: |
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek |
| Jazyk: |
angličtina |
| Rok vydání: |
2021 |
| Předmět: |
|
| Zdroj: |
Logical Methods in Computer Science, Vol Volume 17, Issue 3 (2021) |
| Druh dokumentu: |
article |
| ISSN: |
1860-5974 |
| DOI: |
10.46298/lmcs-17(3:27)2021 |
| Popis: |
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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
