New Approach based on Association Rules for Building and Optimizing OLAP Cubes on Graphs

4Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

The expansion of data has prompted the creation of various NoSQL (Not only SQL) databases, including graphoriented databases, which provide an understandable abstraction for modeling complex domains and managing highly connected data. However, to add graph data to existing decision support systems, new data warehouse systems that consider the special characteristics of graphs need to be developed. This work proposes a novel method for creating a data warehouse under a graph database and demonstrates how OLAP (Online Analytical Processing) structures created for reporting can be handled by graph databases. Additionally, the paper suggests using aggregation algorithms based association rules techniques to improve the efficiency of reporting and data analysis within a graph-based data warehouse. Finally, we provide a Cypher language implementation of the suggested approach to evaluate and validate our approach.

Cite

CITATION STYLE

APA

Labzioui, R., Letrache, K., & Ramdani, M. (2023). New Approach based on Association Rules for Building and Optimizing OLAP Cubes on Graphs. International Journal of Advanced Computer Science and Applications, 14(7), 997–1008. https://doi.org/10.14569/IJACSA.2023.01407108

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free