Sciweavers

2223 search results - page 125 / 445
» Query Optimization in an OODBMS
Sort
View
FUIN
2006
139views more  FUIN 2006»
15 years 3 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
113
Voted
GEOINFORMATICA
2006
94views more  GEOINFORMATICA 2006»
15 years 3 months ago
Spatial Query Estimation without the Local Uniformity Assumption
Existing estimation approaches for spatial databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, the...
Yufei Tao, Christos Faloutsos, Dimitris Papadias
129
Voted
VLDB
2004
ACM
101views Database» more  VLDB 2004»
15 years 9 months ago
Taming XPath Queries by Minimizing Wildcard Steps
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
Chee Yong Chan, Wenfei Fan, Yiming Zeng
249
Voted
ICDE
2001
IEEE
121views Database» more  ICDE 2001»
16 years 5 months ago
Integrating Semi-Join-Reducers into State of the Art Query Processors
Semi-join reducers were introduced in the late seventies as a means to reduce the communication costs of distributed database systems. Subsequent work in the eighties showed, howe...
Konrad Stocker, Donald Kossmann, Reinhard Braumand...
142
Voted
PVLDB
2010
123views more  PVLDB 2010»
15 years 2 months ago
Sharing-Aware Horizontal Partitioning for Exploiting Correlations During Query Processing
Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each ...
Kostas Tzoumas, Amol Deshpande, Christian S. Jense...