| Coresets for Robust Query Optimization |
2026 |
PODS |
4.9769913e-05 |
| Deterministic Lower Bounds for k-Edge Connectivity in the Distributed Sketching Model |
2026 |
PODS |
4.9769913e-05 |
| Faster Relational Algorithms Using Geometric Data Structures |
2026 |
PODS |
4.9769913e-05 |
| Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum |
2026 |
PODS |
4.9769913e-05 |
| FPT Parameterisations of Fractional and Generalised Hypertree Width |
2026 |
PODS |
4.9769913e-05 |
| Frequency Moments in Noisy Streaming and Distributed Data under Mismatch Ambiguity |
2026 |
PODS |
4.9769913e-05 |
| Improved Accuracy for Private Continual Cardinality Estimation in Fully Dynamic Streams via Matrix Factorization |
2026 |
PODS |
4.9769913e-05 |
| Improved Lower Bounds for Privacy under Continual Release |
2026 |
PODS |
4.9769913e-05 |
| Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time |
2026 |
PODS |
4.9769913e-05 |
| Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations |
2026 |
PODS |
4.9769913e-05 |
| Near-Optimality for Single-Source Personalized PageRank |
2026 |
PODS |
4.9769913e-05 |
| On Sketching Trimmed Statistics |
2026 |
PODS |
4.9769913e-05 |
| Optimal Enumeration of Regular Pattern Matches |
2026 |
PODS |
4.9769913e-05 |
| Optimal Pure Differentially Private Sparse Histograms in Deterministic Linear Time |
2026 |
PODS |
4.9769913e-05 |
| PANDAExpress: A Simpler and Faster PANDA Algorithm |
2026 |
PODS |
4.9769913e-05 |
| Recursive Querying of Neural Networks via Weighted Structures |
2026 |
PODS |
4.9769913e-05 |
| Sparsity-Dimension Trade-Offs for Oblivious Subspace Embeddings |
2026 |
PODS |
- |
| A Logical View of GNN-Style Computation and the Role of Activation Functions |
2026 |
PODS |
4.9769913e-05 |
| Tight Lower Bounds for l2 Sampling |
2026 |
PODS |
4.9769913e-05 |
| Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries |
2026 |
PODS |
4.9769913e-05 |
| Towards Parameterized Hardness on Maintaining Conjunctive Queries |
2026 |
PODS |
4.9769913e-05 |
| Weighted Fourier Factorizations: Optimal Gaussian Noise for Differentially Private Marginal and Product Queries |
2026 |
PODS |
4.9769913e-05 |
| A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions |
2026 |
PODS |
4.9769913e-05 |
| A Unifying Algorithm for Hierarchical Queries |
2026 |
PODS |
4.9769913e-05 |
| Bag Semantics Query Containment: The CQ vs. UCQ Case and Other Stories |
2026 |
PODS |
4.9769913e-05 |
| Codd's Theorem for Databases over Semirings |
2026 |
PODS |
4.9769913e-05 |
| Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation |
2026 |
PODS |
4.9769913e-05 |
| Query Answering Under Volume-Based Diversity Functions |
2026 |
PODS |
4.9769913e-05 |
| Representation Obliviousness and Pseudodeterminism in Streaming Algorithms |
2026 |
PODS |
4.9769913e-05 |
| The Space-Time Complexity of Sum-Product Queries |
2026 |
PODS |
4.9769913e-05 |
| Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries |
2026 |
PODS |
4.9769913e-05 |
| 100x Cost & Latency Reduction: Performance Analysis of AI Query Approximation using Lightweight Proxy Models: [Experiments & Analysis] |
2026 |
SIGMOD |
4.9769913e-05 |
| A Backend-Agnostic Compiler for Approximate Query Processing with Probabilistic Tensor Algebra |
2026 |
SIGMOD |
4.9769913e-05 |
| Accelerating Approximate Analytical Join Queries over Unstructured Data with Statistical Guarantees |
2026 |
SIGMOD |
4.9769913e-05 |
| Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries |
2026 |
SIGMOD |
4.9769913e-05 |
| Acyclic Graph Pattern Counting under Local Differential Privacy |
2026 |
SIGMOD |
4.9769913e-05 |
| Adaptive Outlier Detection over Data Stream |
2026 |
SIGMOD |
4.9769913e-05 |
| AgenticScholar: Agentic Data Management with Pipeline Orchestration for Scholarly Corpora |
2026 |
SIGMOD |
4.9769913e-05 |
| AlignedServe: Orchestrating Prefix-aware Batching to Build a High-throughput and Computing-efficient LLM Serving System |
2026 |
SIGMOD |
4.9769913e-05 |
| An Efficient Streaming Algorithm for Approximating Graphlet Distributions |
2026 |
SIGMOD |
4.9769913e-05 |
| An In-Depth Study of Filter-Agnostic Vector Search on a PostgreSQL Database System: [Experiments & Analysis] |
2026 |
SIGMOD |
4.9769913e-05 |
| ANTEATER: A Filter-then-Scrutinize Architecture for End-to-End Attack Investigation |
2026 |
SIGMOD |
4.9769913e-05 |
| Approximate DBSCAN via Density-Biased Sampling and Kernel Density Estimation |
2026 |
SIGMOD |
4.9769913e-05 |
| Are Learned DBMS Components Robust to Workload Drift?: [Experiments & Analysis] |
2026 |
SIGMOD |
4.9769913e-05 |
| ART That Lasts: Persistent Multiversion Adaptive Radix Trees with Fast Atomic Range Queries |
2026 |
SIGMOD |
4.9769913e-05 |
| ASSS: Adaptive Stratified Sampling for Shapley-like Values |
2026 |
SIGMOD |
4.9769913e-05 |
| Automated Discovery of Test Oracles for Database Management Systems Using LLMs |
2026 |
SIGMOD |
4.9769913e-05 |
| Balancing Global and Local: Representative Sampling for Large-Scale Vector Data |
2026 |
SIGMOD |
4.9769913e-05 |
| BAT: Target-Instance-Free Data Preparation Synthesis via LLM-Driven Tree Search |
2026 |
SIGMOD |
4.9769913e-05 |
| BEACON: Budget-Aware Entity Matching Across Domains |
2026 |
SIGMOD |
4.9769913e-05 |