50 search results - page 5 / 10 » Clone join and shadow join: two parallel spatial join algori... |
SSD
1999
Springer
13 years 11 months ago
1999
Springer
The family of R-trees is suitable for storing various kinds of multidimensional objects and is considered an excellent choice for indexing a spatial database. Region Quadtrees are ...
VLDB
1991
ACM
13 years 11 months ago
1991
ACM
Recent work on parallel joins and data skew has concentrated on algorithm design without considering the causes and chara.cteristics of data. skew itself. Existming ana.lyt,ic mod...
TKDE
2002
13 years 7 months ago
2002
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
DKE
2006
13 years 7 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....