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 an 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 gui and diversified patterns from databases and providing a visual result explorer, Vincent supports data-driven visual query formulation, incremental subgraph processing, and efficient query result summarization.
| Original language | English |
|---|---|
| Pages (from-to) | 3634-3637 |
| Number of pages | 4 |
| Journal | Proceedings of the VLDB Endowment |
| Volume | 15 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - Aug 2022 |
| Event | 48th International Conference on Very Large Data Bases, VLDB 2022 - Sydney, Australia Duration: 5 Sept 2022 → 9 Sept 2022 |
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- General Computer Science
Fingerprint
Dive into the research topics of 'VINCENT: Towards Efficient Exploratory Subgraph Search in Graph Databases'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver