Buscar
Mostrando ítems 11-20 de 1852
Query evaluation in almost consistent databases using residues
(IEEE, 1998)
The authors consider the problem of logical characterization of the notion of correct answers in a relational database that may violate given integrity constraints. This notion is captured in terms of the possible repaired ...
Reducing hardware hit by queries in web search engines
(Pergamon-Elsevier Science Ltd, 2016-11)
In this paper, we introduce a new collection selection strategy to be operated in search engines with document partitioned indexes. Our method involves the selection of those document partitions that are most likely to ...
WSN-DD: A Wireless Sensor Network Deployment Design Tool
Query processing techniques have been shown to considerably
reduce software development efforts for wireless sensor networks.
However, deploying a sensor network remains a difficult and error-prone
task. This paper ...
DBM*-Tree: An efficient metric acces method
(Scopus, 2007)
In this paper we propose a new dynamic Metric Access Method (MAM) called DBM*-Tree, which uses precomputed distances to reduce the construction cost avoiding repeated calculus of distance. Making use of the pre-calculated ...
Querys de Imágenes Basadas en Contenido
(2006-10-12)
El objetivo de esta tesis es estudiar las técnicas y herramientas existentes para la recuperación de imágenes almacenadas en la Web con consultas guiadas por el contenido de la imagen (no por el complemento textual asociado ...
MWAND: A New Early Termination Algorithm for Fast and Efficient Query Evaluation
Nowadays, current information systems are so large and maintain huge amount of data. At every time, they process millions of documents and millions of queries. In order to choose the most important responses from this ...