arXiv (All)
open access
Efficient Path Query Processing in Relational Database Systems
Path queries are crucial for property graphs, and there is growing interest in queries that combine regular expressions over labels with constraints on property values of vertices and edges. Efficient evaluation of such general path queries requires that intermediate results be eliminated early when
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Rewriting Ontology-Mediated Property Graph Queries into GQL#471324
- Flexible and Expressive Typed Path Patterns for GQL#336032
- A Compositional Language for Property Graphs#300031
- Rewriting Ontology-Mediated Property Graph Queries into GQL#1084325
- Erotetic Logic as a Specification Language for Database Queries#742551
Record · ID 1412790
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive