Graphs enriched by cubes for OLAP on bibliographic networks Online publication date: Fri, 06-May-2016
by Wararat Jakawat; Cécile Favre; Sabine Loudcher
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 11, No. 1, 2016
Abstract: With the recent growth of bibliographic data, many research fields work on defining new techniques for their analysis. In this context, data could be represented as heterogeneous networks. In order to analyse information networks in a multidimensional way, online analytical processing (OLAP) may be a relevant solution but it must be adapted for networked data by considering nodes and edges. A first approach that has been proposed in the literature consists in building cubes of graphs. In a different and complementary way, our proposal consists in enriching graphs with cubes. Indeed, the nodes or/and edges of the considered network are described by a cube. It allows interesting analyses for the user who can navigate within a graph enriched by cubes according to different granularity levels, with dedicated operators. We implemented our approach and performed an experimental study on a real dataset to show the interest of our proposal.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Intelligence and Data Mining (IJBIDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook