60 search results - page 2 / 12 » A pruning-based approach for supporting Top-K join queries |
VLDB
2004
ACM
14 years 5 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
VLDB
2001
ACM
13 years 9 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
SSDBM
2007
IEEE
13 years 11 months ago
2007
IEEE
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics ...
EDBT
2004
ACM
14 years 5 months ago
2004
ACM
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
IDEAS
2000
IEEE
13 years 9 months ago
2000
IEEE
Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records...