301 search results - page 26 / 61 » Efficient Sketches for the Set Query Problem |
ICML
1998
IEEE
15 years 11 months ago
1998
IEEE
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
169
click to vote
ICDE
2008
IEEE
16 years 11 days ago
2008
IEEE
We study the problem of answering XPATH queries using multiple materialized views. Despite the efforts on answering queries using single materialized view, answering queries using ...
104
click to vote
ASIACRYPT
2010
Springer
14 years 9 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
WWW
2007
ACM
15 years 11 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
103
click to vote
PVLDB
2008
14 years 10 months ago
2008
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...