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 |
---|
Reflections on Schema Mappings, Data Exchange, and Metadata Management Phokion G. Kolaitis |
Reflections on Schema Mappings, Data Exchange, and Metadata Management Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)? Michael Benedikt |
How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)? Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
Distributed Statistical Estimation of Matrix Products with Applications David P. Woodruff, Qin Zhang |
Distributed Statistical Estimation of Matrix Products with Applications Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates Matthias Niewerth, Luc Segoufin |
Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems Hung Q. Ngo |
Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
Reconciling Graphs and Sets of Sets Michael Mitzenmacher, Tom Morgan |
Reconciling Graphs and Sets of Sets Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Enumeration for FO Queries over Nowhere Dense Graphs Nicole Schweikardt, Luc Segoufin, Alexandre Vigny |
Enumeration for FO Queries over Nowhere Dense Graphs Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
Blockchains: Past, Present, and Future Arvind Narayanan |
Blockchains: Past, Present, and Future Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Publication does not represent original research
Verification:
Author has
verified
information
|
Containment for Rule-Based Ontology-Mediated Queries Pablo Barceló, Gerald Berger, Andreas Pieris |
Containment for Rule-Based Ontology-Mediated Queries Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Active Learning of GAV Schema Mappings Balder ten Cate, Phokion G. Kolaitis, Kun Qian, Wang-Chiew Tan |
Active Learning of GAV Schema Mappings Details |
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
Optimal Differentially Private Algorithms for k-Means Clustering Zhiyi Huang, Jinyan Liu |
Optimal Differentially Private Algorithms for k-Means Clustering Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Certain Answers Meet Zero-One Laws Leonid Libkin |
Certain Answers Meet Zero-One Laws Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
Heavy Hitters and the Structure of Local Privacy Mark Bun, Jelani Nelson, Uri Stemmer |
Heavy Hitters and the Structure of Local Privacy Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Set Similarity Search for Skewed Data Samuel McCauley, Jesper W. Mikkelsen, Rasmus Pagh |
Set Similarity Search for Skewed Data Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
2018 ACM PODS Alberto O. Mendelzon Test-of-Time Award Maurizio Lenzerini, Wim Martens, Nicole Schweikardt |
2018 ACM PODS Alberto O. Mendelzon Test-of-Time Award Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms Paraschos Koutris, Jef Wijsen |
Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
Constant Delay Algorithms for Regular Document Spanners Fernando Florenzano, Cristian Riveros, Martín Ugarte, Stijn Vansummeren, Domagoj Vrgoc |
Constant Delay Algorithms for Regular Document Spanners Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
The Tractability Frontier of Well-designed SPARQL Queries Miguel Romero |
The Tractability Frontier of Well-designed SPARQL Queries Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
Data Streams with Bounded Deletions Rajesh Jayaram, David P. Woodruff |
Data Streams with Bounded Deletions Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Martin Aumüller, Tobias Christiani, Rasmus Pagh, Francesco Silvestri |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Explanations and Transparency in Collaborative Workflows Serge Abiteboul, Pierre Bourhis, Victor Vianu |
Explanations and Transparency in Collaborative Workflows Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
General and Fractional Hypertree Decompositions: Hard and Easy Cases Wolfgang Fischl, Georg Gottlob, Reinhard Pichler |
General and Fractional Hypertree Decompositions: Hard and Easy Cases Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
First-Order Query Evaluation with Cardinality Conditions Martin Grohe, Nicole Schweikardt |
First-Order Query Evaluation with Cardinality Conditions Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
In-memory Representations of Databases via Succinct Data Structures: Tutorial Abstract Rajeev Raman |
In-memory Representations of Databases via Succinct Data Structures: Tutorial Abstract Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
Subtrajectory Clustering: Models and Algorithms Pankaj K. Agarwal, Kyle Fox, Kamesh Munagala, Abhinandan Nath, Jiangwei Pan, Erin Taylor |
Subtrajectory Clustering: Models and Algorithms Details |
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
Joining Extractions of Regular Expressions Dominik D. Freydenberger, Benny Kimelfeld, Liat Peterfreund |
Joining Extractions of Regular Expressions Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Improvements on the k-center Problem for Uncertain Data Sharareh Alipour, Amir Jafari |
Improvements on the k-center Problem for Uncertain Data Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
In-Database Learning with Sparse Tensors Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich |
In-Database Learning with Sparse Tensors Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Entity Matching with Active Monotone Classification Yufei Tao |
Entity Matching with Active Monotone Classification Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
Distinct Sampling on Streaming Data with Near-Duplicates Jiecao Chen, Qin Zhang |
Distinct Sampling on Streaming Data with Near-Duplicates Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity Francisco Maturana, Cristian Riveros, Domagoj Vrgoc |
Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
An Operational Approach to Consistent Query Answering Marco Calautti, Leonid Libkin, Andreas Pieris |
An Operational Approach to Consistent Query Answering Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Computing Optimal Repairs for Functional Dependencies Ester Livshits, Benny Kimelfeld, Sudeepa Roy |
Computing Optimal Repairs for Functional Dependencies Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
When Can We Answer Queries Using Result-Bounded Data Interfaces? Antoine Amarilli, Michael Benedikt |
When Can We Answer Queries Using Result-Bounded Data Interfaces? Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Compressed Representations of Conjunctive Query Results Shaleen Deep, Paraschos Koutris |
Compressed Representations of Conjunctive Query Results Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|