390 search results - page 65 / 78 » Approximate Query Answering in Locally Closed Databases |
102
click to vote
ICDT
2012
ACM
13 years 5 days ago
2012
ACM
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
ECIR
2004
Springer
14 years 11 months ago
2004
Springer
We simulate different architectures of a distributed Information Retrieval system on a very large Web collection, in order to work out the optimal setting for a particular set of r...
100
click to vote
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
WEBDB
2005
Springer
15 years 3 months ago
2005
Springer
Querying document-centric XML collections with structure conditions improves retrieval precisions. The structures of such XML collections, however, are often too complex for users...
EDBT
2008
ACM
15 years 10 months ago
2008
ACM
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...