Output-Sensitive Evaluation of Regular Path Queries
Fuente:
arXiv
Saved in:
| Main Authors: | Khamis, Mahmoud Abo, Kara, Ahmet, Olteanu, Dan, Suciu, Dan |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Output-Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2025)
by: Khamis, Mahmoud Abo, et al.
Published: (2025)
Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2025)
by: Khamis, Mahmoud Abo, et al.
Published: (2025)
Insert-Only versus Insert-Delete in Dynamic Query Evaluation
by: Khamis, Mahmoud Abo, et al.
Published: (2023)
by: Khamis, Mahmoud Abo, et al.
Published: (2023)
Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations
by: Abo-Khamis, Mahmoud, et al.
Published: (2026)
by: Abo-Khamis, Mahmoud, et al.
Published: (2026)
Pessimistic Cardinality Estimation
by: Khamis, Mahmoud Abo, et al.
Published: (2024)
by: Khamis, Mahmoud Abo, et al.
Published: (2024)
Join Size Bounds using Lp-Norms on Degree Sequences
by: Khamis, Mahmoud Abo, et al.
Published: (2023)
by: Khamis, Mahmoud Abo, et al.
Published: (2023)
PANDA: Query Evaluation in Submodular Width
by: Khamis, Mahmoud Abo, et al.
Published: (2024)
by: Khamis, Mahmoud Abo, et al.
Published: (2024)
Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation
by: Khamis, Mahmoud Abo, et al.
Published: (2025)
by: Khamis, Mahmoud Abo, et al.
Published: (2025)
Query Optimization and Evaluation via Information Theory: A Tutorial
by: Khamis, Mahmoud Abo, et al.
Published: (2026)
by: Khamis, Mahmoud Abo, et al.
Published: (2026)
LpBound: Pessimistic Cardinality Estimation using $\ell_p$-Norms of Degree Sequences
by: Zhang, Haozhe, et al.
Published: (2025)
by: Zhang, Haozhe, et al.
Published: (2025)
Fast Matrix Multiplication meets the Submodular Width
by: Abo-Khamis, Mahmoud, et al.
Published: (2024)
by: Abo-Khamis, Mahmoud, et al.
Published: (2024)
PANDAExpress: a Simpler and Faster PANDA Algorithm
by: Khamis, Mahmoud Abo, et al.
Published: (2025)
by: Khamis, Mahmoud Abo, et al.
Published: (2025)
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
by: Kara, Ahmet, et al.
Published: (2019)
by: Kara, Ahmet, et al.
Published: (2019)
Conjunctive Queries with Free Access Patterns under Updates
by: Kara, Ahmet, et al.
Published: (2022)
by: Kara, Ahmet, et al.
Published: (2022)
Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms
by: Abramovich, Omer, et al.
Published: (2025)
by: Abramovich, Omer, et al.
Published: (2025)
Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time
by: Khamis, Mahmoud Abo, et al.
Published: (2026)
by: Khamis, Mahmoud Abo, et al.
Published: (2026)
Convergence of Datalog over (Pre-) Semirings
by: Khamis, Mahmoud Abo, et al.
Published: (2021)
by: Khamis, Mahmoud Abo, et al.
Published: (2021)
Tractable Conjunctive Queries over Static and Dynamic Relations
by: Kara, Ahmet, et al.
Published: (2024)
by: Kara, Ahmet, et al.
Published: (2024)
F-IVM: Analytics over Relational Databases under Updates
by: Kara, Ahmet, et al.
Published: (2023)
by: Kara, Ahmet, et al.
Published: (2023)
A Unifying Algorithm for Hierarchical Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2025)
by: Khamis, Mahmoud Abo, et al.
Published: (2025)
CHORUS: Foundation Models for Unified Data Discovery and Exploration
by: Kayali, Moe, et al.
Published: (2023)
by: Kayali, Moe, et al.
Published: (2023)
Recent Increments in Incremental View Maintenance
by: Olteanu, Dan
Published: (2024)
by: Olteanu, Dan
Published: (2024)
Applications of Information Inequalities to Database Theory Problems
by: Suciu, Dan
Published: (2023)
by: Suciu, Dan
Published: (2023)
The Space-Time Complexity of Sum-Product Queries
by: Deeds, Kyle, et al.
Published: (2025)
by: Deeds, Kyle, et al.
Published: (2025)
HoneyComb: A Parallel Worst-Case Optimal Join on Multicores
by: Wu, Jiacheng, et al.
Published: (2025)
by: Wu, Jiacheng, et al.
Published: (2025)
Galley: Modern Query Optimization for Sparse Tensor Programs
by: Deeds, Kyle, et al.
Published: (2024)
by: Deeds, Kyle, et al.
Published: (2024)
QirK: Question Answering via Intermediate Representation on Knowledge Graphs
by: Scheerer, Jan Luca, et al.
Published: (2024)
by: Scheerer, Jan Luca, et al.
Published: (2024)
Thucy: An LLM-based Multi-Agent System for Claim Verification across Relational Databases
by: Theologitis, Michael, et al.
Published: (2025)
by: Theologitis, Michael, et al.
Published: (2025)
Using Process Calculus for Optimizing Data and Computation Sharing in Complex Stateful Parallel Computations
by: Tian, Zilu, et al.
Published: (2025)
by: Tian, Zilu, et al.
Published: (2025)
Minimizing Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2025)
by: Figueira, Diego, et al.
Published: (2025)
Evaluating Regular Path Queries on Compressed Adjacency Matrices
by: Arroyuelo, Diego, et al.
Published: (2023)
by: Arroyuelo, Diego, et al.
Published: (2023)
Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation
by: Deeds, Kyle, et al.
Published: (2024)
by: Deeds, Kyle, et al.
Published: (2024)
Output-sensitive Conjunctive Query Evaluation
by: Deep, Shaleen, et al.
Published: (2024)
by: Deep, Shaleen, et al.
Published: (2024)
Semantic foundations of equality saturation
by: Suciu, Dan, et al.
Published: (2025)
by: Suciu, Dan, et al.
Published: (2025)
Boundedness for Unions of Conjunctive Regular Path Queries over Simple Regular Expressions
by: Figueira, Diego, et al.
Published: (2024)
by: Figueira, Diego, et al.
Published: (2024)
Regular Path Query Evaluation Sharing a Reduced Transitive Closure Based on Graph Reduction
by: Na, Inju, et al.
Published: (2021)
by: Na, Inju, et al.
Published: (2021)
Resilience for Regular Path Queries: Towards a Complexity Classification
by: Amarilli, Antoine, et al.
Published: (2024)
by: Amarilli, Antoine, et al.
Published: (2024)
Accelerating Regular Path Queries over Graph Database with Processing-in-Memory
by: Ma, Ruoyan, et al.
Published: (2024)
by: Ma, Ruoyan, et al.
Published: (2024)
cuRPQ: A High-Performance GPU-Based Framework for Processing Regular and Conjunctive Regular Path Queries
by: Park, Sungwoo, et al.
Published: (2026)
by: Park, Sungwoo, et al.
Published: (2026)
Output-Optimal Algorithms for Join-Aggregate Queries
by: Hu, Xiao
Published: (2024)
by: Hu, Xiao
Published: (2024)
Similar Items
-
Output-Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2025) -
Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2025) -
Insert-Only versus Insert-Delete in Dynamic Query Evaluation
by: Khamis, Mahmoud Abo, et al.
Published: (2023) -
Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations
by: Abo-Khamis, Mahmoud, et al.
Published: (2026) -
Pessimistic Cardinality Estimation
by: Khamis, Mahmoud Abo, et al.
Published: (2024)