55 search results - page 2 / 11 » Evaluating rank joins with optimal cost |
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....
PVLDB
2010
13 years 3 months ago
2010
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...
PODS
1999
ACM
13 years 9 months ago
1999
ACM
One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all...
SSDBM
2006
IEEE
13 years 11 months ago
2006
IEEE
XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML repres...
DASFAA
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract. In emerging data stream applications, data sources are typically distributed. Evaluating multi-join queries over streams from different sources may incur large communica...