BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks
Summary: Boomer blends visual, interactive formulation of bounded 1-1 p-hom queries with online processing via a novel cap index. Cap index supports immediate and deferment-based construction, enabling interleaved refinement and processing; experiments on real networks show efficiency. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
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_sigmod18,
title = {{BOOMER: Blending Visual Formulation and Processing of 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} '18},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3183713.3196902},
url = {https://dl.acm.org/doi/10.1145/3183713.3196902},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,180 | In-Memory Subgraph Matching: An In-depth Study | 2020 | SIGMOD | 0.00011627669 |
| 7,573 | A Framework for Privacy Preserving Localized Graph Pattern Query Processing | 2023 | SIGMOD | 5.4934674e-05 |
| 8,891 | Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds | 2025 | VLDB | 5.2559789e-05 |
| 9,361 | Subgraph Matching: A New Decomposition Based Approach | 2025 | VLDB | 5.1868213e-05 |
| 12,076 | BOOMER: A Tool for Blending Visual P-Homomorphic Queries on Large Networks | 2020 | SIGMOD | 4.9793485e-05 |
| 12,154 | Answering Why-questions by Exemplars in Attributed Graphs | 2019 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 16 of 16 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 355 | On Graph Query Optimization in Large Networks | 2010 | VLDB |
| 2 | 10,495 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 3 | 5,477 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 4 | 5,984 | An In-Depth Study of Continuous Subgraph Matching | 2022 | VLDB |
| 5 | 3,767 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |
| 6 | 4,824 | VOGUE: Towards A Visual Interaction-aware Graph Query Processing Framework | 2013 | CIDR |
| 7 | 7,038 | QUBLE: Blending Visual Subgraph Query Formulation with Query Processing on Large Networks | 2013 | SIGMOD |
| 8 | 6,068 | GBLENDER: Visual Subgraph Query Formulation Meets Query Processing | 2011 | SIGMOD |
| 9 | 9,043 | GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases | 2010 | SIGMOD |
| 10 | 12,076 | BOOMER: A Tool for Blending Visual P-Homomorphic Queries on Large Networks | 2020 | SIGMOD |