Corpus ID: 211076148

Modular Path Queries with Arithmetic

@article{Michaliszyn2020ModularPQ,
  title={Modular Path Queries with Arithmetic},
  author={Jakub Michaliszyn and Jan Otop and Piotr Wieczorek},
  journal={ArXiv},
  year={2020},
  volume={abs/2002.04460}
}
  • Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
  • Published in ArXiv 2020
  • Mathematics, Computer Science
  • 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… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 43 REFERENCES