Sciweavers

321 search results - page 1 / 65
» A view selection algorithm with performance guarantee
Sort
View
EDBT
2009
ACM
100views Database» more  EDBT 2009»
13 years 9 months ago
A view selection algorithm with performance guarantee
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
Nicolas Hanusse, Sofian Maabout, Radu Tofan
CORR
2011
Springer
168views Education» more  CORR 2011»
12 years 11 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
VLDB
1997
ACM
142views Database» more  VLDB 1997»
13 years 8 months ago
Algorithms for Materialized View Design in Data Warehousing Environment
Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a framework for analyzing the issues in selecting vi...
Jian Yang, Kamalakar Karlapalem, Qing Li
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
13 years 11 months ago
Optimal sensor hop selection: Sensor energy minimization and network lifetime maximization with guaranteed system performance
— In this paper we consider state estimation carried over a sensor network. A fusion center forms a local multi-hop tree of sensors and gateways and fuses the data into a state e...
Ling Shi, Karl Henrik Johansson, Richard M. Murray
APWEB
2004
Springer
13 years 10 months ago
Using Relational Database Constraints to Design Materialized Views in Data Warehouses
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
Taehee Lee, Jae-young Chang, Sang-goo Lee