PICASSO : exploratory search of connected subgraph substructures in graph databases
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...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/105716 http://hdl.handle.net/10220/49545 http://www.vldb.org/pvldb/vol10/p1861-bhowmick.pdf |
| _version_ | 1826119051976376320 |
|---|---|
| author | Bhowmick, Sourav Saha Huang, Kai Zhou, Shuigeng Choi, Byron |
| author2 | School of Computer Science and Engineering |
| author_facet | School of Computer Science and Engineering Bhowmick, Sourav Saha Huang, Kai Zhou, Shuigeng Choi, Byron |
| author_sort | Bhowmick, Sourav Saha |
| collection | NTU |
| description | 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. |
| first_indexed | 2024-10-01T04:53:44Z |
| format | Journal Article |
| id | ntu-10356/105716 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T04:53:44Z |
| publishDate | 2019 |
| record_format | dspace |
| spelling | ntu-10356/1057162020-09-14T01:52:10Z PICASSO : exploratory search of connected subgraph substructures in graph databases Bhowmick, Sourav Saha Huang, Kai Zhou, Shuigeng Choi, Byron School of Computer Science and Engineering Progressive Query Processor PICASSO Engineering::Computer science and engineering 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. MOE (Min. of Education, S’pore) Published version 2019-08-06T02:13:13Z 2019-12-06T21:56:29Z 2019-08-06T02:13:13Z 2019-12-06T21:56:29Z 2017 Journal Article Huang, K., Bhowmick, S. S., Zhou, S. & Choi, B. (2017). PICASSO : exploratory search of connected subgraph substructures in graph databases. Proceedings of the VLDB Endowment, 10(12), 1861-1864. 2150-8097 https://hdl.handle.net/10356/105716 http://hdl.handle.net/10220/49545 http://www.vldb.org/pvldb/vol10/p1861-bhowmick.pdf en Proceedings of the VLDB Endowment © 2017 VLDB Endowment. This work is licensed under the Creative Commons AttributionNonCommercial-NoDerivatives 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-nd/4.0/. For any use beyond those covered by this license, obtain permission by emailing info@vldb.org. 4 p. application/pdf |
| spellingShingle | Progressive Query Processor PICASSO Engineering::Computer science and engineering Bhowmick, Sourav Saha Huang, Kai Zhou, Shuigeng Choi, Byron PICASSO : exploratory search of connected subgraph substructures in graph databases |
| title | PICASSO : exploratory search of connected subgraph substructures in graph databases |
| title_full | PICASSO : exploratory search of connected subgraph substructures in graph databases |
| title_fullStr | PICASSO : exploratory search of connected subgraph substructures in graph databases |
| title_full_unstemmed | PICASSO : exploratory search of connected subgraph substructures in graph databases |
| title_short | PICASSO : exploratory search of connected subgraph substructures in graph databases |
| title_sort | picasso exploratory search of connected subgraph substructures in graph databases |
| topic | Progressive Query Processor PICASSO Engineering::Computer science and engineering |
| url | https://hdl.handle.net/10356/105716 http://hdl.handle.net/10220/49545 http://www.vldb.org/pvldb/vol10/p1861-bhowmick.pdf |
| work_keys_str_mv | AT bhowmicksouravsaha picassoexploratorysearchofconnectedsubgraphsubstructuresingraphdatabases AT huangkai picassoexploratorysearchofconnectedsubgraphsubstructuresingraphdatabases AT zhoushuigeng picassoexploratorysearchofconnectedsubgraphsubstructuresingraphdatabases AT choibyron picassoexploratorysearchofconnectedsubgraphsubstructuresingraphdatabases |