Cover Image

Complexity of Evaluating GQL Queries

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Figueira, Diego, Lin, Anthony W., Peterfreund, Liat
Format:	Preprint
Published:	2024
Subjects:	Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Database Theory in Action: From Inexpressibility to Efficiency in GQL's Order-Constrained Paths
by: Rotschield, Hadar, et al.
Published: (2025)

GQL and SQL/PGQ: Theoretical Models and Expressive Power
by: Gheerbrant, Amélie, et al.
Published: (2024)

On the Expressiveness of Languages for Querying Property Graphs in Relational Databases
by: Rotschield, Hadar, et al.
Published: (2025)

Handling SQL Nulls with Two-Valued Logic
by: Libkin, Leonid, et al.
Published: (2020)

Towards Cross-Model Efficiency in SQL/PGQ
by: Rotschield, Hadar, et al.
Published: (2025)

ProGQL: A Provenance Graph Query System for Cyber Attack Investigation
by: Shao, Fei, et al.
Published: (2025)

A Common Ancestor of PDL, Conjunctive Queries, and Unary Negation First-order
by: Figueira, Diego, et al.
Published: (2025)

Project-connex Decompositions and Tractability of Aggregate Group-by Conjunctive Queries
by: Figueira, Diego, et al.
Published: (2025)

Minimizing Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2025)

Responsibility Measures for Conjunctive Queries with Negation
by: Bienvenu, Meghyn, et al.
Published: (2026)

$R^3$-NL2GQL: A Model Coordination and Knowledge Graph Alignment Approach for NL2GQL
by: Zhou, Yuhang, et al.
Published: (2023)

Shapley Value Computation in Ontology-Mediated Query Answering
by: Bienvenu, Meghyn, et al.
Published: (2024)

Shapley Revisited: Tractable Responsibility Measures for Query Answers
by: Bienvenu, Meghyn, et al.
Published: (2025)

How Hard is it to Decide if a Fact is Relevant to a Query?
by: Bienvenu, Meghyn, et al.
Published: (2026)

Boundedness for Unions of Conjunctive Regular Path Queries over Simple Regular Expressions
by: Figueira, Diego, et al.
Published: (2024)

NAT-NL2GQL: A Novel Multi-Agent Framework for Translating Natural Language to Graph Query Language
by: Liang, Yuanyuan, et al.
Published: (2024)

GPC: A Pattern Calculus for Property Graphs
by: Francis, Nadime, et al.
Published: (2022)

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2022)

A Simple Algorithm for Consistent Query Answering under Primary Keys
by: Figueira, Diego, et al.
Published: (2023)

Answering Constraint Path Queries over Graphs
by: Li, Heyang, et al.
Published: (2025)

Guarded Negation Transitive Closure Logic
by: Figueira, Diego, et al.
Published: (2025)

Revisiting the Expressiveness Landscape of Data Graph Queries
by: Benedikt, Michael, et al.
Published: (2024)

Aligning Large Language Models to a Domain-specific Graph Database for NL2GQL
by: Liang, Yuanyuan, et al.
Published: (2024)

When is Shapley Value Computation a Matter of Counting?
by: Bienvenu, Meghyn, et al.
Published: (2023)

Data Generation for Testing Complex Queries
by: Somwase, Sunanda, et al.
Published: (2024)

DocETL: Agentic Query Rewriting and Evaluation for Complex Document Processing
by: Shankar, Shreya, et al.
Published: (2024)

A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join
by: Padmanabha, Anantha, et al.
Published: (2023)

The Space-Time Complexity of Sum-Product Queries
by: Deeds, Kyle, et al.
Published: (2025)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
by: Arroyuelo, Diego, et al.
Published: (2023)

Output-sensitive Conjunctive Query Evaluation
by: Deep, Shaleen, et al.
Published: (2024)

Efficient Path Query Processing in Relational Database Systems
by: Correa, Diego Rivera, et al.
Published: (2026)

Resilience for Regular Path Queries: Towards a Complexity Classification
by: Amarilli, Antoine, et al.
Published: (2024)

A Graph-native Optimization Framework for Complex Graph Queries
by: Lyu, Bingqing, et al.
Published: (2025)

Secure Query Processing with Linear Complexity
by: Luo, Qiyao, et al.
Published: (2024)

Output-Sensitive Evaluation of Regular Path Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2024)

JOB-Complex: A Challenging Benchmark for Traditional & Learned Query Optimization
by: Wehrstein, Johannes, et al.
Published: (2025)

Compact Answers to Temporal Path Queries
by: Adnan, Muhammad, et al.
Published: (2025)

Rel: A Programming Language for Relational Data
by: Aref, Molham, et al.
Published: (2025)

Relational to RDF Data Migration by Query Co-Evaluation
by: Wisnesky, Ryan, et al.
Published: (2024)

Zero-Knowledge Verifiable Graph Query Evaluation via Expansion-Centric Operator Decomposition
by: Wu, Hao, et al.
Published: (2025)