Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM

9781450371087

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Bag Query Containment and Information Theory

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems ◽

10.1145/3375395.3387645 ◽

2020 ◽

Author(s):

Mahmoud Abo Khamis ◽

Phokion G. Kolaitis ◽

Hung Q. Ngo ◽

Dan Suciu

Keyword(s):

Information Theory ◽

Query Containment

Download Full-text

New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems ◽

10.1145/3375395.3387647 ◽

2020 ◽

Cited By ~ 1

Author(s):

Cibele Freire ◽

Wolfgang Gatterbauer ◽

Neil Immerman ◽

Alexandra Meliou

Keyword(s):

Conjunctive Queries

Download Full-text

A Framework for Adversarially Robust Streaming Algorithms

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems ◽

10.1145/3375395.3387658 ◽

2020 ◽

Cited By ~ 1

Author(s):

Omri Ben-Eliezer ◽

Rajesh Jayaram ◽

David P. Woodruff ◽

Eylon Yogev

Keyword(s):

Streaming Algorithms

Download Full-text

Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems ◽

10.1145/3375395.3387642 ◽

2020 ◽

Author(s):

Mikaël Monet

Keyword(s):

Probabilistic Databases ◽

Special Case

Download Full-text

The Adversarial Robustness of Sampling

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems ◽

10.1145/3375395.3387643 ◽

2020 ◽

Author(s):

Omri Ben-Eliezer ◽

Eylon Yogev

Download Full-text

Aggregate Queries on Sparse Databases

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems ◽

10.1145/3375395.3387660 ◽

2020 ◽

Author(s):

Szymon Toruńczyk

Keyword(s):

Aggregate Queries

Download Full-text

On Monotonic Determinacy and Rewritability for Recursive Queries and Views

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems ◽

10.1145/3375395.3387661 ◽

2020 ◽

Author(s):

Michael Benedikt ◽

Stanislav Kikot ◽

Piotr Ostropolski-Nalewaja ◽

Miguel Romero

Download Full-text

Generative Datalog with Continuous Distributions

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems ◽

10.1145/3375395.3387659 ◽

2020 ◽

Cited By ~ 1

Author(s):

Martin Grohe ◽

Benjamin Lucien Kaminski ◽

Joost-Pieter Katoen ◽

Peter Lindner

Keyword(s):

Continuous Distributions

Download Full-text

A Tight Lower Bound for Comparison-Based Quantile Summaries

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems ◽

10.1145/3375395.3387650 ◽

2020 ◽

Cited By ~ 2

Author(s):

Graham Cormode ◽

Pavel Veselý

Keyword(s):

Lower Bound

Download Full-text

On the I/O Complexity of the k-Nearest Neighbors Problem

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems ◽

10.1145/3375395.3387649 ◽

2020 ◽

Author(s):

Mayank Goswami ◽

Riko Jacob ◽

Rasmus Pagh

Keyword(s):

Nearest Neighbors ◽

K Nearest Neighbors

Download Full-text

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM

Bag Query Containment and Information Theory

New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins

A Framework for Adversarially Robust Streaming Algorithms

Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases

The Adversarial Robustness of Sampling

Aggregate Queries on Sparse Databases

On Monotonic Determinacy and Rewritability for Recursive Queries and Views

Generative Datalog with Continuous Distributions

A Tight Lower Bound for Comparison-Based Quantile Summaries

On the I/O Complexity of the k-Nearest Neighbors Problem

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Latest Publications