Sciweavers

136 search results - page 7 / 28
» Query optimizer for spatial join operations
Sort
View
DKE
2006
123views more  DKE 2006»
13 years 7 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...
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 8 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
ICDE
2003
IEEE
161views Database» more  ICDE 2003»
14 years 9 months ago
Structural Join Order Selection for XML Query Optimization
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
INFFUS
2008
175views more  INFFUS 2008»
13 years 7 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
ISCI
2007
105views more  ISCI 2007»
13 years 7 months ago
Cost modeling of spatial operators using non-parametric regression
In an object-relational database management system, a query optimizer requires users to provide cost models of userdefined functions. The traditional approach is analytical, that...
Songtao Jiang, Byung Suk Lee, Zhen He