205 search results - page 16 / 41 » Optimizing Multiple Top-K Queries over Joins |
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
Query optimizers use base-table statistics to derive statistics on the sub-plans that are enumerated during optimization. In practice, traditional optimizers rely on a number of s...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Text documents often embed data that is structured in nature, and we can expose this structured data using information extraction technology. By processing a text database with inf...
DEBU
2008
13 years 7 months ago
2008
In this paper, we describe the TIMBER XML database system implemented at University of Michigan. TIMBER was one of the first native XML database systems, designed from the ground ...
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...