Sciweavers

128 search results - page 5 / 26
» Plan Selection Based on Query Clustering
Sort
View
77
Voted
ER
2003
Springer
148views Database» more  ER 2003»
15 years 2 months ago
Improving Query Performance Using Materialized XML Views: A Learning-Based Approach
We consider the problem of improving the efficiency of query processing on an XML interface of a relational database, for predefined query workloads. The main contribution of this ...
Ashish Shah, Rada Chirkova
89
Voted
VLDB
1995
ACM
129views Database» more  VLDB 1995»
15 years 1 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...
ICDE
2010
IEEE
292views Database» more  ICDE 2010»
15 years 9 months ago
Exploring Power-Performance Tradeoffs in Database Systems
With the total energy consumption of computing systems increasing in a steep rate, much attention has been paid to the design of energy-efficient computing systems and applications...
Zichen Xu, Yi-Cheng Tu, Xiaorui Wang
VLDB
1992
ACM
111views Database» more  VLDB 1992»
15 years 1 months ago
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
In this paper, we explore the execution of pipelined hash joins in a multiprocessor-based database system. To improve the query execution, an innovative approach on query executio...
Ming-Syan Chen, Ming-Ling Lo, Philip S. Yu, Honest...
DEXA
2008
Springer
120views Database» more  DEXA 2008»
14 years 11 months ago
Compressing Very Large Database Workloads for Continuous Online Index Selection
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of ...
Piotr Kolaczkowski