721 search results - page 12 / 145 » Supporting top-k join queries in relational databases |
SSDBM
2003
IEEE
15 years 2 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
EDBT
2004
ACM
15 years 9 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...
BNCOD
2004
14 years 11 months ago
2004
Abstract. We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails...
ICDE
2007
IEEE
15 years 1 months ago
2007
IEEE
In this paper, we propose a simple and flexible execution model that (i) supports a wide spectrum of alternative optimization and execution strategies and their mixtures, (ii) pro...
IDEAS
2000
IEEE
15 years 2 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...