736 search results - page 27 / 148 » Confidence-Aware Join Algorithms |
ICPADS
2000
IEEE
14 years 2 months ago
2000
IEEE
The most costly spatial operation in spatial databases is a spatial join with combines objects from two data sets based on spatial predicates. Even if the execution time of sequen...
SSDBM
2007
IEEE
14 years 4 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
FSTTCS
2004
Springer
14 years 3 months ago
2004
Springer
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
BNCOD
2004
13 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...