Computer Science – Databases
Scientific paper
2011-10-10
Computer Science
Databases
This paper is representing work in progress of the authors. It is not aimed for publication in the present form
Scientific paper
We model the algorithmic task of geometric elimination (e.g., quantifier elimination in the elementary field theories of real and complex numbers) by means of certain constraint database queries, called geometric queries. As a particular case of such a geometric elimination task, we consider sample point queries. We show exponential lower complexity bounds for evaluating geometric queries in the general and in the particular case of sample point queries. Although this paper is of theoretical nature, its aim is to explore the possibilities and (complexity-)limits of computer implemented query evaluation algorithms for Constraint Databases, based on the principles of the most advanced geometric elimination procedures and their implementations, like, e.g., the software package "Kronecker".
Giusti Marc
Heintz Joos
Kuijpers Bart
No associations
LandOfFree
The evaluation of geometric queries: constraint databases and quantifier elimination does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The evaluation of geometric queries: constraint databases and quantifier elimination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The evaluation of geometric queries: constraint databases and quantifier elimination will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-471028