DeepAI AI Chat
Log In Sign Up

Querying Best Paths in Graph Databases

by   Jakub Michaliszyn, et al.
Akademia Sztuk Pięknych we Wrocławiu

Querying graph databases has recently received much attention. We propose a new approach to this problem, which 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.


page 1

page 2

page 3

page 4


Modular Path Queries with Arithmetic

We propose a new approach to querying graph databases. Our approach bala...

Enumeration Problems for Regular Path Queries

Evaluation of regular path queries (RPQs) is a central problem in graph ...

Non-Crossing Shortest Paths are Covered with Exactly Four Forests

Given a set of paths P we define the Path Covering with Forest Number of...

First-Order Logic with Connectivity Operators

First-order logic (FO) can express many algorithmic problems on graphs, ...

Algorithmic upper bounds for graph geodetic number

Graph theoretical problems based on shortest paths are at the core of re...

The theory of concatenation over finite models

We propose FC, a logic on words that combines the previous approaches of...