Parsing Graphs: Applying Parser Combinators to Graph Traversals
Loading...
Authors
Schweizer, Raphael
Author (Corporation)
Publication date
12/2013
Typ of student thesis
Course of study
Collections
Type
01B - Magazine or newspaper article
Editors
Editor (Corporation)
Supervisor
Parent work
IMVS Fokus Report
Special issue
DOI of the original publication
Series
Series number
Volume
7
Issue / Number
Pages / Duration
31-34
Patent number
Publisher / Publishing institution
Place of publication / Event location
Edition
Version
Programming language
Assignee
Practice partner / Client
Abstract
Connected data such as social networks or business process interactions are frequently modeled as graphs, and increasingly often, stored in graph databases. In contrast to relational databases where SQL is the proven query language, there is no established counterpart for graph databases. One way to explore and extract data from a graph database is to specify the structure of paths (partial traversals) through the graph. We show how such traversals can be expressed by combining graph navigation primitives with familiar grammar constructions such as sequencing, choice and repetition – essentially applying the idea of parser combinators to graph traversals. The result is trails, a Scala combinator library that provides an implementation for the neo4j graph database and for the generic graph API blueprints.
Keywords
graph database, graph parsing, parser combinators, graph traversal
Subject (DDC)
Event
Exhibition start date
Exhibition end date
Conference start date
Conference end date
Date of the last check
ISBN
ISSN
2296-4169
1662-2014
1662-2014
Language
English
Created during FHNW affiliation
Yes
Strategic action fields FHNW
Publication status
Published
Review
Expert editing/editorial review
Open access category
License
Citation
Kröni, D., & Schweizer, R. (2013, December). Parsing Graphs: Applying Parser Combinators to Graph Traversals. IMVS Fokus Report, 7, 31–34. https://doi.org/10.26041/fhnw-629