Jinyang Li
Abstract
Relational queries are commonly used to support decision making in critical domains like hiring and college admissions. For example, a college admissions officer may need to select a subset of the applicants for in-person interviews, who individually meet the qualification requirements (e.g., have a sufficiently high GPA) and are collectively demographically diverse (e.g., include a sufficient number of candidates of each gender and of each race). However, traditional relational queries only support selection conditions checked against each input tuple, and they do not support diversity conditions checked against multiple, possibly overlapping, groups of output tuples. To address this shortcoming, we present Erica, an interactive system that proposes minimal modifications for selection queries to have them satisfy constraints on the cardinalities of multiple groups in the result. We demonstrate the effectiveness of Erica using several real-life datasets and diversity requirements.
- Wesley W. Chu and Qiming Chen. 1994. A structured approach for cooperative query answering. ACM TKDE 6, 5 (1994), 738--749.Google Scholar
- Daniel Deutch, Zachary G. Ives, Tova Milo, and Val Tannen. 2013. Caravan: Provisioning for What-If Analysis. In CIDR. www.cidrdb.org.Google Scholar
- Frances Ding, Moritz Hardt, John Miller, and Ludwig Schmidt. 2021. Retiring Adult: New Datasets for Fair Machine Learning. In Proceedings of NeurIPS.Google Scholar
- Marina Drosou, HV Jagadish, Evaggelia Pitoura, and Julia Stoyanovich. 2017. Diversity in big data: A review. Big data 5, 2 (2017), 73--84.Google Scholar
- Todd J. Green, Gregory Karvounarakis, and Val Tannen. 2007. Provenance semirings. In Proceedings of PODS.Google ScholarDigital Library
- Tomasz Imielinski and Witold Lipski Jr. 1984. Incomplete Information in Relational Databases. J. ACM 31, 4 (1984).Google ScholarDigital Library
- Jinyang Li, Yuval Moskovitch, Julia Stoyanovich, and H. V. Jagadish. 2023. Query Refinement for Diversity Constraint Satisfaction. https://github.com/JinyangLi01/Query_refinement/blob/master/FullPaper/Query_Refinement.pdf.Google Scholar
- Chaitanya Mishra and Nick Koudas. 2009. Interactive query refinement. In EDBT.Google Scholar
- Suraj Shetiya, Ian P Swift, Abolfazl Asudeh, and Gautam Das. 2022. Fairnessaware range queries for selecting unbiased data. In Proceedings of IEEE ICDE.Google Scholar
- Quoc Trung Tran and Chee-Yong Chan. 2010. How to conquer why-not questions. In Proceedings of ACM SIGMOD. 15--26.Google ScholarDigital Library
- Quoc Trung Tran, Chee-Yong Chan, and Srinivasan Parthasarathy. 2009. Query by output. In Proceedings of ACM SIGMOD. 535--548.Google ScholarDigital Library
Recommendations
Query Refinement for Diversity Constraint Satisfaction
Diversity, group representation, and similar needs often apply to query results, which in turn require constraints on the sizes of various subgroups in the result set. Traditional relational queries only specify conditions as part of the query predicate(...
View-Based Query Processing and Constraint Satisfaction
LICS '00: Proceedings of the 15th Annual IEEE Symposium on Logic in Computer ScienceView-based query processing requires answering a query posed to a database only based on the information on a set of views, which are again queries over the same database. This problem is relevant in many aspects of database management, and has been ...
Conjunctive-Query Containment and Constraint Satisfaction
Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systemsConjunctive-query containment is recognized as a fundamental problem in database query evaluation and optimization. At the same time, constraint satisfaction is recognized as a fundamental problem in artificial intelligence. What do conjunctive-query ...
Comments