DeepAI AI Chat
Log In Sign Up

Modular Path Queries with Arithmetic

by   Jakub Michaliszyn, et al.

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.


Querying Best Paths in Graph Databases

Querying graph databases has recently received much attention. We propos...

Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks

Computing shortest paths is a fundamental operation in processing graph ...

A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks

Answering exact shortest path distance queries is a fundamental task in ...

Conjunctive Regular Path Queries with String Variables

We introduce the class CXRPQ of conjunctive xregex path queries, which a...

Enumeration Problems for Regular Path Queries

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

On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra

We study the expressive power of the LARA language – a recently proposed...