23 search results - page 1 / 5 » Database Support for Weighted Match Joins |
SSDBM
2007
IEEE
14 years 1 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 ...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
ICDE
2009
IEEE
14 years 8 months ago
2009
IEEE
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
SSDBM
2003
IEEE
14 years 7 days 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...
ICDE
2009
IEEE
14 years 8 months ago
2009
IEEE
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...