235 search results - page 17 / 47 » Evaluating Query Result Significance in Databases via Random... |
195
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
131
click to vote
WWW
2011
ACM
14 years 6 months ago
2011
ACM
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
EDBT
2006
ACM
15 years 11 months ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
178
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
183
click to vote
ICDT
2009
ACM
16 years 11 days ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...