Efficient processing of relational queries with sum constraints

Authors:
Svetlozar Nestorov;Chuang Liu;Ian Foster
Affiliations:
Department of Computer Science, The University of Chicago, Chicago, IL;Department of Computer Science, The University of Chicago, Chicago, IL;Department of Computer Science, The University of Chicago, Chicago, IL
Venue:
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Year:
2007

Citing 16
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
Parallel evaluation of multi-join queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
On the decidability of semi-linearity for semi-algebraic sets and its implications for spatial databases (extended abstract)

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Processing queries by linear constraints

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient searching with linear constraints

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Eddies: continuously adaptive query processing

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Content integration for e-business

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Database Systems: The Complete Book

Database Systems: The Complete Book
Access path selection in a relational database management system

SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Multi-Join Optimization for Symmetric Multiprocessors

VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Design and Evaluation of a Resource Selection Framework for Grid Applications

HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Optimal aggregation algorithms for middleware

Journal of Computer and System Sciences - Special issu on PODS 2001
Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes

IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
Supporting top-K join queries in relational databases

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient approximation of optimization queries under parametric aggregation constraints

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

Semi-skyline optimization of constrained skyline queries

ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115

Quantified Score

Hi-index	0.00

Visualization

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.