Sciweavers

1300 search results - page 184 / 260
» XML Query Processing and Optimization
Sort
View
223
Voted
ICDE
2007
IEEE
218views Database» more  ICDE 2007»
16 years 3 months ago
SKYPEER: Efficient Subspace Skyline Computation over Distributed Data
Skyline query processing has received considerable attention in the recent past. Mainly, the skyline query is used to find a set of non dominated data points in a multidimensional...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
16 years 2 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
16 years 2 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,...
133
Voted
VLDB
1995
ACM
194views Database» more  VLDB 1995»
15 years 5 months ago
Eager Aggregation and Lazy Aggregation
Efficient processing of aggregation queries is essential for decision support applications. This paper describes a class of query transformations, called eager aggregation and lat...
Weipeng P. Yan, Per-Åke Larson
DKE
2006
123views more  DKE 2006»
15 years 1 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...