go back

Volume 15, No. 12

VINCENT: Towards Efficient Exploratory Subgraph Search in Graph Databases

Authors:
Kai Huang (HKUST)* Qingqing Ye (Hong Kong Polytechnic University) Jing ZHAO (HKUST) Xi Zhao (The Hong Kong University of Science and Technology) Haibo Hu (Hong Kong Polytechnic University) Xiaofang Zhou (Hong Kong University of Sci and Tech)

Abstract

Exploratory search is a search paradigm that plays a vital role in databases, data mining, and information retrieval to assist users to get familiar with the underlying databases. It supports iterative query formulation to explore the data space. Despite its growing importance, exploratory search on graph-structured data has not received adequate attention in the literature. In this paper, we demonstrate a novel system called Vincent that facilitates efficient exploratory subgraph search in a graph database containing a large collection of small- or medium-sized graphs. By automatically generating the content for panels in a GUI and diversified patterns from databases and providing visual result explorer, Vincent supports data-driven visual query formulation, incremental subgraph processing, and efficient query result summarization.

PVLDB is part of the VLDB Endowment Inc.

Privacy Policy