55 search results - page 4 / 11 » Cost models for distance joins queries using R-trees |
DAWAK
2005
Springer
14 years 1 months ago
2005
Springer
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
SIGMOD
1995
ACM
13 years 11 months ago
1995
ACM
Text is a pervasive information type, and many applications require querying over text sources in addition to structured data. This paper studies the problem of query processing i...
EDBT
2010
ACM
13 years 6 months ago
2010
ACM
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...
PVLDB
2010
13 years 6 months ago
2010
To enable smart environments and self-tuning data centers, we are developing the Aspen system for integrating physical sensor data, as well as stream data coming from machine logi...