80 search results - page 2 / 16 » A New Algorithm for Page Access Sequencing in Join Processin... |
TKDE
1998
13 years 5 months ago
1998
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
EDBTW
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
WWW
2008
ACM
14 years 6 months ago
2008
ACM
With the increasing amount of data and the need to integrate data from multiple data sources, a challenging issue is to find near duplicate records efficiently. In this paper, we ...
SIGMOD
2009
ACM
14 years 6 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
SIAMCOMP
2000
13 years 5 months ago
2000
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...