2514 search results - page 21 / 503 » On the Computation of Approximations of Database Queries |
161
click to vote
ICMCS
2010
IEEE
15 years 7 months ago
2010
IEEE
Alice and Bob possess sequences x and y respectively and would like to compute the 1 distance, namely x - y 1 under privacy and communication constraints. The privacy constraint r...
144
click to vote
ICDE
2007
IEEE
16 years 14 days ago
2007
IEEE
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
160
click to vote
SAC
2002
ACM
15 years 5 months ago
2002
ACM
We have in a previous paper introduced the new query operators that are needed in order to support an XML query language that supports temporal operations. The query operators mak...
308
click to vote
ICDE
2009
IEEE
16 years 7 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
240
click to vote
VLDB
2001
ACM
16 years 6 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...