Deciding equivalences among conjunctive aggregate queries
Equivalence of aggregate queries is investigated for the class of conjunctive queries with
comparisons and the aggregate operators count, count-distinct, min, max, and sum …
comparisons and the aggregate operators count, count-distinct, min, max, and sum …
Automated verification of query equivalence using satisfiability modulo theories
Database-as-a-service offerings enable users to quickly create and deploy complex data
processing pipelines. In practice, these pipelines often exhibit significant overlap of …
processing pipelines. In practice, these pipelines often exhibit significant overlap of …
Tiresias: the database oracle for how-to queries
How-To queries answer fundamental data analysis questions of the form:" How should the
input change in order to achieve the desired output". As a Reverse Data Management …
input change in order to achieve the desired output". As a Reverse Data Management …
Linearized and single-pass belief propagation
How can we tell when accounts are fake or real in a social network? And how can we tell
which accounts belong to liberal, conservative or centrist users? Often, we can answer such …
which accounts belong to liberal, conservative or centrist users? Often, we can answer such …
Rewriting queries with arbitrary aggregation functions using views
The problem of rewriting aggregate queries using views is studied for conjunctive queries
with arbitrary aggregation functions and built-in predicates. Two types of queries over views …
with arbitrary aggregation functions and built-in predicates. Two types of queries over views …
On improving user response times in tableau
P Terlecki, F Xu, M Shaw, V Kim, R Wesley - Proceedings of the 2015 …, 2015 - dl.acm.org
The rapid increase in data volumes and complexity of applied analytical tasks poses a big
challenge for visualization solutions. It is important to keep the experience highly interactive …
challenge for visualization solutions. It is important to keep the experience highly interactive …
On simplification of database integrity constraints
H Christiansen, D Martinenghi - Fundamenta Informaticae, 2006 - journals.sagepub.com
Without proper simplification techniques, database integrity checking can be prohibitively
time consuming. Several methods have been developed for producing simplified …
time consuming. Several methods have been developed for producing simplified …
Equivalence of queries that are sensitive to multiplicities
S Cohen - The VLDB Journal, 2009 - Springer
The query equivalence problem has been studied extensively for set-semantics and, more
recently, for bag and bag-set semantics. However, SQL queries often combine set, bag and …
recently, for bag and bag-set semantics. However, SQL queries often combine set, bag and …
Equivalence of queries combining set and bag-set semantics
S Cohen - Proceedings of the twenty-fifth ACM SIGMOD-SIGACT …, 2006 - dl.acm.org
The query equivalence problem has been studied extensively for set-semantics and, more
recently, for bag-set semantics. However, SQL queries often combine set and bag-set …
recently, for bag-set semantics. However, SQL queries often combine set and bag-set …
Advanced techniques for efficient data integrity checking
D Martinenghi - 2005 - forskning.ruc.dk
Integrity constraint checking, understood as the verification of data correctness and
wellformedness conditions that must be satisfied in any state of a database, is not fully …
wellformedness conditions that must be satisfied in any state of a database, is not fully …