Materialized View Construction Using Linearizable Nonlinear Regression

Query processing at runtime is an important issue for data-centric applications. A faster query execution is highly required which means searching and returning the appropriate data of database. Different techniques have been proposed over the time and materialized view construction is one of them. The efficiency of a materialized view (MV) is measured based on hit ratio, which indicates the ratio of number of successful search to total numbers of accesses. Literature survey shows that few research works has been carried out to analyze the relationship between the attributes based on nonlinear equations for materialized view creation. However, as nonlinear regression is slower, in this research work they are mapped into linear equations to keep the benefit of both the approaches. This approach is applied to recently executed query set to analyze the attribute affinity and then the materialized view is formed based on the result of attribute affinity.

[1]  Jingren Zhou,et al.  Efficient Maintenance of Materialized Outer-Join Views , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[2]  Surajit Chaudhuri,et al.  Automated Selection of Materialized Views and Indexes in SQL Databases , 2000, VLDB.

[3]  Jérôme Darmont,et al.  Clustering-Based Materialized View Selection in Data Warehouses , 2006, ADBIS.

[4]  Ziyu Lin,et al.  User-Oriented Materialized View Selection , 2007, 7th IEEE International Conference on Computer and Information Technology (CIT 2007).

[5]  Jonathan Goldstein,et al.  Optimizing queries using materialized views: a practical, scalable solution , 2001, SIGMOD '01.

[6]  M. S. Ali,et al.  Materialized View Selection in Data Warehousing , 2007, Fourth International Conference on Information Technology (ITNG'07).

[7]  Agostino Cortesi,et al.  A New Scale for Attribute Dependency in Large Database Systems , 2012, CISIM.

[8]  N. Chaki,et al.  Materialized view construction using linear regression on attributes , 2012, 2012 Third International Conference on Emerging Applications of Information Technology.

[9]  Agostino Cortesi,et al.  Optimal Space and Time Complexity Analysis on the Lattice of Cuboids Using Galois Connections for Data Warehousing , 2009, 2009 Fourth International Conference on Computer Sciences and Convergence Information Technology.

[10]  Wang Shuai,et al.  A modifying strategy of group query based on materialized view , 2010, 2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE).

[11]  Cheng-Yan Kao,et al.  Materialized view selection using genetic algorithms in a data warehouse system , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[12]  Luping Ding,et al.  Dynamic Materialized Views , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[13]  Sameem Abdul Kareem,et al.  Using Genetic Algorithm to Select Materialized Views Subject to Dual Constraints , 2009, 2009 International Conference on Signal Processing Systems.

[14]  Jeffrey D. Ullman,et al.  Implementing data cubes efficiently , 1996, SIGMOD '96.

[15]  Jian Yang,et al.  A framework for designing materialized views in data warehousing environment , 1997, Proceedings of 17th International Conference on Distributed Computing Systems.

[16]  An Gong,et al.  Clustering-Based Dynamic Materialized View Selection Algorithm , 2008, 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery.

[17]  Leonid Libkin,et al.  Incremental maintenance of views with duplicates , 1995, SIGMOD '95.