Saved in:
| Main Authors: | Park, Sungwoo, Kim, Seohyeon, Kim, Min-Soo |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.20748 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Minimizing Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2025)
by: Figueira, Diego, 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)
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)
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)
Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2022)
by: Figueira, Diego, et al.
Published: (2022)
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)
Output-Sensitive Evaluation of Regular Path Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2024)
by: Khamis, Mahmoud Abo, et al.
Published: (2024)
Data Path Fusion in GPU for Analytical Query Processing
by: Ozawa, Tsuyoshi, et al.
Published: (2026)
by: Ozawa, Tsuyoshi, et al.
Published: (2026)
Designing and Comparing RPQ Semantics
by: Marsault, Victor, et al.
Published: (2026)
by: Marsault, Victor, et al.
Published: (2026)
Resilience for Regular Path Queries: Towards a Complexity Classification
by: Amarilli, Antoine, et al.
Published: (2024)
by: Amarilli, Antoine, et al.
Published: (2024)
Evaluating Regular Path Queries on Compressed Adjacency Matrices
by: Arroyuelo, Diego, et al.
Published: (2023)
by: Arroyuelo, Diego, et al.
Published: (2023)
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)
Responsibility Measures for Conjunctive Queries with Negation
by: Bienvenu, Meghyn, et al.
Published: (2026)
by: Bienvenu, Meghyn, et al.
Published: (2026)
Direct Access for Conjunctive Queries with Negations
by: Capelli, Florent, et al.
Published: (2023)
by: Capelli, Florent, et al.
Published: (2023)
Ranked Enumeration of Conjunctive Query Results
by: Deep, Shaleen, et al.
Published: (2019)
by: Deep, Shaleen, et al.
Published: (2019)
Extremal Fitting Problems for Conjunctive Queries
by: Cate, Balder ten, et al.
Published: (2022)
by: Cate, Balder ten, et al.
Published: (2022)
Finding Smallest Witnesses for Conjunctive Queries
by: Hu, Xiao, et al.
Published: (2023)
by: Hu, Xiao, et al.
Published: (2023)
Output-sensitive Conjunctive Query Evaluation
by: Deep, Shaleen, et al.
Published: (2024)
by: Deep, Shaleen, et al.
Published: (2024)
Linear Programs with Conjunctive Database Queries
by: Capelli, Florent, et al.
Published: (2022)
by: Capelli, Florent, et al.
Published: (2022)
Fine-Grained Complexity of Regular Path Queries
by: Casel, Katrin, et al.
Published: (2021)
by: Casel, Katrin, et al.
Published: (2021)
Diversity of Answers to Conjunctive Queries
by: Merkl, Timo Camillo, et al.
Published: (2023)
by: Merkl, Timo Camillo, et al.
Published: (2023)
Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting
by: Khalfioui, Aziz Amezian El, et al.
Published: (2022)
by: Khalfioui, Aziz Amezian El, et al.
Published: (2022)
Quantum Computing for Query Containment of Conjunctive Queries
by: Gerlach, Luisa, et al.
Published: (2026)
by: Gerlach, Luisa, et al.
Published: (2026)
Space-Time Tradeoffs for Spatial Conjunctive Queries
by: Esmailpour, Aryan, et al.
Published: (2025)
by: Esmailpour, Aryan, et al.
Published: (2025)
Lower Bounds for Conjunctive Query Evaluation
by: Mengel, Stefan
Published: (2025)
by: Mengel, Stefan
Published: (2025)
MobileRAG: A Fast, Memory-Efficient, and Energy-Efficient Method for On-Device RAG
by: Park, Taehwan, et al.
Published: (2025)
by: Park, Taehwan, et al.
Published: (2025)
ExtGraph: A Fast Extraction Method of User-intended Graphs from a Relational Database
by: Park, Jeongho, et al.
Published: (2025)
by: Park, Jeongho, et al.
Published: (2025)
Enumeration Algorithms for Conjunctive Queries with Projection
by: Deep, Shaleen, et al.
Published: (2021)
by: Deep, Shaleen, et al.
Published: (2021)
Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries
by: Standke, Christoph, et al.
Published: (2025)
by: Standke, Christoph, et al.
Published: (2025)
Conjunctive Queries with Free Access Patterns under Updates
by: Kara, Ahmet, et al.
Published: (2022)
by: Kara, Ahmet, et al.
Published: (2022)
Towards Parameterized Hardness on Maintaining Conjunctive Queries
by: Wang, Qichen
Published: (2026)
by: Wang, Qichen
Published: (2026)
The Weisfeiler-Leman Dimension of Conjunctive Queries
by: Göbel, Andreas, et al.
Published: (2023)
by: Göbel, Andreas, et al.
Published: (2023)
Minimally Factorizing the Provenance of Self-join Free Conjunctive Queries
by: Makhija, Neha, et al.
Published: (2021)
by: Makhija, Neha, et al.
Published: (2021)
Project-connex Decompositions and Tractability of Aggregate Group-by Conjunctive Queries
by: Figueira, Diego, et al.
Published: (2025)
by: Figueira, Diego, et al.
Published: (2025)
Partition Constraints for Conjunctive Queries: Bounds and Worst-Case Optimal Joins
by: Deeds, Kyle, et al.
Published: (2025)
by: Deeds, Kyle, et al.
Published: (2025)
A Trichotomy for Regular Trail Queries
by: Martens, Wim, et al.
Published: (2019)
by: Martens, Wim, et al.
Published: (2019)
Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
by: Carmeli, Nofar, et al.
Published: (2025)
by: Carmeli, Nofar, et al.
Published: (2025)
Tractable Conjunctive Queries over Static and Dynamic Relations
by: Kara, Ahmet, et al.
Published: (2024)
by: Kara, Ahmet, et al.
Published: (2024)
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations
by: Focke, Jacob, et al.
Published: (2021)
by: Focke, Jacob, et al.
Published: (2021)
Direct Access for Answers to Conjunctive Queries with Aggregation
by: Eldar, Idan, et al.
Published: (2023)
by: Eldar, Idan, et al.
Published: (2023)
Similar Items
-
Minimizing Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2025) -
Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2025) -
Boundedness for Unions of Conjunctive Regular Path Queries over Simple Regular Expressions
by: Figueira, Diego, et al.
Published: (2024) -
Output-Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2025) -
Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2022)