Time complexity of page filling algorithms in Materialized Aggregate List (MAL) and MAL/TRIGG materialization cost

• Autorzy: Gorawski M.
• Języki publikacji: EN

Abstrakty

EN

The Materialized Aggregate List (MAL) enables effective storing and processing of long aggregates lists. The MAL structure contains an iterator table divided into pages that stores adequate number of aggregates. Time complexity of three algorithms was calculated and, in comparison with experimental results, the best configuration of MAL parameters (number of pages, single page size and number of database connections) was estimated. MAL can be also applied to every aggregation level in different indexing structures, like for instance the aR-tree.

Słowa kluczowe

EN

spatial data warehouse; materialization; indexing; materialized aggregate list; time complexity of MAL algorithms

• Wydawca: Systems Research Institute, Polish Academy of Sciences
• Czasopismo: Control and Cybernetics
• Rocznik: 2009
• Tom: Vol. 38, no 1
• Strony: 153--172
• Opis fizyczny: Bibliogr. 12 poz., rys., wykr.

Twórcy

autor

Gorawski M.

• Silesian University of Technology, Institute of Computer Science Akademicka 16, 44-100 Gliwice, Poland,

Bibliografia

• BARALIS, E., PARABOSCHI,, S. and TENIENTE, E. (1997) Materialized view selection in multidimensional database. In: VLDB’97, Proceedings of 23rd International Conference on Very Large Data Bases. Morgan Kaufmann, 156-165.
• GOLFARELLI M., RIZZI S. and SALTARELLI E. (2002) Index selection for data warehousing. In: Proceedings of 4th International Workshop on Design and Management of Data Warehouses, DMDW’2002, Toronto, Canada. CEUR-WS 58, 33-42.
• GORAWSKI M. and MALCZOK R.(2004) Distributed Spatial Data Warehouse Indexed with Virtual Memory Aggregation Tree. Proceedings of 2nd International Workshop on Spatio-Temporal Database Management, STDBM’04, Toronto, Canada. Morgan Kaufmann, 25-32.
• GORAWSKI M. and MALCZOK R.(2005) On Efficient Storing and Processing of Long Aggregate Lists. 7th International Conference Data Warehousing and Knowledge Discovery, DaWaK. LNCS 3589, Springer Verlag, 190-199.
• GUPTA, H. (1997) Selection of views to materialize in a data warehouse. Proceedings of 6th International Conference ICDT’97, Delphi, Greece. LCNS 1186, Springer Verlag, 98-112.
• GUPTA, H.and MUMICK, I.S.(1999) Selection of views to materialize under a maintenance cost constraint. Proceedings of 7th International Conference ICDT’99, Jerusalem, Israel. LCNS 1540, Springer Verlag, 453-470.
• HARINARAYAN, V., RAJARAMAN, A. and ULLMAN, J. (1996) Implementing data cubes efficiently. ACM SIGMOD Rec. 25 (2), 205-216.
• LABIO W.J., QUASS D. and ADELBERG B. (1997) Physical database design for data warehouses. Proceedings of 13th International Conference on Data Engineering, Birmingham, UK. IEEE Computer Society, 277-288.
• RIZZI S. and SALTARELLI E.(2003) View Materialization vs. Indexing: Balancing Space Constraints in Data Warehouse Design. Proceedings of 15th International Conference on Advanced Information Systems Engineering, CAiSE 2003, Klagenfurt, Austria. LCNS 2681, Springer Verlag, 502-519.
• SUN MICROSYSTEMS Sun Microsystems JavaTM 2 Platform Standard Edition 5.0 API Specification, http://java.sun.com.
• THEODORATOS, D. and BOUZEHOUB, M. (2000) A general framework for the view selection problem for data warehouse design and evolution. Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP, McLean, Virginia, US. ACM Press, 1-8.
• WOJCIECHOWSKI M. and ZAKRZEWICZ M. (2002) Cost-based query optimizer III PLOUG Oracle Seminar. Polish Oracle User Group, Warszawa, 5-16.