Abstract
The paradigm of interleaving (i.e. blending) visual subgraph query formulation and processing by exploiting the latency offered by the GUI brings in several potential benefits such as superior system response time (SRT) and opportunities to enhance usability of graph databases. Recent efforts at implementing this paradigm are focused on subgraph isomorphism-based queries, which are often restrictive in many real-world graph applications. In this demonstration, we present a novel system called BOOMER to realize this paradigm on more generic but complex bounded 1-1 p-homomorphic(BPH) queries on large networks. Intuitively, a BPH query maps an edge of the query to bounded paths in the data graph. We demonstrate various innovative features of BOOMER, its flexibility, and its promising performance.
| Original language | English |
|---|---|
| Title of host publication | SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data |
| Publisher | Association for Computing Machinery (ACM) |
| Pages | 2685-2688 |
| Number of pages | 4 |
| ISBN (Print) | 9781450367356 |
| DOIs | |
| Publication status | Published - 11 Jun 2020 |
| Event | ACM SIGMOD International Conference on Management of Data, SIGMOD 2020 - Portland, United States Duration: 14 Jun 2020 → 19 Jun 2020 https://dl.acm.org/doi/proceedings/10.1145/3318464 |
Publication series
| Name | Proceedings of the ACM SIGMOD International Conference on Management of Data |
|---|---|
| ISSN (Print) | 0730-8078 |
Conference
| Conference | ACM SIGMOD International Conference on Management of Data, SIGMOD 2020 |
|---|---|
| Country/Territory | United States |
| City | Portland |
| Period | 14/06/20 → 19/06/20 |
| Internet address |
User-Defined Keywords
- blending
- cap index
- graph query results visualization
- p-homomorphic query
- visual graph query formulation