AUT-QPM: The New Framework to Query Evaluation for Data Warehouse Creation
Subject Areas : electrical and computer engineering
N.
Daneshpour
1
Ahmad
Abdollahzadeh Barforoush
2
(Amirkabir)
Keywords: Data warehousedata warehouse designmethodologyquerysimulatorsoftware engineering,
Abstract :
The main reason of data warehouse systems failure is lack of justification proof. Analysis is an important task for decision about data warehouse creation. In this paper, we present the framework to justify data warehouse based on the input query types. We classify query types and execute them on the databases and data warehouses with different sizes. The query response time and the number of I/O are evaluation parameters. In the experiments, different types of queries have been processed on databases and data warehouses and the results based on time and memory have been compared. These results are presented below: • For answering multidimensional queries and aggregated queries data warehouse systems will be required, • For answering nested queries and join queries, data warehouse system will be useful, • Database systems will be proper for answering simple queries and computational queries. In this work, the tools which can process the above ideas have been produced. The software will take user query and evaluate its process to decide having or not having data warehouses.
[1] R. Kimball and M. Ross, The Data Warehouse Toolkit: the Complete Guide to Dimensional Modeling, 2nd Edition, John Wiley & Sons, pp. 1-27, 2002.
[2] J. Han and M. Kamber, Data Mining Concepts and Techniques, NewYork, NY: Morgan Kaufman, pp. 39-98, 2001.
[3] R. Kimball and J. Caserta, The Data Warehouse ETL Toolkit: Practical Techniques for Extracting, Cleaning, Conforming, and Delivering Data, John Wiley & Sons, pp. 29-52, 2004.
[4] C. Imhoff, N. Galemmo, and J. G. Geiger, Mastering Data Warehouse Design: Relational and Dimensional Techniques, John Wiley & Sons, pp. 3-26, 2003.
[5] R. Kimball, L. Reeves, M. Ross, and W. Thornthwaite, The Data Warehouse Lifecycle Toolkit: Expert Methods for Designing, Developing, and Deploying Data Warehouses, John Wiley & Sons, pp. 31-40, 1998.
[6] P. Ponniah, Data Warehousing Fundamentals, pp. 63-86, 2001.
[7] A. Silberschatz, H. F. Korth, and S. Sudarshan, Database System Concepts, Fifth ed. MC Graw - Hill, pp. 75-115, 2005.
[8] J. Ullman and J. Widom, A First Course in Database Systems,Prentice Hall, New Jersey, 2001.
[9] C. J. Date, An Introduction to Database Systems, Eight ed. Addison-Wesley, 2004.
[10] G. Gottlob, C. Koch, and K. U. Schulz et all, Conjunctive Queries Over Trees, ACM, PODS, pp. 189-200, 2004.
[11] K. L. Tan, C. H. Goh, and B. C. Ooi, "Online feedback for nested aggregate queries with multi-threading," in Proc. of the 25th VLDB Conf., pp. 18-29, Sep. 1999.
[12] C. Y. Chan and Y. E. Ioannidis, "Hierarchichal prefix cubes for range-sum queris," in Proc. of the 25th VLDB Conf., pp. 675-686, Sep. 1999.
[13 ] ن. دانشپور، رويكرد جديد در بهنگا مسازي پايگاه پردازش تحليلي، پايان نامه. كارشناسي ارشد، دانشگاه صنعتي اميركبير، .
1381 [14] B. McGehee, Use SET STATISTICS IO and SET STATISTICS TIME to Help Tune Your SQL Server Queries, Pipelines Newsletter, Feb. 2005.
[15] A. Tsois and T. K. Sellis, "The generalized pre-grouping transformation: aggregate-query optimization in the presence of dependencise," in Proc. of the 29th VLDB Conf., vol. 29, pp. 644-655, Sep. 2003.
[16] R. Kaushik, R. Ramakrishnan, and V. T. Chakaravarthy, Synopses for Query Optimization: A Space - Complexity Perspective, ACM, PODS, pp. 201-209, 2004.
[17] F. Scarcello, G. Greco, and N. Leone, Weighted Hypertree Decompositions and Optimal Query Plans, ACM, PODS, pp. 210- 221, 2004.
[18] R. Chirkova, C. Li, and J. Li, "Answering queries using materialized views with minimum size," VLDB J., vol. 15, no. 3, pp. 191-210, Sep. 2006.
[19] S. Cohen, W. Nutt, and Y. Sagir, "Rewriting queries with arbitrary aggregation functions using views," ACM Trans. on DatabaseSystems, vol. 31, no. 2, pp. 672-715, Jun. 2006.