Pushing extrema aggregates to optimize logic queries

Authors:
Filippo Furfaro;Sergio Greco;Sumit Ganguly;Carlo Zaniolo
Affiliations:
Dipto Elettronica Informatica e Sistemistica, Universitè della Calabria, ISI-CNR, Via P. Bucci 41 C, 87030 Rende-Cosenza, Italy;Dipto Elettronica Informatica e Sistemistica, Universitè della Calabria, ISI-CNR, Via P. Bucci 41 C, 87030 Rende-Cosenza, Italy;Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur 208016, India;Computer Science Department, University of California at Los Angeles, Los Angeles, CA
Venue:
Information Systems
Year:
2002

Citing 27
Cited 2

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs

Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs

Foundations of deductive databases and logic programming
The magic of duplicates and aggregates

Proceedings of the sixteenth international conference on Very large databases
On the power of magic

Journal of Logic Programming
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Shortest path by approximation in logic programs

ACM Letters on Programming Languages and Systems (LOPLAS)
Low-complexity aggregation in GraphLog and Datalog

ICDT Selected papers of the 4th international conference on Database theory
New techniques for studying set languages, bag languages and aggregate functions

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Extending the well-founded and valid semantics for aggregation

ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Modular stratification and magic sets for Datalog programs with negation

Journal of the ACM (JACM)
Efficient incremental evaluation of queries with aggregation

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Extrema predicates in deductive databases

Journal of Computer and System Sciences
The expressive powers of stable models for bound and unbound DATALOG queries

Journal of Computer and System Sciences - special issue on complexity theory
A framework for global optimization of aggregate queries

CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Foundations of aggregation constraints

Theoretical Computer Science
Stable models and non-determinism in logic programs with negation

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Greedy algorithms in Datalog with choice and negation

JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Querying aggregate data

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dynamic Programming in Datalog with Aggregates

IEEE Transactions on Knowledge and Data Engineering
Enhancing Disjunctive Datalog by Constraints

IEEE Transactions on Knowledge and Data Engineering
Optimization of Logic Queries with MIN and MAX Predicates

FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
Aggregation and Relevance in Deductive Databases

VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Logics with Aggregate Operators

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
User Defined Aggregates in Object-Relational Systems

ICDE '00 Proceedings of the 16th International Conference on Data Engineering

Declarative networking: language, execution and optimization

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Logic programming languages for databases and the web

A 25-year perspective on logic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we explore the possibility of transforming queries with minimum and maximum predicates into equivalent queries that can be computed more efficiently. The main contribution of the paper is an algorithm for propagating min and max predicates while preserving query equivalence under certain monotonicity constraints. We show that the algorithm is correct and that the transformed query is often safe when the original one is not. Although in this paper we use logic rules, the technique presented can be used to optimize (possibly recursive) queries expressed using SQL3.