BOOMER: A Tool for Blending Visual P-Homomorphic Queries on Large Networks
Summary: Boomer blends visual subgraph query formulation with bounded 1-1 p-homomorphic queries on large networks. It extends beyond subgraph isomorphism, enabling interactive, GUI-driven querying with flexible bound-path semantics and strong performance. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yinglong Song (Fudan University; Nanyang Technological University)
- 2. Huey Eng Chua (Nanyang Technological University)
- 3. Sourav S Bhowmick (Nanyang Technological University)
- 4. Byron Choi (Hong Kong Baptist University)
- 5. Shuigeng Zhou (Fudan University)
BibTeX Citation
@inproceedings{song_sigmod20,
title = {{BOOMER: A Tool for Blending Visual P-Homomorphic Queries on Large Networks}},
author = {Song, Yinglong and Chua, Huey Eng and Bhowmick, Sourav S and Choi, Byron and Zhou, Shuigeng},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3384680},
url = {https://dl.acm.org/doi/10.1145/3318464.3384680},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 197 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025584127 |
| 1,148 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00011809728 |
| 2,773 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB | 8.0351713e-05 |
| 6,068 | GBLENDER: Visual Subgraph Query Formulation Meets Query Processing | 2011 | SIGMOD | 5.8972964e-05 |
| 6,811 | BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks | 2018 | SIGMOD | 5.6744946e-05 |
| 7,038 | QUBLE: Blending Visual Subgraph Query Formulation with Query Processing on Large Networks | 2013 | SIGMOD | 5.6154989e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,969 | Periscope/GQ: A Graph Querying Toolkit | 2008 | VLDB |
| 2 | 288 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD |
| 3 | 3,767 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |
| 4 | 8,671 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB |
| 5 | 5,557 | Representing Paths in Graph Database Pattern Matching | 2023 | VLDB |
| 6 | 4,824 | VOGUE: Towards A Visual Interaction-aware Graph Query Processing Framework | 2013 | CIDR |
| 7 | 6,068 | GBLENDER: Visual Subgraph Query Formulation Meets Query Processing | 2011 | SIGMOD |
| 8 | 9,043 | GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases | 2010 | SIGMOD |
| 9 | 7,038 | QUBLE: Blending Visual Subgraph Query Formulation with Query Processing on Large Networks | 2013 | SIGMOD |
| 10 | 6,811 | BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks | 2018 | SIGMOD |