COMPARISON OF INQUIRY PROCESSINGS TO ACCES DATA WAREHOUSE USING THE MAPREDUCE TECHNOLOGY
There is a method for inquiry processing to the data warehouse with early materialization without hashing dimension tables in RAM. We compared this method with the MapReduce-Invisible Join (MRIJ) one with hashing dimension tables in RAM. The evaluation of time of the query Q3 of the test pattern TPC-H revealed the conditions applicable for each method. The dependences of query execution time on the number of nodes in the cluster and the data volume in tables of the warehouse were analyzed here as well.
Keywords: MapReduce technology, data warehouse, tables hashing, the MRIJ method, WHT method, query execution time, methods comparison
