Approximating Data in Constraint Databases
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Animating Spatiotemporal Constraint Databases
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
Safe Datalog Queries with Linear Constraints
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A retrospective on constraint databases
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Classes of Spatio-Temporal Objects and their Closure Properties
Annals of Mathematics and Artificial Intelligence
Developing a labelled object-relational constraint database architecture for the projection operator
Data & Knowledge Engineering
A comparison of abstract data type and constraint database approaches to GIS query languages
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
The 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.