Muestra la distribución de disciplinas para esta publicación.
Publicaciones WoS (Ediciones: ISSHP, ISTP, AHCI, SSCI, SCI), Scopus, SciELO Chile.
| Indexado |
|
||
| DOI | |||
| Año | 2009 | ||
| Tipo | proceedings paper |
Citas Totales
Autores Afiliación Chile
Instituciones Chile
% Participación
Internacional
Autores
Afiliación Extranjera
Instituciones
Extranjeras
Roughly, we define a redundant relation in a database instance (dbi) as a k-ary relation R such that there is a first-order query which evaluated in the reduced dbi, gives us R. So, we can eliminate that relation R as long as the equivalence classes of the relation of equality of the first-order types for all k-tuples in the dbi are not altered. It turns out that in a fixed dbi, the problem of deciding whether a given relation in the dbi is redundant is decidable, though intractable. We then study redundant relations with a restricted notion of equivalence so that the problem becomes tractable.
| Ord. | Autor | Género | Institución - País |
|---|---|---|---|
| 1 | FERRAROTTI, FLAVIO ANTONIO | Hombre |
Yahoo Res - Chile
Universidad de Santiago de Chile - Chile |
| 2 | Paoletti, Alejandra Lorena | Mujer | |
| 3 | Torres, Jose M. Turull | Hombre |
Massey Univ - Nueva Zelanda
|
| 4 | Heuser, CA | - | |
| 5 | Pernul, G | - |