Graph query processing

Semih Salihoglu, N. Yakovets

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

1 Downloads (Pure)

Abstract

While being eminently useful in a wide variety of application domains, the high expressiveness of graph queries makes them hard to optimize and, hence, challenging to process efficiently. We discuss a number of state-of-the-art approaches which aim to overcome these challenges, focusing specifically on planning, optimization, and execution of two commonly used types of declarative graph queries: subgraph queries and regular path queries.
Original languageEnglish
Title of host publicationEncyclopedia of Big Data Technologies
EditorsSherif Sakr, Albert Y. Zomaya
Place of PublicationBerlin
PublisherSpringer
Pages890-898
Number of pages9
ISBN (Electronic)978-3-319-77525-8
ISBN (Print)978-3-319-77524-1
DOIs
Publication statusPublished - 20 Feb 2019

Fingerprint Dive into the research topics of 'Graph query processing'. Together they form a unique fingerprint.

  • Cite this

    Salihoglu, S., & Yakovets, N. (2019). Graph query processing. In S. Sakr, & A. Y. Zomaya (Eds.), Encyclopedia of Big Data Technologies (pp. 890-898). Springer. https://doi.org/10.1007/978-3-319-77525-8_215