Constraint Databases, Data Structures and Efficient Query Evaluation

Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the expressive power of first - order logic over the reals, as a constraint database query language, has been studied extensively. The d...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2004
Materias:
Data structures
Data visualization
Formal logic
Query languages
Boolean combinations
Constraint Databases
Data exploration
Efficient query evaluation
Expressive power
First order logic
Polynomial inequalities
Quantifier elimination
Query processing
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v3074_n_p1_Heintz
http://hdl.handle.net/20.500.12110/paper_03029743_v3074_n_p1_Heintz
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares