Modular Path Queries with Arithmetic

Jakub Michaliszyn, Jan Otop, Piotr Wieczorek

We propose a new approach to querying graph databases. Our approach balances competing goals of expressive power, language clarity and computational complexity. A distinctive featu…