Image de couverture de livre

Direct Access for Answers to Conjunctive Queries with Aggregation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Eldar, Idan, Carmeli, Nofar, Kimelfeld, Benny
Format:	Preprint
Publié:	2023
Sujets:	Databases Data Structures and Algorithms Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
par: Carmeli, Nofar, et autres
Publié: (2025)

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
par: Bringmann, Karl, et autres
Publié: (2022)

Factorised Representations of Join Queries: Tight Bounds and a New Dichotomy
par: Berkholz, Christoph, et autres
Publié: (2025)

Ranked Enumeration for MSO on Trees via Knowledge Compilation
par: Amarilli, Antoine, et autres
Publié: (2023)

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
par: Kleest-Meißner, Sarah, et autres
Publié: (2022)

The Importance of Parameters in Ranking Functions
par: Standke, Christoph, et autres
Publié: (2026)

Enumeration and updates for conjunctive linear algebra queries through expressibility
par: Muñoz, Thomas, et autres
Publié: (2023)

Enumeration Algorithms for Conjunctive Queries with Projection
par: Deep, Shaleen, et autres
Publié: (2021)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
par: Im, Sungjin, et autres
Publié: (2025)

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
par: Arenas, Marcelo, et autres
Publié: (2024)

Dynamic direct (ranked) access of MSO query evaluation over SLP-compressed strings
par: Muñoz, Martín
Publié: (2026)

The Importance of Parameters in Database Queries
par: Gilad, Amir, et autres
Publié: (2024)

Algorithms and Complexity of Difference Logic
par: Dabrowski, Konrad K., et autres
Publié: (2024)

Subgraph Isomorphism: Prolog vs. Conventional
par: Yin, Claire Y., et autres
Publié: (2025)

The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems
par: Barto, Libor, et autres
Publié: (2024)

Efficient Coalgebraic Partition Refinement
par: Dorsch, Ulrich, et autres
Publié: (2017)

Derivation and Verification of Array Sorting by Merging, and its Certification in Dafny
par: Carbonell, Juan Pablo, et autres
Publié: (2025)

Model checking with temporal graphs and their derivative
par: Bui-Xuan, Binh-Minh, et autres
Publié: (2026)

Approximate Model Counting, Sparse XOR Constraints and Minimum Distance
par: Boreale, Michele, et autres
Publié: (2019)

Direct Access for Conjunctive Queries with Negations
par: Capelli, Florent, et autres
Publié: (2023)

Foundations for an Abstract Proof Theory in the Context of Horn Rules
par: Lyon, Tim S., et autres
Publié: (2023)

Exact Exploration
par: Blass, Andreas, et autres
Publié: (2024)

Approximating Queries on Probabilistic Graphs
par: Amarilli, Antoine, et autres
Publié: (2023)

Algorithms for Optimizing Acyclic Queries
par: Luo, Zheng, et autres
Publié: (2025)

First Order Logic on Pathwidth Revisited Again
par: Lampis, Michael
Publié: (2022)

Toward a Uniform Algorithm and Uniform Reduction for Constraint Problems
par: Barto, Libor, et autres
Publié: (2026)

Fine-grained Meta-Theorems for Vertex Integrity
par: Lampis, Michael, et autres
Publié: (2021)

New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
par: Brakensiek, Joshua, et autres
Publié: (2026)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
par: Wang, Carrie, et autres
Publié: (2025)

Range (Rényi) Entropy Queries and Partitioning
par: Esmailpour, Aryan, et autres
Publié: (2023)

Flipper games for monadically stable graph classes
par: Gajarský, Jakub, et autres
Publié: (2023)

Elementary first-order model checking for sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2024)

On merge-models
par: Buffière, Hector, et autres
Publié: (2026)

CNFs and DNFs with Exactly $k$ Solutions
par: Chandran, L. Sunil, et autres
Publié: (2025)

Computing Data Distribution from Query Selectivities
par: Agarwal, Pankaj K., et autres
Publié: (2024)

Querying in Constant Expected Time with Learned Indexes
par: Croquevielle, Luis, et autres
Publié: (2024)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
par: Arroyuelo, Diego, et autres
Publié: (2023)

Grafite: Taming Adversarial Queries with Optimal Range Filters
par: Costa, Marco, et autres
Publié: (2023)

Socio-Spatial Group Queries for Impromptu Activity Planning
par: Shen, Chih-Ya, et autres
Publié: (2015)

The Iteration Number of the Weisfeiler-Leman Algorithm
par: Grohe, Martin, et autres
Publié: (2023)