Abstract
A data warehouse (DW) is designed primarily to meet the informational needs of an organization’s decision support system. Most queries posed on such systems are analytical in nature. These queries are long and complex, and are posed in an exploratory and ad-hoc manner. The response time of these queries is high when processed directly against a continuously growing DW. In order to reduce this time, materialized views are used as an alternative. It is infeasible to materialize all views due to storage space constraints. Further, optimal view selection is an NP-Complete problem. Alternately, a subset of views, from amongst all possible views, needs to be selected that improves the response time for analytical queries. In this paper, a quantum-inspired evolutionary view selection algorithm (QIEVSA) that selects Top-K views from a multidimensional lattice has been proposed. Experimental comparison of QIEVSA with other evolutionary view selection algorithms shows that QIEVSA is able to select Top-K views that are comparatively better in reducing the response times for analytical queries. This in turn aids in efficient decision making.
Similar content being viewed by others
References
Inmon W H 2003 Building the data warehouse, 3rd ed. India: Wiley Dreamtech India Pvt. Ltd
Rainardi V 2008 Building a data warehouse: with examples in SQL server. New York: Apress
Kimball R and Ross M 2002 The data warehouse toolkit: the complete guide to dimensional modelling. Hoboken: Wiley
Widom J 1995 Research problems in data warehousing. In: Proceedings on the 4th international conference on information and knowledge management, Baltimore, Maryland, pp. 25–30
Ponniah P 2004 Data warehousing fundamentals: a comprehensive guide for IT professionals. Hoboken: Wiley
Cabibbo L and Torlone R 1998 A logical approach to multidimensional databases. In: Advances in database technology-EDBT’98, Lecture notes in computer science, vol. 1377, pp. 183–197
Choong Y W, Laurent A and Laurent D 2007 Pixelizing data cubes: a block-based approach. In: Pixelization paradigm, Lecture notes in computer science, vol. 4370, pp. 63–76
Codd E F, Codd S B and Salley C T 1993 Providing OLAP (on line analytical processing) to user-analysts: an IT mandate. Dorset: E. F. Codd and Associates
Thomsen E 2002 OLAP solutions: building multidimensional information systems. Hoboken: Wiley
Golfarellia M, Maniezzo V and Rizzi S 2004 Materialization of fragmented views in multidimensional databases. Data Knowl. Eng. 49: 325–351
Gray J, Bosworth A, Lyaman A and Pirahesh H 1996 Data cube: a relational aggregation operator generalizing GROUP-BY, CROSS-TAB, and SUB-TOTALS. In: Proceedings of the 12th IEEE international conference on data engineering, pp. 152–159
Gupta H 1997 Selection of views to materialize in a data warehouse. In: Proceedings of the 6th ICDT, pp. 98–112
Harinarayan V, Rajaraman A and Ullman J D 1996 Implementing data cubes efficiently. In: Proceedings of ACM SIGMOD, Montreal, Canada, pp. 205–216
Niemi T, Nummenmaa J and Thanisch P 2001 Constructing OLAP cubes based on queries. In: Proceedings of the 4th ACM international workshop on data warehousing and OLAP, pp. 9–15
Roussopoulos N 1997 Materialized views and data warehouse. In: Proceedings of the 4th KRDB workshop, Athens, Greece, August
Chirkova R and Yang J 2011 Materialized views. Found. Trends Databases 4(4): 295–405
Mami I and Bellahsene Z 2012 A survey of view selection methods. ACM SIGMOD Record 41(1): 20–29
Yang J, Karlapalem K and Li Q 1997 Algorithms for materialized view design in data warehousing environment. Very Large databases (VLDB) J 136–145
Yousri N A R, Ahmed K M and El-Makky N M 2005 Algorithms for selecting materialized views in a data warehouse. In: Proceedings of the ACS/IEEE 2005 international conference on computer systems and applications, AICCSA’05, IEEE Computer Society, pp. 27–1
Chirkova R, Halevy A Y and Suciu D 2001 A formal perspective on the view selection problem. In: Proceedings of the 27 VLDB conference, Italy, pp. 59–68
Chaves L W F, Buchmann E, Hueske F and Bohm K 2009 Towards materialized view selection for distributed databases. In: Proceedings of the 12th international conference on extending database technology: advances in database technology, pp. 1088–1099
Goasdoue F, Karanasos K, Leblay J and Manolescu I 2011 View selection in semantic web databases. In: Proceedings of the VLDB endowment, vol. 5(2), pp. 97–108
Katsifodimos A, Manolescu I and Vassalos V 2012 Materialized view selection for XQuery workloads. In: Proceedings of the international conference on management of data (SIGMOD’12), pp. 565–576
Teschke M and Ulbrich A 1997 Using materialized views to speed up data warehousing. Technical Report, IMMD 6, Universität Erlangen-Nümberg
Agrawal S, Chaudhuri S and Narasayya V R 2000 Automated selection of materialized views and indexes in SQL databases. In: Proceedings of the 26th international conference on very large databases, Cairo, Egypt, pp. 496–505
Aouiche K and Darmont J 2009 Data mining-based materialized view and index selection in data warehouse. J. Intell. Inf. Syst. 33(1): 65–93
Aouiche K, Jouve P E and Darmont J 2006 Clustering-based materialized view selection in data warehouses. In: Proceedings of the 10th East-European conference on advances in databases and information systems (ADBIS06), Thessaloniki, Greece, LNCS, vol. 4152, pp. 81–95
Baralis E, Paraboschi S and Teniente E 1997 Materialized view selection in a multidimensional database. In: Proceedings of the 23rd VLDB conference, Greece, pp. 156–165
Lehner W, Ruf T and Teschke M 1996 Improving query response time in scientific databases using data aggregation. In: Proceedings of the 7th international conference and workshop on database and expert systems applications, DEXA 96, Zurich, pp. 201–206
Theodoratos D and Sellis T 1997 Data warehouse configuration. In: Proceedings of VLDB, Athens, Greece, pp. 126–135
Vijay Kumar T V and Devi K 2013 An architectural framework for constructing materialized views in a data warehouse. Int. J. Innov. Manag. Technol. 4(2): 192–197
Vijay Kumar T V and Devi K 2012 Materialized view construction in data warehouse for decision making. Int J Bus Inf Syst 11(4): 379–396
Vijay Kumar T V, Goel A and Jain N 2010 Mining information for constructing materialized views. Int. J. Inf. Commun. Technol. 2(4): 386–405
Gupta H and Mumick I S 2005 Selection of views to materialize in a data warehouse. IEEE Trans. Knowl. Data Eng. 17(1): 24–43
Gupta H, Harinarayan V, Rajaraman V and Ullman J 1997 Index selection for OLAP. In: Proceedings of the 13th international conference on data engineering, ICDE 97, Birmingham, UK, pp. 208–219
Haider M and Vijay Kumar T V 2011 Materialised view selection using size and query frequency. Int. J. Value Chain Manag. 5(2): 95–105
Haider M and Vijay Kumar T V 2017 Query frequency based view selection. Int. J. Bus. Anal. 4(1): 36–55
Serna-Encinas M T and Hoyo-Montano J A 2007 Algorithm for selection of materialized views: based on a costs model. In: Proceedings of the 8th international conference on current trends in computer science, pp. 18–24
Shah B Ramachandran K and Raghavan V 2006 A hybrid approach for data warehouse view selection. Int. J. Data Wareh. Min. 2(2): 1–37
Shukla A, Deshpande P M and Naughton J F 1998 Materialized view selection for multidimensional datasets. In: Proceedings of VLDB, pp. 488–500
Valluri S, Vadapalli S and Karlapalem K 2002 View relevance driven materialized view selection in data warehousing environment. Aust. Comput. Sci. Commun. 24(2): 187–196
Vijay Kumar T V and Ghoshal A 2009 A reduced lattice greedy algorithm for selecting materialized views. Commun. Comput. Inf. Sci. 31: 6–18
Vijay Kumar T V, Haider M and Kumar S 2011 A view recommendation greedy algorithm for materialized views selection. Commun. Comput. Inf. Sci. 141: 61–70
Vijay Kumar T V and Haider M 2010 A query answering greedy algorithm for selecting materialized views. In: Lecture notes in artificial intelligence (LNAI). Berlin: Springer, vol. 6422, pp. 153–162
Vijay Kumar T V and Haider M 2011 Greedy views selection using size and query frequency. Commun. Comput. Inf. Sci. 125: 11–17
Vijay Kumar T V and Haider M 2012 Materialized views selection for answering queries. In: Lecture notes in computer science (LNCS). Berlin: Springer, vol. 6411, pp. 44–51
Vijay Kumar T V and Haider M 2015 Query answering based view selection. Int. J. Bus. Inf. Syst. 18(3): 338–353
Vijay Kumar T V and Haider M 2011 Selection of views for materialization using size and query frequency. Commun. Comput. Inf. Sci. 147: 150–155
Vijay Kumar T V, Haider M and Kumar S 2010 Proposing candidate views for materialization. Commun. Comput. Inf. Sci. 54: 89–98
Vijay Kumar T V 2013 Answering query-based selection of materialised views. Int. J. Inf. Decision Sci. 5(1): 103–116
De Jong K A 2006 Evolutionary computation: a unified approach. Cambridge: MIT Press
Horng J T, Chang Y J, Liu B J and Kao C Y 1999 Materialized view selection using genetic algorithms in a data warehouse system. In: Proceedings of the world congress on evolutionary computation, IEEE CEC, Washington, DC, USA, vol. 3, pp. 2221–2227
Lawrence M 2006 Multiobjective genetic algorithms for materialized view selection in OLAP data warehouses. In: Proceedings of the 8th annual conference on genetic and evolutionary computation, GECCO’06, July 8–12, Seattle, Washington, USA, pp. 699–706
Lee M and Hammer J 2001 Speeding up materialized view selection in data warehouse using a random algorithm. Int. J. Coop. Inf. Syst. 10: 327–353
Lin W and Kuo I C 2004 A genetic algorithm for OLAP data cubes. Int. J. Knowl. Inf. Syst. 6(1): 83–102
Loureiro J and Belo O 2006 An evolutionary approach to the selection and allocation of distributed cubes. In: Proceedings of the 10th international database engineering and applications symposium, IDEAS’06, IEEE, pp. 243–248
Talebian S H and Abdul Kareem S 2009 Using genetic algorithm to select materialized views subject to dual constraints. In: Proceedings of the international conference on signal processing systems, IEEE, pp. 633–638
Wagner N and Agrawal V 2013 Using an evolutionary algorithm to solve the weighted view materialisation problem for data warehouses. Int. J. Intell. Inf. Database Syst. 7(2): 163–179
Wang Z and Zhang D 2005 Optimal genetic view selection algorithm under space constraint. Int. J. Inf. Technol. 11(5): 44–51
Yu J X, Yao Y X, Choi C and Gou G 2003 Materialized view selection as constrained evolutionary optimization. IEEE Trans. Syst. Man Cybern. 33(4): 458–467
Zhang C, Yao X and Yang J 2001 An evolutionary approach to materialized views selection in a data warehouse environment. IEEE Trans. Syst. Man Cybern. 31(3): 282–294
Zhang C, Yao X and Yang J 1999 Evolving materialized views in a data warehouse. In: Proceedings of the IEEE congress on evolutionary computations, vol. 2, pp. 823–829
Zhou L, He X and Li K 2012 An improved approach for materialized view selection based on genetic algorithm. J. Comput. 7(7): 1591–1598
Vijay Kumar T V and Kumar S 2012 Materialized view selection using genetic algorithm. Commun. Comput. Inf. Sci. 306: 225–237
Vijay Kumar T V and Kumar S 2013 Materialized view selection using memetic algorithm. In: Lecture notes in artificial intelligence (LNAI). Berlin: Springer, vol. 8284, pp. 316–327
Vijay Kumar T V and Kumar S 2014 Materialized view selection using differential evolution. Int. J. Innov. Comput. Appl. 6(2):102–113
Han K H and Kim J W 2002 Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans. Evolut. Comput. 6(6): 580–593
Zhang G 2011 Quantum-inspired evolutionary algorithms: a survey and empirical study. J. Heuristics 17: 303–351
Manju A and Nigam M J 2014 Applications of quantum inspired computational intelligence: a survey. Artif. Intell. Rev. 42: 79–156
Han K H, Park K H, Lee C H and Kim J H 2001 Parallel quantum inspired genetic algorithm for combinatorial optimization problem. In: Proceedings of the 2001 congress on evolutionary computation, Seoul, Korea, vol. 2, pp. 1422–1429
Li B B and Wang L 2006 A hybrid quantum-inspired genetic algorithm for multi-objective scheduling. In: Proceedings of the 2006 international conference on intelligent computing, Kunming, China
Narayan A and Moore M 1995 Quantum-inspired genetic algorithms. In: Proceedings of the 1996 IEEE international conference on evolutionary computation (ICEC96), pp. 61–66
Zhou S and Sun Z 2005 A new approach belonging to EDAs: quantum-inspired genetic algorithm with only one chromosome. In: Lecture notes in computer science (LNCS). Berlin: Springer, vol. 3612, pp. 141–150
Zhou R and Cao J 2014 Quantum novel genetic algorithm based on parallel subpopulation computing and its application. Artif Intell Rev 41(3): 359–371
Hey T 1999 Quantum computing: an introduction. Comput. Control Eng. J. 10(3): 105–112
Grigorenko I and Garcia M 2002 Calculation of the partition function using quantum genetic algorithms. Physica A Stat. Mech. App. 313(3–4): 463–470
Grigorenko I and Garcia M 2001 Ground-state wave functions of two-particle systems determined using quantum genetic algorithms. Physica A Stat. Mech. Appl. 291(1–4): 439–448
Koza J R, Al-Sakran S H and Jones L W 2005 Cross-domain features of runs of genetic programming used to evolve designs for analog circuits, optical lens systems, controllers, antennas, mechanical systems, and quantum computing circuits. In: Proceedings of NASA/DoD EH, pp. 205–212
Sahin M and Tomak M 2005 The self-consistent calculation of a spherical quantum dot: a quantum genetic algorithm study. Physica E Low Dimens. Syst. Nanostruct. 28(3): 247–256
Spector L, Barnum H, Bernstein H and Swamy J N 1999 Finding a better-than-classical quantum AND/OR algorithm using genetic programming. In: Proceedings of the CEC, pp. 2239–2246
Malossini A, Blanzieri E and Calarco T 2004 QGA: a quantum genetic algorithm. Technical Report No. DIT-04-105, Informatica e Telecommunicazioni, University of Trento
Rylander B, Soule T, Foster J and Alves-Foss J 2000 Quantum genetic algorithms. In: Proceedings of the GECCO, 373–377
Sahin M, Atav U and Tomak M 2005 Quantum genetic algorithm method in self-consistent electronic structure calculations of a quantum dot with many electrons. Int. J. Mod. Phys. C16(9): 1379–1393
Sofge D A 2006 Toward a framework for quantum evolutionary computation. In: Proceedings of the CIS conference, pp. 789–794
Spector L, Barnum H and Bernstein H 1998 Genetic programming for quantum computers. In: Proceedings of the 3rd annual conference on genetic programming, pp. 365–373
Udrescu M, Prodan L and Vladutiu M 2006 Implementing quantum genetic algorithms: a solution based on Grover’s algorithm. In: Proceedings of CF, pp. 14–16
Abs da Cruz A, Hall Barbosa C, Pacheco M and Vellasco M 2004 Quantum-inspired evolutionary algorithms and its application to numerical optimization problems. In: Proceedings of ICONIP 2004, LNCS 3316. Berlin: Springer, pp. 212–217
Abs da Cruz A, Vellasco M and Pacheco M 2006 Quantum-inspired evolutionary algorithm for numerical optimization. In: Proceedings of the CEC, pp. 2630–2637
Han K and Kim J 2000 Genetic quantum algorithm and its application to combinatorial optimization problem. In: Proceedings of the CEC, vol. 2, pp. 1354–1360
Han K and Kim J 2004 Quantum-inspired evolutionary algorithms with a new termination criterion, h-epsilon gate, and two-phase scheme. IEEE Trans. Evolut. Comput. 8(2): 156–169
Liu H, Zhang G, Liu C and Fang C 2008 A novel memetic algorithm based on real-observation quantum inspired evolutionary algorithms. In: Proceedings of ISKE, pp. 486–490
Sailesh Babu G S, Bhagwan Das D and Patvardhan C 2008 Real-parameter quantum evolutionary algorithm for economic load dispatch. IET Gener. Transm. Distrib. 2(1): 22–31
Zhang G X and Rong H N 2007 Real-observation quantum-inspired evolutionary algorithm for a class of numerical optimization problems. In: Lecture notes in computer science, vol. 4490, p. 996
Kumar S 2015 Materialized view selection using randomized and evolutionary algorithms. Ph.D. Thesis, Jawaharlal Nehru University, New Delhi
Vijay Kumar T V and Kumar S 2012 Materialized view selection using simulated annealing. In: Lecture notes in computer science (LNCS). Berlin: Springer, vol. 7678, pp. 168–179
Vijay Kumar T V and Kumar S 2012 Materialized view selection using iterative improvement. Adv. Intell. Syst. Comput. 178: 205–214
Vijay Kumar T V and Kumar S 2015 Materialized view selection using randomized algorithms. Int. J. Bus. Inf. Syst. 19(2): 224–240
Derrac J, García S, Molina D and Herrera F 2011 A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut. Comput. 1(1): 3–18
Arun B and Vijay Kumar T V 2015 Materialized view selection using marriage in honey bees optimization. Int. J. Nat. Comput. Res. 5(3): 1–25
Arun B and Vijay Kumar T V 2015 Materialized view selection using improvement based bee colony optimization. Int. J. Softw. Sci. Comput. Intell. 7(4): 35–61
Vijay Kumar T V and Arun B 2016 Materialized view selection using BCO. Int. J. Bus. Inf. Syst. 22(3): 280–301
Arun B and Vijay Kumar T V 2017 Materialized view selection using artificial bee colony optimization. Int. J. Intell. Inf. Technol. 13(1): 26–49
Arun B and Vijay Kumar T V 2017 Materialized view selection using bumble bee mating optimization. Int. J. Decision Support Syst. Technol. 9(3): 1–27
Vijay Kumar T V and Arun B 2017 Materialized view selection using HBMO. Int. J. Syst. Assur. Eng. Manag. 8(1): 379–392
Kumar A and Vijay Kumar T V 2017 Improved quality view selection for analytical query performance enhancement using particle swarm optimization. Int. J. Reliab. Quality Saf. Eng. 24(6): https://doi.org/10.1142/S0218539317400010
Vijay Kumar T V, Kumar A and Arun B 2017 Cuckoo search based view selection. In: Emerging research in computing, information, communication and applications. Berlin: Springer, pp. 327–337
Kumar A and Vijay Kumar T V 2018 Materialized view selection using set based particle swarm optimization. Int. J. Cogn. Inf. Nat. Intell. 12(3): 18–39
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kumar, S., Vijay Kumar, T.V. A novel quantum-inspired evolutionary view selection algorithm. Sādhanā 43, 166 (2018). https://doi.org/10.1007/s12046-018-0936-5
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s12046-018-0936-5