Probabilistic Databases with an Infinite Open-World Assumption
|
2019 |
Grohe, Martin |
Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
|
2019 |
Arenas, Marcelo |
Database Repairs and Consistent Query Answering: Origins and Further Developments
|
2019 |
Bertossi, Leopoldo |
The Complexity of Counting Cycles in the Adjacency List Streaming Model
|
2019 |
Kallaugher, John |
Robust Set Reconciliation via Locality Sensitive Hashing
|
2019 |
Mitzenmacher, Michael |
Tight Trade-offs for the Maximum k-Coverage Problem 230 in the General Streaming Model
|
2019 |
Indvk, Piotr |
Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives
|
2019 |
Borassi, Michele |
Making Consistency Protocols Serializable
|
2019 |
Fekete, Alan |
The Space-Efficient Core of Vadalog
|
2019 |
Berger, Gerald |
Decidable XPath Fragments in the Real World
|
2019 |
Baelde, David |
Complexity Bounds for Relational Algebra over Document Spanners
|
2019 |
Peterfreund, Liat |
Compiling Existential Positive Queries to Bounded-Variable Fragments
|
2019 |
Berkholz, Christoph |
The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems
|
2019 |
Chen, Hubie |
Query Evaluation in Election Databases
|
2019 |
Kimelfeld, Benny |
Ranked Enumeration of Minimal Triangulations
|
2019 |
Ravid, Noam |
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates
|
2019 |
Amarilli, Antoine |
Counting Database Repairs under Primary Keys Revisited
|
2019 |
Calautti, Marco |
Distributed and Streaming Linear Programming in Low Dimensions
|
2019 |
Assadi, Sepehr |
Weighted Reservoir Sampling from Distributed Streams
|
2019 |
Jayaram, Rajesh |
Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding
|
2019 |
Abdulla, Parosh Aziz |