Sciweavers

136 search results - page 14 / 28
» Query optimizer for spatial join operations
Sort
View
ICDE
2003
IEEE
116views Database» more  ICDE 2003»
14 years 9 months ago
Joining Massive High-Dimensional Datasets
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
Tamer Kahveci, Christian A. Lang, Ambuj K. Singh
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 8 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
DASFAA
2006
IEEE
174views Database» more  DASFAA 2006»
13 years 11 months ago
Communication-Efficient Implementation of Range-Joins in Sensor Networks
Sensor networks are multi-hop wireless networks of resource constrained sensor nodes used to realize high-level collaborative sensing tasks. To query and access data generated and ...
Aditi Pandit, Himanshu Gupta
BNCOD
2011
356views Database» more  BNCOD 2011»
12 years 7 months ago
Achieving High Freshness and Optimal Throughput in CPU-Limited Execution of Multi-join Continuous Queries
Due to high data volumes and unpredictable arrival rates, continuous query systems processing expensive queries in real-time may fail to keep up with the input data streams - resul...
Abhishek Mukherji, Elke A. Rundensteiner, Matthew ...
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 8 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis