An efficient graph data compression model based on the germ quotient set structure  

作　　者：Dawei WANG Wanqiu CUI 

机构地区：[1]Regional Innovation and Development Research Center,Institute of Scientific and Technical Information of China,Beijing,100038,China [2]School of National Security,People’s Public Security University of China,Beijing,100038,China

出　　处：《Frontiers of Computer Science》2022年第6期195-197,共3页中国计算机科学前沿（英文版）

基　　金：supported by the ISTIC Innovation Research Foundation (QN2022-05);by the National Natural Science Foundation of China (NSFC) (Grant No.72074201);sponsored by the National Social Science Foundation of China (NSSFC) (21CTQ039).

摘　　要：1 Introduction The graph data model is a crucial foundation of the graph database and has been extensively applied with relational data,such as knowledge graphs,etc.Social networks[1]trigger the discussion of a lot of hot topics,which leads to a proliferation of highly repetitivedata.Therefore,how to design a graph data compression model is key to effectively storing dense graphs[2].

关 键 词：QUOTIENT GRAPHS STRUCTURE 

分 类 号：O15[理学—数学]