View merging in the context of view selection
Tóm tắt
Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To achieve the potential of materialized views, we must determine what views to materialize. An important issue in view selection is view merging. View merging can take a set of candidate views generated by analyzing queries in a workload, and produce a set of merged views by exploiting commonality among those queries. View merging can efficiently reduce candidate views for view selection. We present a merging tree, as well as a fast and scalable algorithm for view merging based on such a tree. The merging tree can significantly reduce the search space of potential views to be merged. Our approach is more scalable than the alternative of sequentially merging all pairs of views every time.
Từ khóa
#Merging #Computer science #Material storage #Space exploration #Query processing #Database systems #Data engineering #Costs #FiltersTài liệu tham khảo
gupta, 1997, Selection of views to materialize in a data warehouse, ICDT, 98
harinarayan, 1996, Implementing data cubes efficiently, SIGMOD, 205, 10.1145/235968.233333
10.1109/ICDE.2001.914852
srivastava, 1996, Answering Queries with Aggregation Using Views, VLDB, 318
shukla, 1998, Materialized View Selection for Multidimensional Datasets, VLDB, 488
shukla, 1996, Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies, VLDB, 522
yang, 1997, Algorithms for materialized view design in data warehousing environment, VLDB, 136
chirkova, 2001, A formal perspective on the view selection problem, Proc of VLDB, 59
10.1145/355068.355309
10.1109/ICDE.1999.754945
10.1145/376284.375706
10.1109/ICDE.1997.581755
baralis, 1997, Materialized views selection in a multidimensional database, VLDB, 156
agrawal, 2000, Automated Selection of Materialized Views and Indexes in SQL Databases, VLDB, 496
10.1007/3-540-49257-7_28