950 search results - page 50 / 190 » Evaluation over thousands of queries |
SSDBM
2007
IEEE
14 years 4 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
ICDE
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract-- Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one le...
P2P
2007
IEEE
14 years 4 months ago
2007
IEEE
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
BTW
2007
Springer
14 years 2 months ago
2007
Springer
: The availability of versioned text collections such as the Internet Archive opens up opportunities for time-aware exploration of their contents. In this paper, we propose time-tr...
DEBS
2007
ACM
14 years 2 months ago
2007
ACM
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...