Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/8317
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGoyal, S.-
dc.contributor.authorBindu, P.V.-
dc.contributor.authorSanthi Thilagam, P.-
dc.date.accessioned2020-03-30T10:18:24Z-
dc.date.available2020-03-30T10:18:24Z-
dc.date.issued2017-
dc.identifier.citationProceedings - 2016 2nd IEEE International Conference on Research in Computational Intelligence and Communication Networks, ICRCICN 2016, 2017, Vol., , pp.163-168en_US
dc.identifier.urihttps://idr.nitk.ac.in/jspui/handle/123456789/8317-
dc.description.abstractGraphs are ubiquitous and are the best data structure for representing linked data because of their flexibility, scalability, and power to deal with complexity. Storing big graphs in graph databases leads to difficult computation and increased time complexity. The best alternative is to use inmemory representations such as compact data structures. They compress the graph sufficiently such that it can be stored in memory and can allow all the possible operations in compressed form itself. In this paper we discuss about five compression techniques: WebGraph, Re-pair, BFS, k2, and dk2. In addition, we compare them based on four parameters: compression ratio, supported functionalities, supported graph types, and dynamic support. The paper is concluded by bringing out the need to have a more advanced, dynamic, and versatile compression technique. � 2016 IEEE.en_US
dc.titleIn-memory representations for mining big graphsen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.