2 papers
cs.DB2020
Finding Minimum Connected Subgraphs with Ontology Exploration on Large RDF Data
Xiangnan Ren, Neha Sengupta, Xuguang Ren +2
In this paper, we study the following problem: given a knowledge graph (KG) and a set of input vertices (representing concepts or entities) and edge labels, we aim to find the smal…
cs.DB2019
Fast and Robust Distributed Subgraph Enumeration
Xuguang Ren, Junhu Wang, Wook-Shin Han +1
We study the classic subgraph enumeration problem under distributed settings. Existing solutions either suffer from severe memory crisis or rely on large indexes, which makes them…