View Selection and Materialization - Data Warehousing Design and Advanced Engineering Applications - page 130

CONCLUSION AND FUTURE WORK Bellahsene, Z. (2004). View adaptation in the

fragment-based approach. IEEE Transactions
on Knowledge and Data Engineering , 16 (11),
1441-1455. doi:10.1109/TKDE.2004.79

In this paper we have presented a new approach
for the view selection problem. We designed a
new method including a polynomial algorithm
that we have implemented on Oracle DBMS. The
main features of our method are:

Chirkova, R., Halevy, A., & Suciu, D. (2001). A
formal perspective on the view selection problem .
Paper presented at the International Conference
on Very Large Databases, Rome, Italy.

• It decides dynamically for a given query

which views are worthy to be material-
ized regarding the query processing cost,
the available storage capacity and also the
already materialized views.
It favors the more costly queries.

Ghozzi, F., Ravat, F., Teste, O., & Zurfluh, G.
(2003). Constraints and multidimensional data-
bases . In Proceedings of the International Confer-
ence Enterprise CEIS (pp. 104-111).

•

Gupta, A., & Mumick, I. (1995). Maintenance of
materialized views: Problems, techniques, and
applications. Data Engineering Bulletin , 18 (2),
3-18.

• Its view selection algorithm is based on the

meantime.
It includes a replacement policy for remov- •

ing already materialized views in order to
replace the less beneficial views with more
beneficial once.

Gupta, H., & Mumick, I. S. (1999). Selection of
views to materialize under a maintenance cost
constraint . Paper presented at the 7th International
Conference on Database Theory.

Since our view selection algorithm is dynamic,
it was very difficult to take the view maintenance
cost into account. However, our method includes
a repository of metadata about the sharing feature
that will allow reducing the view maintenance
cost. Our future work will address the problem of
view selection and the placement of materialized
views in a super-peer based PDMS.

Halevy,A. (2001).Answering queries using views:
A survey. The VLDB Journal , 10 (4), 270-294.
doi:10.1007/s007780100054

Kotidis,Y., & Roussopoulos, N. (1999). DynaMat :
A dynamic view management system for data
warehouses . Paper presented at the ACM SIG-
MOD International Conference on Management
of Data, Philadelphia, United States.

REFERENCES

Roy, P. Seshadri, S., Sudarshan, S., & Bhobe, S.
(2000). Efficient and extensible algorithms for
multiquery optimization. Paper presented at the
International Conference on Management of Data
SIGMOD, San Diego, USA.

Agrawal, S., Chaudhuri, S., & Narasayya, V.
(2000). Automated selection of materialized views
and indexes for SQL database. Paper presented
at the International Conference on Very Large
Databases (VLDB00), Cairo, Egypt.

Schnaitter, K., Abiteboul, S., Milo, T., & Polyzo-
tis, N. N. (2006). COLT - Continuous Online
Database Tuning . Paper presented at the ACM
SIGMOD Conference on Data Management,
SIGMOD'06

Baril, X., & Bellahsene, Z. (2003). Selection of
materialized views: A cost-based approach . Paper
presented at the International Conference on Ad-
vanced Information Systems Engineering.