MLPQ: a linear constraint database system with aggregate operators

Authors:
Peter Z. Revesz;Yiming Li
Affiliations:
University of Nebraska-Lincoln, Dept. of Computer Science and Engineering, Lincoln, NE;University of Nebraska-Lincoln, Dept. of Computer Science and Engineering, Lincoln, NE
Venue:
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
Year:
1997

Citing 5
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Constraint query languages

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Linear vs Polynomial Constraints in Database Query Languages

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Toward Practical Constraint Databases

VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Computing Queries on Linear Constraint Databases

DBLP-5 Proceedings of the Fifth International Workshop on Database Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the MLPQ constraint database system. The query language of MLPQ is SQL extended with linear arithmetic constraints. The input and output databases are Linear Constraint Databases (LCDBs). An important feature of the MLPQ system is that it can handle aggregate operators, Min, Max, Sum, Avg, etc. In MLPQ, these operators are evaluated for a series of linear programming (LP) problems. This approach provides an efficient way of evaluation of SQL queries with aggregate operators on linear constraint databases.