1101 search results - page 191 / 221 » Fault-Tolerance in Distributed Query Processing |
115
click to vote
SIGIR
2008
ACM
15 years 1 months ago
2008
ACM
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
138
click to vote
CIKM
2010
Springer
15 years 15 days ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
167
click to vote
SIGIR
2012
ACM
13 years 4 months ago
2012
ACM
Positional ranking functions, widely used in web search engines, improve result quality by exploiting the positions of the query terms within documents. However, it is well known ...
146
click to vote
ICDT
2012
ACM
13 years 4 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
123
click to vote
DOLAP
2004
ACM
15 years 7 months ago
2004
ACM
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...