OLAP queries perform analytical processing on enterprise warehouse data. These queries are implemented using aggregate as well as non-aggregate functions. Result extraction using OLAP queries involves traversal through huge number of warehouse records. For repeated queries, processing time can be saved by storing queries along with its result and other parameters like timestamp, frequency, threshold in relational database MQDB. With periodic data warehouse refresh, incremental results for the frequent queries are processed using data marts and results are combined with existing results. This paper depicts the methodology to derive results based on different aggregate functions giving the effect of incremental data. Some aggregate functions may require other measures to be stored for compiling results.

Data warehouse, Materialized queries, Aggregate functions, Deriving incremental results

[1] S. Chakraborty and J. Doshi, “Data Retrieval from Data Warehouse Using Materialized Query Database,” International Journal of Computer Sciences and Engineering, Vol.6(1), Jan 2018, E-ISSN: 2347-2693, pages 280-284.
[2] S. Chakraborty and J. Doshi, “Performance Evaluation of Materialized Query,” International Journal of Emerging Technology and Advanced Engineering, vol. 8, Issue 1, pages 243-249, January 2018.
[3] S. Chakraborty and J. Doshi, “Materialized Queries with Incremental Updates,” 3rd International Conference on Information and Communication Technology for Intelligent Systems, Springer Smart Innovation, Systems and Technologies (SIST). Series: http://www.springer.com/series/8767. [Presented, Ahmedabad, 6-7th April, In Press].
[4] S. Chakraborty and J. Doshi, “An Approach for Creating and Maintaining Dependent Data Marts using Materialized Queries’ Information,” International Journal of Scientific Research in Science, Engineering and Technology, vol 4, Issue 1, pages 1527-1533, JanuaryFebruary,2018.
[5] D Theodoratos, T Sellis, “Data Warehouse Configuration,”Proceedings of the 23rd VLDB Conference Athens, Greece, 1997.
[6] P. Karthik, G.Thippa Reddy, E.Kaari Vanan, “Tuning the SQL Query in order to Reduce Time Consumption,” IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 4, No 3, July 2012, ISSN (Online): 1694-0814.
[7] P O`Neil, D Quass, “Improved Query Performance with Variant Indexes,” Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, Pages 38-49.
[8] Z Lin, D Yang, G Song, T Wang, “Dealing with Query Contention Issue in Real-time Data Warehouses by Dynamic Multi-level Caches,” Computer and Information Technology, 2007. CIT 2007. 7th IEEE International Conference on Computer and Information Technology.
[9] S Chaudhuri, “An Overview of Query Optimization in Relational Systems,” PODS `98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Pages 34-43.
[10] P Roy, S. Seshadri, S. Sudarshan, S Bhobe, “Efficient and Extensible Algorithms for Multi Query Optimization,” Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Pages 249-260.
[11] A Gupta, V Harinarayan, D Quass, “Aggregate-Query Processing in Data Warehousing Environments,” Proceedings of the 21st VLDB Conference, Zurich, Swizerland, 1995.
[12] S Cohen, W Nutt, A Serebrenik, “Rewriting Aggregate Queries Using Views,” Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Pages 155-166.
[13] J Goldstein, P -A Larson, “Optimizing Queries Using Materialized Views: A Practical, Scalable Solution,” Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, Pages 331-342, ISBN:1-58113-332-4.