The future is big graphs: a community view on graph processing systems
The future is big graphs: a community view on graph processing systems Page 1 62
COMMUNICATIONS OF THE ACM | SEPTEMBER 2021 | VOL. 64 | NO. 9 contributed articles …
COMMUNICATIONS OF THE ACM | SEPTEMBER 2021 | VOL. 64 | NO. 9 contributed articles …
Research on knowledge graph data management: a survey
王鑫， 邹磊， 王朝坤， 彭鹏， 冯志勇 - Journal of Software, 2019 - jos.org.cn
知识图谱是人工智能的重要基石. 各领域大规模知识图谱的构建和发布对知识图谱数据管理提出
了新的挑战. 以数据模型的结构和操作要素为主线, 对目前的知识图谱数据管理理论, 方法 …
了新的挑战. 以数据模型的结构和操作要素为主线, 对目前的知识图谱数据管理理论, 方法 …
A survey on distributed graph pattern matching in massive graphs
S Bouhenni, S Yahiaoui… - ACM Computing …, 2021 - dl.acm.org
Besides its NP-completeness, the strict constraints of subgraph isomorphism are making it
impractical for graph pattern matching (GPM) in the context of big data. As a result, relaxed …
impractical for graph pattern matching (GPM) in the context of big data. As a result, relaxed …
Answering natural language questions by subgraph matching over knowledge graphs
RDF question/answering (Q/A) allows users to ask questions in natural languages over a
knowledge base represented by RDF. To answer a natural language question, the existing …
knowledge base represented by RDF. To answer a natural language question, the existing …
Efficient subgraph matching by postponing cartesian products
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 …
isomorphic embeddings of a query graph q in a large data graph G. The existing algorithms …
Efficient subgraph matching: Harmonizing dynamic programming, adaptive matching order, and failing set together
Subgraph matching (or subgraph isomorphism) is one of the fundamental problems in graph
analysis. Extensive research has been done to develop practical solutions for subgraph …
analysis. Extensive research has been done to develop practical solutions for subgraph …
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 …
occurrences of q in g and is considered one of the most fundamental query types for many …
Qubit allocation
MY Siraichi, VF Santos, C Collange… - Proceedings of the 2018 …, 2018 - dl.acm.org
In May of 2016, IBM Research has made a quantum processor available in the cloud to the
general public. The possibility of programming an actual quantum device has elicited much …
general public. The possibility of programming an actual quantum device has elicited much …
In-memory subgraph matching: An in-depth study
We study the performance of eight representative in-memory subgraph matching algorithms.
Specifically, we put QuickSI, GraphQL, CFL, CECI, DP-iso, RI and VF2++ in a common …
Specifically, we put QuickSI, GraphQL, CFL, CECI, DP-iso, RI and VF2++ in a common …
Natural language question answering over RDF: a graph data driven approach
RDF question/answering (Q/A) allows users to ask questions in natural languages over a
knowledge base represented by RDF. To answer a national language question, the existing …
knowledge base represented by RDF. To answer a national language question, the existing …