Abstract
In the first generation of databases, query optimizers were designed to optimize individual queries. Due to the predefined number of tables of a given database, the probability to have interaction between queries is high. As a consequence, optimizers propose solutions for multi-queries optimization. Getting this optimization is known as NP-hard problem. To ensure a scalable solution, we borrow techniques used in the electronic design automation (EDA) domain. In this paper, we first make an analogy between the multi-query optimization problem and the EDA domain. Secondly, we propose to model our problem with hypergraphs massively used to design and test integrated circuits. Thirdly, we use our results to materialize views. Finally, experiments are conducted to show the scalability of our approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bruno, N., Chaudhuri, S.: Efficient creation of statistics over query expressions. In: Proceedings of the International Conference on Data Engineering (ICDE), pp. 201–212 (2003)
Sellis, T.K.: Multiple-query optimization. ACM Transactions on Database Systems 13(1), 23–52 (1988)
Kerkad, A., Bellatreche, L., Geniet, D.: Queen-bee: Query interaction-aware for buffer allocation and scheduling problem. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2012. LNCS, vol. 7448, pp. 156–167. Springer, Heidelberg (2012)
Ahmad, M., Aboulnaga, A., Babu, S., Munagala, K.: Interaction-aware scheduling of report-generation workloads. VLDB Journal 20(4), 589–615 (2011)
Toroslu, I.H., Cosar, A.: Dynamic programming solution for multiple query optimization problem. Information Processing Letters 92(3), 149–155 (2004)
Yang, J., Karlapalem, K., Li, Q.: Algorithms for materialized view design in data warehousing environment. In: Proceedings of the International Conference on Very Large Databases (VLDB), pp. 136–145. Morgan Kaufmann Publishers Inc., San Francisco (1997)
Ioannidis, Y.E., Kang, Y.C.: Randomized algorithms for optimizing large join queries. In: Garcia-Molina, H., Jagadish, H.V. (eds.) ACM SIGMOD, pp. 312–321 (1990)
Le, W., Kementsietsidis, A., Duan, S., Li, F.: Scalable multi-query optimization for sparql. In: Proceedings of the International Conference on Data Engineering (ICDE), pp. 666–677. IEEE (2012)
ElMasri, R., Navathe, S.B.: Fundamentals of Database Systems. Benjamin Cummings, Redwood City (1994)
Gupta, H.: Selection and maintenance of views in a data warehouse. Ph.d. thesis, Stanford University (September 1999)
Yang, J., Karlapalem, K., Li, Q.: A framework for designing materialized views in data warehousing environment. In: ICDCS, p. 458 (1997)
Baralis, E., Paraboschi, S., Teniente, E.: Materialized view selection in a multidimensional database. In: Proceedings of the International Conference on Very Large Databases (VLDB), pp. 156–165 (August 1997)
Galindo-Legaria, C.A., Grabs, T., Gukal, S., Herbert, S., Surna, A., Wang, S., Yu, W., Zabback, P., Zhang, S.: Optimizing star join queries for data warehousing in microsoft sql server. In: Proceedings of the International Conference on Data Engineering (ICDE), pp. 1190–1199 (2008)
Gupta, A., Sudarshan, S., Viswanathan, S.: Query scheduling in multi query optimization. In: Proceedings of the International Database Engineering & Applications Symposium (IDEAS), pp. 11–19. IEEE Computer Society, Washington, DC (2001)
Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: applications in vlsi domain. IEEE Transactions on Very Large Scale Integration Systems 7(1), 69–79 (1999)
Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. In: ACM/IEEE Design Automation Conference (DAC), pp. 343–348. ACM, New York (1999)
Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: Application in vlsi domain. In: ACM/IEEE Design Automation Conference (DAC), pp. 526–529 (1997)
Selvakkumaran, N., Karypis, G.: Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25(3), 504–517
O’Neil, P., O’Neil, B., Chen, X.: Star schema benchmark (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boukorca, A., Bellatreche, L., Senouci, SA.B., Faget, Z. (2013). SONIC: Scalable Multi-query OptimizatioN through Integrated Circuits. In: Decker, H., Lhotská, L., Link, S., Basl, J., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 2013. Lecture Notes in Computer Science, vol 8055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40285-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-40285-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40284-5
Online ISBN: 978-3-642-40285-2
eBook Packages: Computer ScienceComputer Science (R0)