Graph Compression Storage Based on Spatial Cluster Entity Optimization
Graph storage technology is confronted with an enormous challenge as far as the compact and complex graph-structure data. This phenomenon is derived from social networks with spatially intensive data. Since a hot event can cause the generation of a network cluster, which consists of a massive duplic...
Main Authors: | Dawei Wang, Wanqiu Cui, Biao Qin |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8981901/ |
Similar Items
-
Entity Profiling in Knowledge Graphs
by: Xiang Zhang, et al.
Published: (2020-01-01) -
Named Entity Extraction for Knowledge Graphs: A Literature Overview
by: Tareq Al-Moslmi, et al.
Published: (2020-01-01) -
Collective List-Only Entity Linking: A Graph-Based Approach
by: Weixin Zeng, et al.
Published: (2018-01-01) -
TransET: Knowledge Graph Embedding with Entity Types
by: Peng Wang, et al.
Published: (2021-06-01) -
Matching Descriptions to Spatial Entities Using a Siamese Hierarchical Attention Network
by: Kai Ma, et al.
Published: (2018-01-01)