55 search results - page 3 / 11 » Cost models for distance joins queries using R-trees |
CIKM
2004
Springer
14 years 2 months ago
2004
Springer
We explore join optimizations in the presence of both timebased constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named...
ICDT
1999
ACM
14 years 1 months ago
1999
ACM
In data integration systems, queries posed to a mediator need to be translated into a sequence of queries to the underlying data sources. In a heterogeneous environment, with sour...
SSDBM
2006
IEEE
14 years 2 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...
PODS
1998
ACM
14 years 1 months ago
1998
ACM
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
PODS
1999
ACM
14 years 1 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...