Work

Computing Queries on Linear Constraint Databases

Year: 1995

Type: conference-paper

Abstract: We consider rational linear constraint databases, and study the problem of evaluating efficiently first-order queries with linear constraints. We show that although queries admit low data complexity (NC), their naive evaluation is rather ine cient. The computation paradigm is based on relational algebra and constraint solving. We focus on the former, and show that the query processing should differ drastically from classical relational databases. In particular, optimization strategies used for relational queries may be inadequate. We describe the problem and propose some preliminary optimization principles.

Source: Electronic workshops in computing

DOI: 10.14236/ewic/dbpl1995.17

Authors: Stéphane Grumbach, Zoé Lacroix

Institutions: Institut national de recherche en sciences et technologies du numérique, University of Toronto

Language: English

Topic: Advanced Database Systems and Queries

Subfield: Information Systems

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funder: Natural Sciences and Engineering Research Council of Canada

OpenAlex ID: W1482467709