Journal articleVLDB Journal · March 1, 2025
Differential privacy (DP) is the state-of-the-art and rigorous notion of privacy for answering aggregate database queries while preserving the privacy of sensitive information in the data. In today’s era of data analysis, however, it poses new challenges f ...
Full textCite
Journal articleProceedings of the VLDB Endowment · January 1, 2025
Datasets may include errors, and specifically violations of integrity constraints, for various reasons. Standard techniques for "minimal cost" database repairing resolve these violations by aiming for a minimum change in the data, and in the process, may s ...
Full textCite
Journal articleJournal of Statistical Software · January 1, 2025
dame-flame is a Python package for performing matching for observational causal inference on datasets containing discrete covariates. This package implements the dynamic almost matching exactly (DAME) and fast, large-scale almost matching exactly (FLAME) a ...
Full textCite
Journal articleAnnals of the Entomological Society of America · May 29, 2024
We describe a system called Qr-Hint that, given a (correct) target query Q* and a (wrong) working query Q, both expressed in SQL, provides actionable hints for the user to fix the working query so that it becomes semantically equivalent to the t ...
Full textCite
Journal articleProceedings of the VLDB Endowment · January 1, 2023
Synthetic data generation methods, and in particular, private synthetic data generation methods, are gaining popularity as a means to make copies of sensitive databases that can be shared widely for research and data analysis. Some of the fundamental opera ...
Full textCite
Journal articleFoundations and Trends in Databases · August 2, 2021
Humans reason about the world around them by seeking to understand why and how something occurs. The same principle extends to the technology that so many of human activities increasingly rely on. Issues of trust, transparency, and understandability are cr ...
Full textCite
Journal article · January 5, 2021
dame-flame is a Python package for performing matching for observational causal inference on datasets containing discrete covariates. This package implements the Dynamic Almost Matching Exactly (DAME) and Fast Large-Scale Almost Matching Exactly (FLAME) al ...
Open AccessLink to itemCite
Journal articleJournal of Machine Learning Research · January 1, 2021
A classical problem in causal inference is that of matching, where treatment units need to be matched to control units based on covariate information. In this work, we propose a method that computes high quality almost-exact matches for high-dimensional ca ...
Open AccessCite
Journal articleSIGMOD Record · December 9, 2020
The Future of Work (FoW) is witnessing an evolution where AI systems are used to the benefit of humans. Work here refers to all forms of paid and unpaid labor in both physical and virtual workplaces and that is enabled by AI systems. This covers crowdsourc ...
Full textCite
Journal articleProceedings of the ACM SIGMOD International Conference on Management of Data · June 14, 2020
Local sensitivity of a query Q given a database instance D, i.e. how much the output Q(D) changes when a tuple is added to D or deleted from D, has many applications including query analysis, outlier detection, and differential privacy. However, it is NP-h ...
Full textCite
Journal articleACM Transactions on Database Systems · February 17, 2020
We investigate the complexity of computing an optimal repair of an inconsistent database, in the case where integrity constraints are Functional Dependencies (FDs).We focus on two types of repairs: an optimal subset repair (optimal S-repair), which is obta ...
Full textCite
Journal articleProceedings of the VLDB Endowment · January 1, 2020
We investigate the computational complexity of minimizing the source side-effect in order to remove a given number of tuples from the output of a conjunctive query. This is a variant of the well-studied deletion propagation problem, the difference being th ...
Full textCite
Journal articleProceedings of the VLDB Endowment · January 1, 2020
We demonstrate I-REX1, a system designed to help users understand SQL query evaluation and debug SQL queries. I-REX lets users interactively “trace” the evaluation of complex SQL queries, including those with correlated subqueries. I-REX also ex ...
Full textCite
Journal articleProceedings of the VLDB Endowment · January 1, 2020
We propose to demonstrate MuSe, a system for Database repairs where constraints are expressed as Declarative Rules and can be interpreted in different ways by using four different semantics. Our framework may capture common, cross-relation, repair semantic ...
Full textCite
Journal articleProceedings. ACM-SIGMOD International Conference on Management of Data · June 2019
For testing the correctness of SQL queries, e.g., evaluating student submissions in a database course, a standard practice is to execute the query in question on some test database instance and compare its result with that of the correct query. Given two q ...
Full textCite
Journal articleProceedings of machine learning research · April 2019
Matching methods are heavily used in the social and health sciences due to their interpretability. We aim to create the highest possible quality of treatment-control matches for categorical data in the potential outcomes framework. The method proposed in t ...
Cite
Journal article · June 18, 2018
We aim to create the highest possible quality of treatment-control matches for categorical data in the potential outcomes framework. Matching methods are heavily used in the social sciences due to their interpretability, but most matching methods do not pa ...
Link to itemCite
Journal articleProceedings of the ... ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems · June 2018
We investigate the complexity of computing an optimal repair of an inconsistent database, in the case where integrity constraints are Functional Dependencies (FDs). We focus on two types of repairs: an optimal subset repair (optimal S-repair) that is obtai ...
Full textCite
Journal articleTheory of Computing Systems · July 1, 2017
In this paper, we study the complexity of answering conjunctive queries (CQ) with inequalities (≠). In particular, we are interested in comparing the complexity of the query with and without inequalities. The main contribution of our work is a novel combin ...
Full textCite
Journal articleACM Transactions on Database Systems · December 30, 2014
We study the problems of max/top-k and clustering when the comparison operations may be performed by oracles whose answer may be erroneous. Comparisons may either be of type or of value: given two data elements, the answer to a type comparison is "yes" if ...
Full textCite
Journal articleLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2006
Model Based Development (MBD) using Mathworks tools like Simulink, Stateflow etc. is being pursued in Honeywell for the development of safety critical avionics software. Formal verification techniques are well-known to identify design errors of safety crit ...
Full textCite
