Formal languages in information extraction and graph databases

DOI10.1007/978-3-030-51466-2_28OpenAlexW3037251258MaRDI QIDQ2106616

Wim Martens

Publication date: 16 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_28

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• SPARQL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A trichotomy for regular simple path queries on graphs
• Document Spanners
• The complexity of regular expressions and property paths in SPARQL
• Querying Graphs with Data
• Finding Regular Simple Paths in Graph Databases
• Recursive Programs for Document Spanners
• Document Spanners: From Expressive Power to Decision Problems.
• Regular Queries on Graph Databases.

This page was built for publication: Formal languages in information extraction and graph databases