311 search results - page 13 / 63 » Approximate XML joins |
WADS
2007
Springer
15 years 5 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
SSDBM
2003
IEEE
15 years 5 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...
IQIS
2007
ACM
15 years 1 months ago
2007
ACM
Approximate join is an important part of many data cleaning and integration methodologies. Various similarity measures have been proposed for accurate and efficient matching of st...
117
click to vote
EDBT
2002
ACM
15 years 11 months ago
2002
ACM
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
126
click to vote
SIGMOD
2003
ACM
15 years 12 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...