Sciweavers

782 search results - page 9 / 157
» Query interactions in database workloads
Sort
View
PODS
2003
ACM
113views Database» more  PODS 2003»
14 years 8 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
PVLDB
2008
121views more  PVLDB 2008»
13 years 8 months ago
QueryScope: visualizing queries for repeatable database tuning
Reading and perceiving complex SQL queries has been a time consuming task in traditional database applications for decades. When it comes to decision support systems with automati...
Ling Hu, Kenneth A. Ross, Yuan-Chi Chang, Christia...
PODS
1997
ACM
117views Database» more  PODS 1997»
14 years 19 days ago
On the Analysis of Indexing Schemes
We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We de ne a framework for measuring the eciency of an ind...
Joseph M. Hellerstein, Elias Koutsoupias, Christos...
ICDT
2005
ACM
108views Database» more  ICDT 2005»
14 years 1 months ago
Optimal Workload-Based Weighted Wavelet Synopses
In recent years wavelets were shown to be effective data synopses. We are concerned with the problem of finding efficiently wavelet synopses for massive data sets, in situations...
Yossi Matias, Daniel Urieli
ICDE
2010
IEEE
170views Database» more  ICDE 2010»
14 years 8 months ago
Workload Driven Index Defragmentation
Decision support queries that scan large indexes can suffer significant degradation in I/O performance due to index fragmentation. DBAs rely on rules of thumb that use index size a...
Manoj Syamala, Vivek R. Narasayya