| Title/Authors | Title | Research Artifacts
[?] A research
artifact is any by-product of a research project that is not
directly included in the published research paper. In Computer
Science research this is often source code and data sets, but
it could also be media, documentation, inputs to proof
assistants, shell-scripts to run experiments, etc.
|
Details |
|---|
|
Bounded Query Rewriting Using Views Yang Cao, Wenfei Fan, Floris Geerts, Ping Lu |
Bounded Query Rewriting Using Views Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures Pankaj K. Agarwal, Kyle Fox, Kamesh Munagala, Abhinandan Nath |
Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Efficient Top-k Indexing via General Reductions Saladi Rahul, Yufei Tao |
Efficient Top-k Indexing via General Reductions Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Range-Max Queries on Uncertain Data Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri |
Range-Max Queries on Uncertain Data Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Counting Answers to Existential Positive Queries: A Complexity Classification Hubie Chen, Stefan Mengel |
Counting Answers to Existential Positive Queries: A Complexity Classification Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Locating a Small Cluster Privately Kobbi Nissim, Uri Stemmer, Salil P. Vadhan |
Locating a Small Cluster Privately Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Recency-Bounded Verification of Dynamic Database-Driven Systems Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali, Othmane Rezine |
Recency-Bounded Verification of Dynamic Database-Driven Systems Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Towards Tight Bounds for the Streaming Set Cover Problem Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian |
Towards Tight Bounds for the Streaming Set Cover Problem Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Hypertree Decompositions: Questions and Answers Georg Gottlob, Gianluigi Greco, Nicola Leone, Francesco Scarcello |
Hypertree Decompositions: Questions and Answers Details |
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
|
Schema Validation via Streaming Circuits Filip Murlak, Charles Paperman, Michal Pilipczuk |
Schema Validation via Streaming Circuits Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
David Felber, Rafail Ostrovsky |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
AJAR: Aggregations and Joins over Annotated Relations Manas R. Joglekar, Rohan Puttagunta, Christopher Ré |
AJAR: Aggregations and Joins over Annotated Relations Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Better Algorithms for Counting Triangles in Data Streams Andrew McGregor, Sofya Vorotnikova, Hoa T. Vu |
Better Algorithms for Counting Triangles in Data Streams Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
2016 ACM PODS Alberto O. Mendelzon Test-of-Time Award Marcelo Arenas, Peter Buneman, Jan Van den Bussche |
2016 ACM PODS Alberto O. Mendelzon Test-of-Time Award Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins Xiao Hu, Ke Yi |
Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Minimization of Tree Pattern Queries Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys |
Minimization of Tree Pattern Queries Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Designing a Query Language for RDF: Marrying Open and Closed Worlds Marcelo Arenas, Martín Ugarte |
Designing a Query Language for RDF: Marrying Open and Closed Worlds Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Optimal Score Aggregation Algorithms Ronald Fagin |
Optimal Score Aggregation Algorithms Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Tractable Lineages on Treelike Instances: Limits and Extensions Antoine Amarilli, Pierre Bourhis, Pierre Senellart |
Tractable Lineages on Treelike Instances: Limits and Extensions Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries Michael A. Bender, Jonathan W. Berry, Rob Johnson, Thomas M. Kroeger, Samuel McCauley, Cynthia A. Phillips, Bertrand Simon, Shikha Singh, David Zage |
Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Are Few Bins Enough: Testing Histogram Distributions Clément L. Canonne |
Are Few Bins Enough: Testing Histogram Distributions Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Other
Verification:
Author has
verified
information
|
|
Moshe Y. Vardi |
Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Space Lower Bounds for Itemset Frequency Sketches Edo Liberty, Michael Mitzenmacher, Justin Thaler, Jonathan Ullman |
Space Lower Bounds for Itemset Frequency Sketches Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Incremental View Maintenance For Collection Programming Christoph Koch, Daniel Lupei, Val Tannen |
Incremental View Maintenance For Collection Programming Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Shortest Paths and Distances with Differential Privacy Adam Sealfon |
Shortest Paths and Distances with Differential Privacy Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Data Management for Social Networking Sara Cohen |
Data Management for Social Networking Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Publication does not represent original research
Verification:
Author has
verified
information
|
|
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems Arnab Bhattacharyya, Palash Dey, David P. Woodruff |
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable Tomasz Gogacz, Jerzy Marcinkowski |
Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Logical Aspects of Massively Parallel and Distributed Systems Frank Neven |
Logical Aspects of Massively Parallel and Distributed Systems Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Semantic Acyclicity Under Constraints Pablo Barceló, Georg Gottlob, Andreas Pieris |
Semantic Acyclicity Under Constraints Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors Vladimir Braverman, Stephen R. Chestnut, David P. Woodruff, Lin F. Yang |
Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Other
Verification:
Authors have
verified
information
|
|
Fast Algorithms for Parsing Sequences of Parentheses with Few Errors Arturs Backurs, Krzysztof Onak |
Fast Algorithms for Parsing Sequences of Parentheses with Few Errors Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Making SQL Queries Correct on Incomplete Databases: A Feasibility Study Paolo Guagliardo, Leonid Libkin |
Making SQL Queries Correct on Incomplete Databases: A Feasibility Study Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Verification of Hierarchical Artifact Systems Alin Deutsch, Yuliang Li, Victor Vianu |
Verification of Hierarchical Artifact Systems Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
On the Complexity of Inner Product Similarity Join Thomas Dybdahl Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri |
On the Complexity of Inner Product Similarity Join Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Computing Join Queries with Functional Dependencies Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu |
Computing Join Queries with Functional Dependencies Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
FAQ: Questions Asked Frequently Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra |
FAQ: Questions Asked Frequently Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Other
Verification:
Authors have
verified
information
|