Partially ordered regular languages for graph queries

DOI10.1016/J.JCSS.2003.04.003MaRDI QIDQ1765217zbMATH OpenOpenAlexFDO

Authors Sergio Flesca, Sergio Greco

Publication date 23 February 2005

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2003.04.003

zbMATH Keywords

DatabasesGraphsPath queriesRegular languages

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Regular expressions with binding over data words for querying graph databases
• Finding Regular Simple Paths in Graph Databases
• Regular expressions for querying data graphs
• Graph grammars for querying graph-like data
• Regular queries on graph databases

Cites work

• A logical query language for hypermedia systems
• Fast Algorithms for Solving Path Problems
• Finding Regular Simple Paths in Graph Databases
• Logical foundations of object-oriented and frame-based languages
• Partially ordered regular languages for graph queries
• Path constraints in semistructured databases
• Regular path queries with constraints

Cited in

(4)

• Partially ordered regular languages for graph queries
• Weighted path queries on semistructured databases
• Regular rooted graph grammars. A web type and schema language.
• Graph grammars for querying graph-like data

Describes a project that uses

Uses Software

• Lorel
• GraphLog

This page was built for publication: Partially ordered regular languages for graph queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765217)