Database Paper Browser

Back to papers

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)

Paper ID
5548
Venue
SIGMOD
Year
2018
Pagerank
4.8792893e-05
Overall Rank
6,971 | 51.51%
DOI
10.1145/3183713.3196902

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
1,924 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00010077055
8,490 A Framework for Privacy Preserving Localized Graph Pattern Query Processing 2023 SIGMOD 4.499438e-05
10,733 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 4.1945683e-05
10,848 Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds 2025 VLDB 4.1945683e-05
11,578 BOOMER: A Tool for Blending Visual P-Homomorphic Queries on Large Networks 2020 SIGMOD 4.1945683e-05
11,659 Answering Why-questions by Exemplars in Attributed Graphs 2019 SIGMOD 4.1945683e-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.

Rank Cited Paper Year Venue Pagerank
260 Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling 2013 SIGMOD 0.00030040036
506 On Graph Query Optimization in Large Networks 2010 VLDB 0.00021475362
690 An Analytical Study of Large SPARQL Query Logs 2018 VLDB 0.00018099792
764 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017018712
919 Distance-Join: Pattern Match Query In a Large Graph Database 2009 VLDB 0.00015343179
1,180 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013456907
1,414 Graph Pattern Matching: From Intractable to Polynomial Time 2010 VLDB 0.00012118275
1,720 Incremental Graph Pattern Matching 2011 SIGMOD 0.00010779343
2,191 Visual Graph Query Construction and Refinement 2017 SIGMOD 9.325575e-05
2,409 TreeSpan: Efficiently Computing Similarity All-Matching 2012 SIGMOD 8.8776858e-05
2,938 Graph Homomorphism Revisited for Graph Matching 2010 VLDB 7.8524059e-05
3,394 Incremental Graph Computations: Doable and Undoable 2017 SIGMOD 7.1480446e-05
3,955 SLQ: A User-friendly Graph Querying System 2014 SIGMOD 6.5910012e-05
5,410 PICASSO: Exploratory Search of Connected Subgraph Substructures in Graph Databases 2017 VLDB 5.5235453e-05
7,775 Graph Querying Meets HCI: State of the Art and Future Directions 2017 SIGMOD 4.653773e-05
8,726 GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases 2010 SIGMOD 4.4593116e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
651 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018648572
2,938 Graph Homomorphism Revisited for Graph Matching 2010 VLDB 7.8524059e-05
5,854 Diversified Top-k Subgraph Querying in a Large Graph 2016 SIGMOD 5.3006473e-05
6,395 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.0829204e-05
4,494 Multi-Query Optimization for Subgraph Isomorphism Search 2017 VLDB 6.1414196e-05
2,428 VOGUE: Towards A Visual Interaction-aware Graph Query Processing Framework 2013 CIDR 8.8367608e-05
6,313 QUBLE: Blending Visual Subgraph Query Formulation with Query Processing on Large Networks 2013 SIGMOD 5.1158493e-05
6,206 GBLENDER: Visual Subgraph Query Formulation Meets Query Processing 2011 SIGMOD 5.1574851e-05
8,726 GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases 2010 SIGMOD 4.4593116e-05
11,578 BOOMER: A Tool for Blending Visual P-Homomorphic Queries on Large Networks 2020 SIGMOD 4.1945683e-05