CONFERENCE PROCEEDINGS
Advanced Search
Home > Proceedings > Volume 5433 > Article
Paper
12 April 2004 Materialized view selection based on query cost in data warehouse
Lijuan Zhou, Chi Liu, Daxin Liu
Author Affiliations +
Proceedings Volume 5433, Data Mining and Knowledge Discovery: Theory, Tools, and Technology VI; (2004) https://doi.org/10.1117/12.531496
Event: Defense and Security, 2004, Orlando, Florida, United States
Abstract
Selecting views to materialize impacts on the efficiency as well as the total cost of establishing and running a data warehouse. One of the most important decisions in designing a data warehouse is selection of right views to be materialized. This problem is to select a right set of views that minimizes total query response time and the cost of view maintenance under a storage space constraint. In this paper, according to our practical application, the factor that refrains us from materializing all views in the data warehouse is not the space constraint but query response time. For queries fast answers may be required. So we develop algorithms to select a set of views to materialize in data warehouse in order to minimize the total view maintenance time under the constraint of a given query response time. We call it query-cost view select problem. First, we design algorithms for query-cost view select problem, we give view node matrix in order to solve it. Second , we use experiments do demonstrate the power of our approach . The results show that our algorithm works better in practical cases. We implemented our algorithms and a performance study of the algorithms shows that the proposed algorithm delivers an optimal solution. Finally, we discuss the observed behavior of the algorithms. We also identify some important issues for future investigations.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Citation Download Citation
Lijuan Zhou, Chi Liu, and Daxin Liu "Materialized view selection based on query cost in data warehouse", Proc. SPIE 5433, Data Mining and Knowledge Discovery: Theory, Tools, and Technology VI, (12 April 2004); https://doi.org/10.1117/12.531496
ACCESS THE FULL ARTICLE
ORGANIZATIONAL
Sign in with credentials provided by your organization.
INSTITUTIONAL
Select your institution to access the SPIE Digital Library.
SELECT YOUR INSTITUTION
PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
PERSONAL SIGN IN
No SPIE Account? Create one
PURCHASE THIS CONTENT
SUBSCRIBE TO DIGITAL LIBRARY
50 downloads per 1-year subscription
Members: $195
Non-members: $335 ADD TO CART
25 downloads per 1 - year subscription
Members: $145
Non-members: $250 ADD TO CART
PURCHASE SINGLE ARTICLE
Includes PDF, HTML & Video, when available
Members: $17.00
Non-members: $21.00 ADD TO CART
PROCEEDINGS
 7 PAGES
DOWNLOAD PAPER SAVE TO MY LIBRARY
GET CITATION
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithm development
RELATED CONTENT
Subscribe to Digital Library
Receive Erratum Email Alert
Back to Top