1007 search results - page 62 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
142
click to vote
SIGMOD
2012
ACM
13 years 4 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
204
click to vote
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
136
click to vote
SIGMOD
2000
ACM
15 years 6 months ago
2000
ACM
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
110
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
In recent years, there has been an explosion of publicly available RDF and OWL data sources. In order to effectively and quickly answer queries in such an environment, we present...
104
click to vote
SIGIR
2006
ACM
15 years 8 months ago
2006
ACM
Large-scale web and text retrieval systems deal with amounts of data that greatly exceed the capacity of any single machine. To handle the necessary data volumes and query through...