55 search results - page 1 / 11 » Cost models for distance joins queries using R-trees |
DKE
2006
13 years 5 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....
NGITS
1997
Springer
13 years 9 months ago
1997
Springer
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross....
ICDM
2002
IEEE
13 years 10 months ago
2002
IEEE
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
ICDE
2012
IEEE
11 years 7 months ago
2012
IEEE
—Fuzzy/similarity joins have been widely studied in the research community and extensively used in real-world applications. This paper proposes and evaluates several algorithms f...
TKDE
2002
13 years 4 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...