Partially ordered regular languages for graph queries

DOI10.1016/j.jcss.2003.04.003zbMath1076.68039OpenAlexW1990156691MaRDI QIDQ1765217

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

GraphsDatabasesRegular languagesPath queries

Mathematics Subject Classification ID

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

Related Items (3)

Graph Grammars for Querying Graph-like Data ⋮ Partially ordered regular languages for graph queries ⋮ Weighted path queries on semistructured databases

Uses Software

• GraphLog
• Lorel

Cites Work

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

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