Article

Computing closest common subexpressions for view selection problems

Authors:

Dimitri Theodoratos,

Calisto ZuzarteAuthors Info & Claims

DOLAP '06: Proceedings of the 9th ACM international workshop on Data warehousing and OLAP

Pages 75 - 82

https://doi.org/10.1145/1183512.1183527

Published: 10 November 2006 Publication History

Abstract

Selecting a set of views for materialization is a required task in many current database and data warehousing applications including the design of a data warehouse, and the maintenance of multiple materialized views. The selected views can be materialized permanently or transiently depending on the specific view selection problem. The view selection algorithms are expensive due to the size of the search space of the problem.In this paper we propose an approach for generating candidate views for materialization for view selection problems based on the definition of the input queries. We also provide rewritings of the input queries using the generated candidate views. In generating candidate views, we do not apply costbased techniques but we try to maximize the operations in the views. Subsequently, view selection algorithms can exploit problem dependent cost functions to choose among the generated candidate views. Our approach is not restricted to a specific view selection problem. Compared to a previous one, it generates views that involve more relation occurrences (or operations) and can reduce the size of the search space which can be very large. We implement our approach and we report some experimental evaluation with comparison to previous works.

References

[1]

Serge Abiteboul and Oliver M. Duschka. Complexity of answering queries using materialized views. In Proc. of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998.]]

Digital Library

[2]

Sanjay Agrawal, Surajit Chaudhuri, and Vivek R. Narasayya. Automated selection of materialized views and indexes in sql databases. In Proc. of the 26th International Conference on Very Large Data Bases, 2000.]]

Digital Library

[3]

Dimitri Theodoratos and Timos Sellis. Data Warehouse Configuration. In Proc. of the 23rd International Conference on Very Large Data Bases, 1997.]]

Digital Library

[4]

Randall G. Bello, Karl Dias, Alan Downing, James J. Feenan Jr., James L. Finnerty, William D. Norcott, Harry Sun, Andrew Witkowski, and Mohamed Ziauddin. Materialized views in oracle. In Proc. of the 24rd International Conference on Very Large Data Bases, 1998.]]

Digital Library

[5]

Fa-Chung Fred Chen and Margaret H. Dunham. Common Subexpression Processing in Multiple-Query Processing. IEEE Trans. Knowl. Data Eng., 1998.]]

Digital Library

[6]

Zhimin Chen and Vivek R. Narasayya. Efficient computation of multiple group by queries. In Proc. of the ACM SIGMOD International Conference on Management of Data, 2005.]]

Digital Library

[7]

Sheldon J. Finkelstein. Common subexpression analysis in database applications. In Proc. of the ACM SIGMOD International Conference on Management of Data, 1982.]]

Digital Library

[8]

Himanshu Gupta. Selection of views to materialize in a data warehouse. In Proc. of the 6th International Conference on Database Theory, 1997.]]

Digital Library

[9]

Himanshu Gupta and Inderpal Singh Mumick. Selection of views to materialize under a maintenance cost constraint. In Proc. of the 6th International Conference on Database Theory, 1999.]]

Digital Library

[10]

Venky Harinarayan, Anand Rajaraman, and Jeffrey D. Ullman. Implementing data cubes efficiently. In Proc. of the ACM SIGMOD International Conference on Management of Data, 1996.]]

Digital Library

[11]

Matthias Jarke. Common subexpression isolation in multiple query optimization. In Query Processing in Database Systems. Springer, 1985.]]

[12]

Panos Kalnis and Dimitris Papadias. Optimization algorithms for simultaneous multidimensional queries in olap environments. In Proc. of the Third International Conference on Data Warehousing and Knowledge Discovery, 2001.]]

Digital Library

[13]

Wolfgang Lehner, Roberta Cochrane, Hamid Pirahesh, and Markos Zaharioudakis. fAST Refresh Using Mass Query Optimization. In Proc. of the 17th International Conference on Data Engineering, 2001.]]

Digital Library

[14]

Jingni Li, Zohreh Asgharzadeh Talebi, Rada Chirkova, and Yahya Fathi. A formal model for the problem of view selection for aggregate queries. In Proc. of the 9th East European Conference on Advances in Databases and Information Systems, 2005.]]

Digital Library

[15]

Hoshi Mistry, Prasan Roy, S. Sudarshan, and Krithi Ramamritham. Materialized view selection and maintenance using multi-query optimization. In Proc. of the ACM SIGMOD International Conference on Management of Data, 2001.]]

Digital Library

[16]

Rachel Pottinger and Alon Y. Levy. A scalable algorithm for answering queries using views. In Proc. of 26th International Conference on Very Large Data Bases, 2000.]]

Digital Library

[17]

Kenneth A. Ross, Divesh Srivastava, and S. Sudarshan. Materialized view maintenance and integrity constraint checking: Trading space for time. In Proc. of the 1996 ACM SIGMOD International Conference on Management of Data, 1996.]]

Digital Library

[18]

Prasan Roy, S. Seshadri, S. Sudarshan, and Siddhesh Bhobe. Efficient and extensible algorithms for multi query optimization. In Proc. of the ACM SIGMOD International Conference on Management of Data, 2000.]]

Digital Library

[19]

Timos K. Sellis. Multiple-Query Optimization. ACM Trans. Database Syst., 13(1):23--52, 1988.]]

Digital Library

[20]

Amit Shukla, Prasad Deshpande, and Jeffrey F. Naughton. Materialized view selection for multidimensional datasets. In Proc. of 24rd International Conference on Very Large Data Bases, 1998.]]

Digital Library

[21]

Yingying Tao, Qiang Zhu, and Calisto Zuzarte. Exploiting common subqueries for complex query optimization. In Proc. of the conference of the Centre for Advanced Studies on Collaborative Research, IBM, 2002.]]

Digital Library

[22]

Dimitri Theodoratos and Mokrane Bouzeghoub. A General Framework for the View Selection Problem for Data Warehouse Design and Evolution. In Proc. of the ACM International Workshop on Data Warehousing and OLAP, 2000.]]

Digital Library

[23]

Dimitri Theodoratos and Wugang Xu. Constructing Search Spaces for Materialized View Selection. In Proc. of the ACM International Workshop on Data Warehousing and OLAP, 2004.]]

Digital Library

[24]

Wugang Xu, Calisto Zuzarte, and Dimitri Theodoratos. Preprocessing for fast refreshing materialized views in DB2. In Proc. of the 8th International Conference on Data Warehousing and Knowledge Discovery, 2006.]]

Digital Library

[25]

Markos Zaharioudakis, Roberta Cochrane, George Lapis, Hamid Pirahesh, and Monica Urata. Answering complex SQL queries using automatic summary tables. In Proc. of the ACM SIGMOD International Conference on Management of Data, 2000.]]

Digital Library

Cited By

Cuzzocrea AFisichella M(2012)Polynomial Asymptotic Complexity of Multiple-Objective OLAP Data Cube CompressionAdvances in Computational Intelligence10.1007/978-3-642-31715-6_61(580-593)Online publication date: 2012
https://doi.org/10.1007/978-3-642-31715-6_61
Lim LBhattacharjee B(2011)Optimizing Access across Multiple Hierarchies in Data WarehousesProceedings of the 2011 44th Hawaii International Conference on System Sciences10.1109/HICSS.2011.336(1-10)Online publication date: 4-Jan-2011
https://dl.acm.org/doi/10.1109/HICSS.2011.336
Cuzzocrea A(2010)A top-down approach for compressing data cubes under the simultaneous evaluation of multiple hierarchical range queriesJournal of Intelligent Information Systems10.1007/s10844-009-0099-234:3(305-343)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.1007/s10844-009-0099-2
Show More Cited By

Index Terms

Computing closest common subexpressions for view selection problems
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
    2. Query languages
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Constructing search spaces for materialized view selection
DOLAP '04: Proceedings of the 7th ACM international workshop on Data warehousing and OLAP

Deciding which views to materialize is an important problem in the design of a Data Warehouse. Solving this problem requires generating a space of candidate view sets from which an optimal or near-optimal one is chosen for materialization. In this paper ...
A Comparative Study of Materialised View Selection in Data Warehouse Environment
CICN '13: Proceedings of the 2013 5th International Conference on Computational Intelligence and Communication Networks

A data warehouse (DW) contains many views accessed by different queries. Amongst the most important decisions in designing a DW is the selection of views to materialize for efficiently supporting the process of decision making. Materialized views are ...
Selection of Views to Materialize in a Data Warehouse

A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing decision-support or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

DOLAP '06: Proceedings of the 9th ACM international workshop on Data warehousing and OLAP

November 2006

110 pages

ISBN:1595935304

DOI:10.1145/1183512

General Chair:
Il-Yeol Song
Drexel University
,
Program Chair:
Panos Vassiliadis
University of Ioannina, Greece

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 November 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CIKM06

Sponsor:

CIKM06: Conference on Information and Knowledge Management

November 10, 2006

Virginia, Arlington, USA

Acceptance Rates

Overall Acceptance Rate 29 of 79 submissions, 37%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
348
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Cuzzocrea AFisichella M(2012)Polynomial Asymptotic Complexity of Multiple-Objective OLAP Data Cube CompressionAdvances in Computational Intelligence10.1007/978-3-642-31715-6_61(580-593)Online publication date: 2012
https://doi.org/10.1007/978-3-642-31715-6_61
Lim LBhattacharjee B(2011)Optimizing Access across Multiple Hierarchies in Data WarehousesProceedings of the 2011 44th Hawaii International Conference on System Sciences10.1109/HICSS.2011.336(1-10)Online publication date: 4-Jan-2011
https://dl.acm.org/doi/10.1109/HICSS.2011.336
Cuzzocrea A(2010)A top-down approach for compressing data cubes under the simultaneous evaluation of multiple hierarchical range queriesJournal of Intelligent Information Systems10.1007/s10844-009-0099-234:3(305-343)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.1007/s10844-009-0099-2
Afrati FDamigos MGergatsoulis M(2009)On Solving Efficiently the View Selection Problem under Bag-SemanticsBusiness Intelligence for the Real-Time Enterprise10.1007/978-3-642-03422-0_2(12-28)Online publication date: 2009
https://doi.org/10.1007/978-3-642-03422-0_2
Lim LBhattacharjee B(2008)Optimizing Hierarchical Access in OLAP EnvironmentProceedings of the 2008 IEEE 24th International Conference on Data Engineering10.1109/ICDE.2008.4497613(1531-1533)Online publication date: 7-Apr-2008
https://dl.acm.org/doi/10.1109/ICDE.2008.4497613

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten