Research on knowledge graph data management: a survey

王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇 - Journal of Software, 2019 - jos.org.cn
知识图谱是人工智能的重要基石. 各领域大规模知识图谱的构建和发布对知识图谱数据管理提出
了新的挑战. 以数据模型的结构和操作要素为主线, 对目前的知识图谱数据管理理论, 方法 …

Graph-based text representation and matching: A review of the state of the art and future challenges

AH Osman, OM Barukub - IEEE Access, 2020 - ieeexplore.ieee.org
Graph-based text representation is one of the important preprocessing steps in data and text
mining, Natural Language Processing (NLP), and information retrieval approaches. The …

A correlation-based feature weighting filter for naive Bayes

L Jiang, L Zhang, C Li, J Wu - IEEE transactions on knowledge …, 2018 - ieeexplore.ieee.org
Due to its simplicity, efficiency, and efficacy, naive Bayes (NB) has continued to be one of the
top 10 algorithms in the data mining and machine learning community. Of numerous …

Efficient subgraph matching by postponing cartesian products

F Bi, L Chang, X Lin, L Qin, W Zhang - Proceedings of the 2016 …, 2016 - dl.acm.org
In this paper, we study the problem of subgraph matching that extracts all subgraph
isomorphic embeddings of a query graph q in a large data graph G. The existing algorithms …

Turboiso towards ultrafast and robust subgraph isomorphism search in large graph databases

WS Han, J Lee, JH Lee - Proceedings of the 2013 ACM SIGMOD …, 2013 - dl.acm.org
Given a query graph q and a data graph g, the subgraph isomorphism search finds all
occurrences of q in g and is considered one of the most fundamental query types for many …

Summarizing semantic graphs: a survey

Š Čebirić, F Goasdoué, H Kondylakis, D Kotzinos… - The VLDB journal, 2019 - Springer
The explosion in the amount of the available RDF data has lead to the need to explore,
query and understand such data sources. Due to the complex structure of RDF graphs and …

An in-depth comparison of subgraph isomorphism algorithms in graph databases

J Lee, WS Han, R Kasperovics, JH Lee - Proceedings of the VLDB …, 2012 - dl.acm.org
Finding subgraph isomorphisms is an important problem in many applications which deal
with data modeled as graphs. While this problem is NP-hard, in recent years, many …

On graph query optimization in large networks

P Zhao, J Han - Proceedings of the VLDB Endowment, 2010 - dl.acm.org
The dramatic proliferation of sophisticated networks has resulted in a growing need for
supporting effective querying and mining methods over such large-scale graph-structured …

Comparing stars: On approximating graph edit distance

Z Zeng, AKH Tung, J Wang, J Feng… - Proceedings of the VLDB …, 2009 - dl.acm.org
Graph data have become ubiquitous and manipulating them based on similarity is essential
for many applications. Graph edit distance is one of the most widely accepted measures to …

Graphs-at-a-time: query language and access methods for graph databases

H He, AK Singh - Proceedings of the 2008 ACM SIGMOD international …, 2008 - dl.acm.org
With the prevalence of graph data in a variety of domains, there is an increasing need for a
language to query and manipulate graphs with heterogeneous attributes and structures. We …