PICASSO : exploratory search of connected subgraph substructures in graph databases

• Main Authors: Bhowmick, Sourav Saha, Huang, Kai, Zhou, Shuigeng, Choi, Byron
• Other Authors: School of Computer Science and Engineering
• Format: Article
• Language: English
• Published: 2019
• Subjects: Progressive Query Processor; PICASSO; Engineering::Computer science and engineering
• Online Access: https://hdl.handle.net/10356/105716; http://hdl.handle.net/10220/49545; http://www.vldb.org/pvldb/vol10/p1861-bhowmick.pdf
• Institution: Nanyang Technological University

Recently, exploratory search has received much attention in information retrieval and database fields. This search paradigm assists users who do not have a clear search intent and are unfamiliar with the underlying data space. Specifically , query formulation evolves iteratively as the user becomes more familiar with the content. Despite its growing importance, exploratory search on graph-structured data has received little attention in the literature. We demonstrate a system called picasso to realize exploratory sub-structure search on a graph database containing a set of small or medium-sized data graphs. picasso embodies several novel features such as progressive (i.e., iterative) formulation of queries visually and incremental processing, multi-stream results exploration wall to visualize, explore, and analyze search results to identify possible search directions.