Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
DynaMat: a dynamic view management system for data warehouses
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Sequence mining in categorical domains: incorporating constraints
Proceedings of the ninth international conference on Information and knowledge management
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Selection of Views to Materialize Under a Maintenance Cost Constraint
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Exploring the tradeoff between performance and data freshness in database-driven Web servers
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient View Maintenance in a Large-Scale Web Warehouse
CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
Selection of Views to Materialize in a Data Warehouse
IEEE Transactions on Knowledge and Data Engineering
Webview selection from user access patterns
Proceedings of the ACM first Ph.D. workshop in CIKM
Data mining-based materialized view and index selection in data warehouses
Journal of Intelligent Information Systems
CBAR: an efficient method for mining association rules
Knowledge-Based Systems
Caching and Materialization for Web Databases
Foundations and Trends in Databases
Selection of materialized views: a cost-based approach
CAiSE'03 Proceedings of the 15th international conference on Advanced information systems engineering
The Multidimensional Knapsack Problem: Structure and Algorithms
INFORMS Journal on Computing
Web usage mining for the recommendation of materialized webviews
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
Multi-constraint selection of materialized webviews
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
State transfer graph: an efficient tool for webview maintenance
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Clustering-based materialized view selection in data warehouses
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Dynamic materialized view selection algorithm: a clustering approach
ICDEM'10 Proceedings of the Second international conference on Data Engineering and Management
| Hi-index | 0.00 |
In this paper we present an approach, called MOWS, to select materialized webview in data--intensive websites (DIWS). A webview is a static instance of a dynamic web page. The materialization of webviews consists of storing the results of some requests on the server in order to avoid repetitive data generation from the sources. The aim is to improve the query response time. Our contribution in this work is to apply two steps for the selection of webviews. The first one is executed periodically and it consists of filtering the candidate webviews. It is called macro-selection. The second is executed online and it consists of selecting the materialized webviews. It is called micro-selection. Our experiment results show that our solution is very efficient to improve query response time especially for the websites with high size. For this type of websites, our approach overcomes the existing solutions and it improves their query response times by more than 70%.