A space efficient scheme for persistent graph representation

被引：14

作者：

Kontopoulos, Stavros ^{[1
]}

Drakopoulos, Georgios ^{[1
]}

机构：

[1] Univ Patras, Comp Engn & Informat Dept, Patras 26500, Greece

来源：

2014 IEEE 26TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI) | 2014年

关键词：

Graphical models; Complex networks; Graph databases; Persistent graphs; Self-adjusting persistence;

D O I：

10.1109/ICTAI.2014.52

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Graph mining is currently the focus of intense research. Major driving factors include social media, opinion mining, and the schemaless noSQL databases. Time evolving or dynamic graphs are the primary data structures in these fields. Often dynamic graphs must support persistency, meaning that from any given graph state past states can be accessed. Within the graph database context, persistency enables rollback capability, whereas in social media several phenomena such as friend deletion can be modeled. A novel, efficient, and persistent data structure based on tries is proposed. Its potential is displayed by added persistency to the deterministic Kronecker graph model.

引用

页码：299 / 303

页数：5

共 50 条

[41] Vector Space Representation of Concepts Using Wikipedia Graph Structure
Sajadi, Armin
Milios, Evangelos E.
Keselj, Vlado
NATURAL LANGUAGE PROCESSING AND INFORMATION SYSTEMS, NLDB 2017, 2017, 10260 : 393 - 405
[42] A graph representation of subject's time-state space
Ślusarczyk G.
Augustyniak P.
Advances in Intelligent and Soft Computing, 2010, 69 : 379 - 390
[43] PROVG-SEARCHER: A Graph Representation Learning Approach for Efficient Provenance Graph Search
Altinisik, Enes
Deniz, Fatih
Sencar, Husrev Taha
PROCEEDINGS OF THE 2023 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, CCS 2023, 2023, : 2247 - 2261
[44] Efficient and Effective Edge-wise Graph Representation Learning
Wang, Hewen
Yang, Renchi
Huang, Keke
Xiao, Xiaokui
PROCEEDINGS OF THE 29TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2023, 2023, : 2326 - 2336
[45] Memory efficient data structure for graph representation of DSPF netlist
Kim, Jinwook
Park, Hae-seong
Kim, Young Hwan
2014 INTERNATIONAL SOC DESIGN CONFERENCE (ISOCC), 2014, : 292 - 293
[46] Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters
Pommereau, Franck
Devillers, Raymond
Klaudel, Hanna
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 239 : 119 - 129
[47] An efficient graph representation for image retrieval based on color composition
Xirouhakis, Yiannis
Tirakis, Andreas
Delopoulos, Anastasios
Advances in Intelligent Systems and Computer Science, 1999, : 336 - 341
[48] FairMILE: Towards an Efficient Framework for Fair Graph Representation Learning
He, Yuntian
Gurukar, Saket
Parthasarathy, Srinivasan
PROCEEDINGS OF 2023 ACM CONFERENCE ON EQUITY AND ACCESS IN ALGORITHMS, MECHANISMS, AND OPTIMIZATION, EAAMO 2023, 2023,
[49] INK: Knowledge graph representation for efficient and performant rule mining
Steenwinckel, Bram
De Turck, Filip
Ongenae, Femke
SEMANTIC WEB, 2024, 15 (04) : 1367 - 1388
[50] EFFICIENT GRAPH BASED SPATIAL FACE CONTEXT REPRESENTATION AND MATCHING
Chiu, Yi-, I
Li, Congcong
Huang, Chun-Rong
Chung, Pau-Choo
Chen, Tsuhan
2013 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2013, : 2001 - 2005

← 1 2 3 4 5 →