Indexing for graph query evaluation

George H.L. Fletcher, Martin Theobald, Hannes Voigt (Editor)

Research output: Chapter in Book/Report/Conference proceedingEntry for encyclopedia/dictionaryAcademicpeer-review

Abstract

Given a graph, an index is a data structure supporting a map from a collection of keys to a collection of elements in the graph. For example, we may have an index on node labels, which, given a node label as search key, facilitates accelerated access to all nodes of the graph having the given label. The evaluation of queries on graph databases is often facilitated by index data structures. An index can be the primary representation of the graph or can be a secondary access path to elements of the graph.
Original languageEnglish
Title of host publicationEncyclopedia of Big Data Technologies
EditorsS. Sakr, A. Zomaya
Place of PublicationCham
PublisherSpringer
Number of pages9
ISBN (Electronic)978-3-319-63962-8
DOIs
Publication statusPublished - 2018

Fingerprint Dive into the research topics of 'Indexing for graph query evaluation'. Together they form a unique fingerprint.

  • Cite this

    Fletcher, G. H. L., Theobald, M., & Voigt, H. (Ed.) (2018). Indexing for graph query evaluation. In S. Sakr, & A. Zomaya (Eds.), Encyclopedia of Big Data Technologies Springer. https://doi.org/10.1007/978-3-319-63962-8_212-1