With big data, the volume of the manipulated data is rapidly growing, we find several business sectors contributing to this expansion such as: (i) the social networks, (ii) the use of the sensors, (iii) the commercial transactions. To integrate this actual reality, the management of small, medium, large business sectors needs analytical applications, such as scalable data warehouse, to answer effectively big and interacted queries. This interaction is exploited in the phase of the physical design of data warehouse using optimizations structure such as the materialized view. Selecting an appropriate set of views to materialize under some resource constraints is known as view selection problem (VSP). In this paper, we propose an approach to solve VSP by profiting the world of multi-query optimization in order to generate the global execution plan integrating new dimensions Big and Interacted Queries, to ensure scalability, we use the clustering technique K-means and operations of refinement in order to capture volume of interacted queries without passing by enumeration of all logical plans of the queries and we use our plan to materialize views. Finally, experiments are conducted to show the scalability of our approach.
GuptaH. and MumickI., Selection of views to materialize under a maintenance cost constraint, In Proceedings of the International Conference on Database Theory (ICDT), Springer, 1999. pp. 453–470.
2.
HarinarayanV.RajaramanA. and UllmanJ., Implementing data cubes efficiently, ACM SIGMOD Record25(2) (1996), 205–216.
3.
MamiI. and BellahseneZ., A survey of view selection methods, ACM SIGMOD Record41(1) (2012), 20–29.
4.
SellisT., Multiple-query optimization, ACM Transactions on Database Systems (TODS)13(1) (1988 March), 23–52.
5.
LiQ. and PengW., An Efficient K-means Clustering Algorithm on MapReduce, In International Conference on Database Systems for Advanced Applications DASFAA, Springer, 2014, pp. 357–371.
6.
RazenH.IbrahimA.PanosK. and NikosM., Evaluating SPARQL Queries on Massive RDF Datasets, In Proceedings of the VLDB Endownement8(12) (2015), 1848–1851.
7.
YangJ.KarlapalemK. and LiQ., Algorithms for materialized view design in data warehousing environment, In Proceedings of the International Conference on Very Large Databases (VLDB), Morgan Kaufmann Publishers Inc., 1997. pp. 136–145.
8.
YangJ.KarlapalemK. and LiQ., A framework for designing materialized views in data ware-housing environment, In Proceedings of IEEE International Conference on Distributed Computing Systems (ICDCS), 1997, pp. 458–465.
9.
RossK.A.SrivastavaD. and SudarshanS., Materialized view maintenance and integrity con-straint checking: Trading space for time, ACM SIGMOD Record25 (1996), 447–458.
10.
RoukhA.BellatrecheL.BoukorcaA. and BouararS., Eco-dmw: Eco-design methodology for data warehouses, ACM DOLAP (2015), 1–10.
11.
GuptaH.I. and MumickS., Selection of views to materialize in a data warehouse, IEEE Trans-actions on Knowledge and Data Engineering17(1) (2005), 24–43.
12.
DaneshpourN. and BarforoushA., Dynamic view management system for query prediction to view materialization, International Journal of Data Warehousing and Mining (IJDWM)7(2) (2011), 67–96.
13.
KotidisY. and RoussopoulosN., Dynamat: a dynamic view management system for data ware-houses, ACM Sigmod record28(2) (1999), 371–382.
14.
KehuaY. and DiasseA., A dynamic materialized view Selection in a Cloud-based Data Ware-house, IJCSI International Journal of Computer Science11(2) (2014), 1694–0814.
15.
MistryH.RoyP.SudarshanS. and RamamrithamK., Materialized view selection and maintenance using multi-query optimization, ACM SIGMOD Record30 (2001), 307–318.
16.
RoyP.SeshadriS.SudarshanS. and BhobeS., Efficient and extensible algorithms for multi query optimization, In Proceedings of the ACM SIGMOD International Conference on Man-agement of Data, ACM, 2000, pp. 249–260.
17.
MamiI.ColettaR. and BellahseneZ., Modeling view selection as a constraint satisfaction problem, In Proceedings of International Conference on Database and Expert Systems Appli-cations (DEXA), Springer, 2011, pp. 396–410.
18.
DerakhshanR.StanticB.KornO. and DehneF., Parallel simulated annealing for materialized view selection in data warehousing environments, In Algorithms and Architectures for Parallel Processing, Springer, 2008. pp. 11–132.
19.
LeW.KementsietsidisA.DuanS. and LiF., Scalable multi-query optimization for sparql, In Proceedings of the International Conference on Data Engineering (ICDE), IEEE, 2012, pp. 666–677.
20.
GoasdouéF.KaranasosK.LeblayJ. and ManolescuI., View selection in semantic web data-bases, In Proceedings of the International Conference on Very Large DataBases (VLDB), 5(2) (2011), pp. 97–108.
21.
KementsietsidisA.CraenF.N. and VansummerenS., Scalable multi-query optimization for exploratory queries over federated scientific databases, VLDB (2008), pp. 16–27.
22.
GuptaH., Selection of views to materialize in a data warehouse, In ICDT, 1997, pp. 98–112.
23.
LeeM. and HammerJ., Speeding up materialized view selection in data warehouses using a randomized algorithm, Int. J. Cooperative Inf. Syst.10(3) (2001), 327–353.
24.
BoukorcaA.BellatrecheL.SenouciS.A.B. and FagetZ., SONIC: scalable multi-query optimization through integrated circuits, In: DeckerH.Lhotsk’aL.LinkS.BaslJ.TjoaA.M. (eds), DEXA 2013, Part I. LNCS, vol. 8055, Springer, Heidelberg, 2013, pp. 278–292.
25.
O’NeilP. and O’NeilB., X.C.: Star schema benchmark, 2009.
26.
KalnisP.MamoulisN. and PapadiasD., View selection using randomized search, Data Knowl. Eng.42(1) (2002), 89–111.
27.
HorngJ.ChangJ.LiuB. and KaoC., Materialized view selection using genetic algorithms in a data warehouse system, In Proceedings of the Congress on Evolutionary Computation (CEC), volume 3. IEEE, 1999.
28.
ZhangC. and YangJ., Genetic algorithm for materialized view selection in data warehouse environments, In DataWarehousing and Knowledge Discovery, Springer, 1999, pp. 116–125.
29.
ZhangC.YaoX. and YangJ., An evolutionary approach to materialized views selection in a data warehouse environment, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews31(3) (2001), 282–294.
30.
BoukorcaA.BellatrecheL. and BenkridS., HYPAD: Hyper-Graph-Driven Approach for Paral-lel Data Warehouse Design, Springer International Publishing Switzerland 2015 G. Wang et al. Eds., ICA3PP 2015, Part IV, LNCS 9531, 2015. pp. 770–783.
31.
RemocorR.EibeF.MarkH.RichardK.PeterR.AlexS. and DavidS., WEKA Manual for Version 3-6-15, University Waikato Hamilton, New Zealand, Edition, 2016.
