383 search results - page 8 / 77 » Join operations in temporal databases |
139
click to vote
SIGMOD
2006
ACM
15 years 9 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...
AINA
2007
IEEE
15 years 1 months ago
2007
IEEE
Bloom filter based algorithms have proven successful as very efficient technique to reduce communication costs of database joins in a distributed setting. However, the full potent...
SIGMOD
1999
ACM
15 years 1 months ago
1999
ACM
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined...
VLDB
1995
ACM
15 years 1 months ago
1995
ACM
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R-tree, R+-tree, and the PMR quadtree. The focus is on a spatia...
DANTE
1999
IEEE
15 years 1 months ago
1999
IEEE
The growing importance of spatial data has made it imperative that spatial operations be executed efficiently. The most expensive operation is the join for spatial databases. This...