Sciweavers

353 search results - page 24 / 71
» Processing Top-k Join Queries
Sort
View
GIS
2006
ACM
14 years 9 months ago
Query optimizer for spatial join operations
This paper presents a query optimizer module based on cost estimation that chooses the best filtering step algorithm to perform a specific spatial join operation. A set of express...
Cirano Iochpe, João Luiz Dihl Comba, Miguel...
EDBT
2008
ACM
103views Database» more  EDBT 2008»
14 years 8 months ago
A stratified approach to progressive approximate joins
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...
Wee Hyong Tok, Stéphane Bressan, Mong-Li Le...
INFFUS
2008
175views more  INFFUS 2008»
13 years 8 months ago
Adaptive optimization of join trees for multi-join queries over sensor streams
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
Joseph S. Gomes, Hyeong-Ah Choi
ICDE
1998
IEEE
142views Database» more  ICDE 1998»
14 years 9 months ago
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
Current data repositories include a variety of data types, including audio, images and time series. State of the art techniques for indexing such data and doing query processing r...
Nick Koudas, Kenneth C. Sevcik
DKE
2006
123views more  DKE 2006»
13 years 8 months ago
Cost models for distance joins queries using R-trees
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....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...