333 search results - page 16 / 67 » Query Optimization Using Local Completeness |
IDEAL
2009
Springer
13 years 5 months ago
2009
Springer
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...
BTW
2005
Springer
14 years 1 months ago
2005
Springer
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
An increasing number of applications operate on data obtained from the Web. These applications typically maintain local copies of the web data to avoid network latency in data acc...