Cover Image

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Im, Sungjin, Moseley, Benjamin, Ngo, Hung Q., Pruhs, Kirk
Format:	Preprint
Published:	2025
Subjects:	Databases Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
by: Im, Sungjin, et al.
Published: (2023)

Targeted Least Cardinality Candidate Key for Relational Databases
by: Nakos, Vasileios, et al.
Published: (2024)

Enumeration Algorithms for Conjunctive Queries with Projection
by: Deep, Shaleen, et al.
Published: (2021)

A Competitive Algorithm for Throughput Maximization on Identical Machines
by: Moseley, Benjamin, et al.
Published: (2021)

Efficiently Coloring the Intersection of a General Matroid and Partition Matroids
by: Arndt, Stephen, et al.
Published: (2025)

Approximation Algorithms for Matroid-Intersection Coloring with Applications to Rota's Basis Conjecture
by: Arndt, Stephen, et al.
Published: (2026)

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
by: Carmeli, Nofar, et al.
Published: (2025)

Competitive Online Transportation Simplified
by: Arndt, Stephen, et al.
Published: (2025)

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
by: Bringmann, Karl, et al.
Published: (2022)

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
by: Qi, Yiyan, et al.
Published: (2024)

On the Convergence Rate of Linear Datalogo over Stable Semirings
by: Im, Sungjin, et al.
Published: (2023)

Listing Even Cycles Faster than the Submodular-Width Barrier
by: Nakos, Vasileios, et al.
Published: (2026)

Robust Gittins for Stochastic Scheduling
by: Moseley, Benjamin, et al.
Published: (2025)

Direct Access for Answers to Conjunctive Queries with Aggregation
by: Eldar, Idan, et al.
Published: (2023)

Algorithms for Optimizing Acyclic Queries
by: Luo, Zheng, et al.
Published: (2025)

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

GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
by: Fan, Xiaoyu, et al.
Published: (2024)

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
by: Zhong, Ming, et al.
Published: (2023)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
by: Song, Siwoo, et al.
Published: (2025)

Approximating Queries on Probabilistic Graphs
by: Amarilli, Antoine, et al.
Published: (2023)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
by: Hamada, Kou, et al.
Published: (2024)

Simple Analysis of Priority Sampling
by: Daliri, Majid, et al.
Published: (2023)

Range (Rényi) Entropy Queries and Partitioning
by: Esmailpour, Aryan, et al.
Published: (2023)

Computing Data Distribution from Query Selectivities
by: Agarwal, Pankaj K., et al.
Published: (2024)

Querying in Constant Expected Time with Learned Indexes
by: Croquevielle, Luis, et al.
Published: (2024)

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
by: Arenas, Marcelo, et al.
Published: (2024)

Grafite: Taming Adversarial Queries with Optimal Range Filters
by: Costa, Marco, et al.
Published: (2023)

Socio-Spatial Group Queries for Impromptu Activity Planning
by: Shen, Chih-Ya, et al.
Published: (2015)

Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
by: Koehler, Henning, et al.
Published: (2025)

Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
by: Farhan, Muhammad, et al.
Published: (2025)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
by: Yang, Huihui, et al.
Published: (2025)

Binary Search with Distributional Predictions
by: Dinitz, Michael, et al.
Published: (2024)

AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
by: Ramos, David Torres, et al.
Published: (2026)

Improved Approximation Algorithms for Relational Clustering
by: Esmailpour, Aryan, et al.
Published: (2024)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
by: Wang, Carrie, et al.
Published: (2025)

Faster Relational Algorithms Using Geometric Data Structures
by: Esmailpour, Aryan, et al.
Published: (2026)

Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization
by: Ali, Dildar, et al.
Published: (2026)

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
by: Ning, Baoling, et al.
Published: (2024)

Faster Algorithms for Fair Max-Min Diversification in $\mathbb{R}^d$
by: Kurkure, Yash, et al.
Published: (2024)

The SpaceSaving$\pm$ Family of Algorithms for Data Streams with Bounded Deletions
by: Zhao, Fuheng, et al.
Published: (2023)