July 9, 2024Open Access

Relational Perspective on Graph Query Languages

View Full Paper

Ask AI

Bookmark

Standard graph query languages are largely expressible via relational calculus with transitive closure operators and existential second-order quantifiers.
Theoretical model applying the restricted quantifier collapse framework establishes optimal data complexity bounds for database queries with arithmetics.
Framework supports unified graph database querying while regular data path querying using register automata preserves nondeterministic logspace complexity.

Discussion

No takes yet. Share an insight, caveat, or question.

Implication

Theoretical analysis demonstrates optimal data complexity bounds for standard graph query languages, indicating a unified relational foundation for querying property graphs.

Cite This Study

Figueira et al. (2024) studied this question.

synapsesocial.com/papers/68e60f66b6db6435875a254a https://doi.org/10.48550/arxiv.2407.06766

View Full Paper

Ask AI

Bookmark

Implication

Theoretical analysis demonstrates optimal data complexity bounds for standard graph query languages, indicating a unified relational foundation for querying property graphs.

Relational Perspective on Graph Query Languages

Key Points

Discussion

Implication

Cite This Study

Relational Perspective on Graph Query Languages

Key Points

Discussion

Implication

Cite This Study

Also Consider

Also Consider