Efficient processing of relational queries with sum constraints

Abstract

In this paper, we consider relational queries involving one or more constraints over the sum of multiple attributes (sum constraint queries). We develop rewriting techniques to transform a sum constraint query in order to enable its efficient processing by conventional relational database engines. We also consider the problem of producing partial results for sum constraint queries. We propose a framework for ranking tuples in a relation according to their likelihood of contributing to a tuple in the result of a sum constraint query. Sorting tuples using this framework provides an alternative to traditional sorting based on single attribute value. © Springer-Verlag Berlin Heidelberg 2007.