Skip to main content

An Algebra for Path Manipulation in Graph Databases

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 2022)

Abstract

A key characteristic of current graph query languages is their support for path queries. Although a path query looks for paths in a graph database, current graph query languages are restricted to return just the source and target nodes connected by each solution path. Therefore, the user is not able to manipulate the elements (nodes and edges) of the resulting paths. In order to overcome such restriction, this paper presents an algebra for path manipulation. Inspired by the relational algebra, we defined the operators of selection, projection, node-based join, edge-based join, node-based cartesian product, edge-based cartesian product, union, intersection and difference. These operators are closed under sets of paths, i.e. the input and the output are sets of paths. We study the algebraic properties of the operators and describe use cases that justify the usefulness of the algebra.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cypher Query Language. https://neo4j.com/developer/cypher-query-language/

  2. GSQL Documentation. https://docs.tigergraph.com/gsql-ref/current/intro/intro

  3. OrientDB Community Edition. https://orientdb.org/

  4. TinkerPop Documentation. https://tinkerpop.apache.org/docs/current

  5. TypeQL Queries: Vaticle. https://docs.vaticle.com/docs/query/overview

  6. Angles, R., et al.: G-CORE: a core for future graph query languages. In: Proceedings of the 2018 International Conference on Management of Data, pp. 1421–1432. ACM (2018). https://doi.org/10.1145/3183713.3190654

  7. Angles, R., Arenas, M., Barceló, P., Hogan, A., Reutter, J., Vrgoč, D.: Foundations of modern query languages for graph databases. ACM Comput. Surv. 50(5), 1–40 (2017). https://doi.org/10.1145/3104031

    Article  Google Scholar 

  8. Cassandri, M., et al.: Zinc-finger proteins in health and disease. Cell Death Discov. 3(1), 17071 (2017). https://doi.org/10.1038/cddiscovery.2017.71

    Article  Google Scholar 

  9. Foulds, L.R.: Graph Theory Applications. Springer, New York (1992). https://doi.org/10.1007/978-1-4612-0933-1

    Book  MATH  Google Scholar 

  10. Frasincar, F., Houben, G.J., Pau, C.: XAL: an algebra for XML query optimization. Aust. Comput. Sci. Commun. 24(2), 49–56 (2002)

    Google Scholar 

  11. Frasincar, F., Houben, G.J., Vdovjak, R., Barna, P.: RAL: an algebra for querying RDF. WWW 7(1), 83–109 (2004). https://doi.org/10.1023/B:WWWJ.0000015866.43076.06

    Article  Google Scholar 

  12. Gondran, M.: Path algebra and algorithms. In: Roy, B. (ed.) Combinatorial Programming: Methods and Applications. ASIC, vol. 19, pp. 137–148. Springer, Dordrecht (1975). https://doi.org/10.1007/978-94-011-7557-9_6

    Chapter  Google Scholar 

  13. Harris, S., Seaborne, A.: SPARQL 1.1 Query Language (W3C Recommendation), 21 March 2013. https://www.w3.org/TR/sparql11-query/

  14. Hegeman, T., Iosup, A.: Survey of graph analysis applications (2018). https://doi.org/10.48550/ARXIV.1807.00382

  15. Konc, J., Janežič, D.: Binding site comparison for function prediction and pharmaceutical discovery, April 2014. https://doi.org/10.1016/j.sbi.2013.11.012

  16. Manger, R.: A new path algebra for finding paths in graphs. In: 26th International Conference on Information Technology Interfaces, vol. 1, pp. 657–662 (2004)

    Google Scholar 

  17. Mavromoustakos, T., et al.: Strategies in the rational drug design. Curr. Med. Chem. 18(17), 2517–2530 (2011). https://doi.org/10.2174/092986711795933731

    Article  Google Scholar 

  18. Naudziunas, V., Griffin, T.G.: A domain-specific language for the specification of path algebras. In: Proceedings of the First Workshop on ATE, Wrocław, Poland, 31 July 2011, vol. 760, pp. 46–57. CEUR-WS (2011). https://ceur-ws.org/Vol-760/paper7.pdf

  19. van Rest, O., Hong, S., Kim, J., Meng, X., Chafi, H.: PGQL: a property graph query language. In: GRADES 2016. ACM, New York (2016). https://doi.org/10.1145/2960414.2960421

  20. Rodriguez, M.A., Neubauer, P.: A path algebra for multi-relational graphs. In: IEEE 27th International Conference on Data Engineering Workshops, pp. 128–131 (2011). https://doi.org/10.1109/ICDEW.2011.5767613

  21. Stuckenschmidt, H., Vdovjak, R., Broekstra, J., Houben, G.J.: Towards distributed processing of RDF path queries. Int. J. Web Eng. Technol. 2(2/3), 207–230 (2005). https://doi.org/10.1504/IJWET.2005.008484

    Article  Google Scholar 

Download references

Acknowledgements

R. García was supported by CONICYT PFCHA/BECA DE DOCTORADO NACIONAL/2019 under Grant 21192157. R. Angles was supported by ANID FONDECYT Chile through grant 1221727.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Roberto García .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

García, R., Angles, R. (2022). An Algebra for Path Manipulation in Graph Databases. In: Chiusano, S., Cerquitelli, T., Wrembel, R. (eds) Advances in Databases and Information Systems. ADBIS 2022. Lecture Notes in Computer Science, vol 13389. Springer, Cham. https://doi.org/10.1007/978-3-031-15740-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-15740-0_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-15739-4

  • Online ISBN: 978-3-031-15740-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics