PANDA: A System for Partial Topology-based Search on Large Networks
Summary: PANDA introduces partial topology-based network search, enabling queries as disconnected components rather than a single connected graph. It finds top-k matches for PTQs on a single machine, delivering efficient, topology-agnostic subgraph search for large networks. (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. Miao Xie (Nanyang Technological University)
- 2. Sourav S Bhowmick (Nanyang Technological University)
- 3. Hao Su (Nanyang Technological University)
- 4. Gao Cong (Nanyang Technological University)
- 5. Wook-Shin Han (Pohang University of Science and Technology)
BibTeX Citation
@article{xie_vldb18,
title = {{PANDA: A System for Partial Topology-based Search on Large Networks}},
author = {Xie, Miao and Bhowmick, Sourav S and Su, Hao and Cong, Gao and Han, Wook-Shin},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {12},
pages = {1966--1969},
doi = {10.14778/3229863.3236236},
url = {https://doi.org/10.14778/3229863.3236236},
year = {2018}
}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 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 485 | TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases | 2013 | SIGMOD | 0.00017717377 |
| 4,372 | Schemaless and Structureless Graph Querying | 2014 | VLDB | 6.7384384e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,853 | Efficient Subgraph Search over Large Uncertain Graphs | 2011 | VLDB |
| 2 | 1,803 | Towards Effective Partition Management for Large Graphs | 2012 | SIGMOD |
| 3 | 8,493 | Top-K Nearest Keyword Search on Large Graphs | 2013 | VLDB |
| 4 | 3,522 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB |
| 5 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 6 | 5,370 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 7 | 9,383 | S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics | 2025 | VLDB |
| 8 | 352 | On Graph Query Optimization in Large Networks | 2010 | VLDB |
| 9 | 10,165 | PANDAExpress: A Simpler and Faster PANDA Algorithm | 2026 | PODS |
| 10 | 7,195 | Space-Time Tradeoffs for Conjunctive Queries with Access Patterns | 2023 | PODS |