Efficient evaluation of specific queries in constraint databases | ||
| dc.conicet.organizacion | Hasselt University | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria | |
| dc.conicet.organizacion | Universidad de Cantabria | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria | |
| dc.conicet.organizacion | Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación | |
| dc.conicet.organizacion | Hasselt University | |
| dc.contributor.author | Grimson, Rafael | |
| dc.contributor.author | Heintz, Joos Ulrich | |
| dc.contributor.author | Kuijpers, Bart | |
| dc.date.issued | 2011-10 | |
| dc.description.abstract | Let F1,...,FsεR[X1,...,Xn] be polynomials of degree at most d, and suppose that F1,...,F s are represented by a division free arithmetic circuit of non-scalar complexity size L. Let A be the arrangement of Rn defined by F 1,...,Fs. For any point xεRn, we consider the task of determining the signs of the values F1(x),...,F s(x) (sign condition query) and the task of determining the connected component of A to which x belongs (point location query). By an extremely simple reduction to the well-known case where the polynomials F 1,...,Fs are affine linear (i.e., polynomials of degree one), we show first that there exists a database of (possibly enormous) size sO(L+n) which allows the evaluation of the sign condition query using only (Ln)O(1)log(s) arithmetic operations. The key point of this paper is the proof that this upper bound is almost optimal. By the way, we show that the point location query can be evaluated using dO(n)log(s) arithmetic operations. Based on a different argument, analogous complexity upper-bounds are exhibited with respect to the bit-model in case that F 1,...,Fs belong to Z[X1,...,Xn] and satisfy a certain natural genericity condition. Mutatis mutandis our upper-bound results may be applied to the sparse and dense representations of F 1,...,Fs. | es |
| dc.description.fil | Fil: Grimson, Rafael. Hasselt University; Bélgica. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria; Argentina | |
| dc.description.fil | Fil: Heintz, Joos Ulrich. Universidad de Cantabria; España. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina | |
| dc.description.fil | Fil: Kuijpers, Bart. Hasselt University; Bélgica | |
| dc.format | application/pdf | es |
| dc.identifier.citation | Grimson, Rafael; Heintz, Joos Ulrich; Kuijpers, Bart; Efficient evaluation of specific queries in constraint databases; Elsevier Science; Information Processing Letters; 111; 19; 10-2011; 941-944 | es |
| dc.identifier.institucional | CONICET | |
| dc.identifier.issn | 0020-0190 | es |
| dc.identifier.repo | CONICET Digital | |
| dc.identifier.uri | http://hdl.handle.net/11336/115004 | |
| dc.journal.ciudad | Amsterdam | es |
| dc.journal.number | 19 | es |
| dc.journal.pagination | 941-944 | es |
| dc.journal.pais | Países Bajos | es |
| dc.journal.title | Information Processing Letters | es |
| dc.journal.volume | 111 | es |
| dc.language.iso | eng | es |
| dc.publisher | Elsevier Science | es |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/abs/pii/S0020019011001864 | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/doi/https://doi.org/10.1016/j.ipl.2011.06.015 | |
| dc.rights | info:eu-repo/semantics/openAccess | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ | * |
| dc.subject | COMPUTATIONAL COMPLEXITY | es |
| dc.subject | CONSTRAINT DATABASES | es |
| dc.subject | QUERY EVALUATION | es |
| dc.subject.classification | Matemática Aplicada | es |
| dc.subject.classification | Matemáticas | es |
| dc.subject.classification | CIENCIAS NATURALES Y EXACTAS | es |
| dc.title | Efficient evaluation of specific queries in constraint databases | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
Archivos
Bloque original
Cargando...
- Nombre:
- CONICET_Digital_Nro.c118f804-dfc6-4b2c-94b3-fb1e81b1dbcf_L.pdf
- Tamaño:
- 130.96 KB
- Formato:
- Adobe Portable Document Format
- Descripción: