Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
The DOI matches its Crossref record; 28 of the 29 references it cites were found in a registry or an index.
Abstract
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query graph, from a large set of graphs. Considering the problem of testing subgraph isomorphism is generally NP-hard, most of the existing techniques are based on the framework of filtering -and- verification to reduce the precise computation costs; consequently various novel feature-based indexes have been developed. While the existing techniques work well for small query graphs, the verification phase becomes a bottleneck when the query graph size increases. Motivated by this, in the paper we firstly propose a novel and efficient algorithm for testing subgraph isomorphism, QuickSI. Secondly, we develop a new feature-based index technique to accommodate QuickSI in the filtering phase. Our extensive experiments on real and synthetic data demonstrate the efficiency and scalability of the proposed techniques, which significantly improve the existing techniques.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Although there are graph-based approaches that are potentially less vulnerable to such attacks, they are not feasible in practice [24] due to the NP nature of determining subgraph isomorphism [25,29,45].”
From Detecting Automatic Software Plagiarism via Token Sequence Normalization (2024) · cites this paper as [45]
Citations
Cites
(1979) · Cited by 43,841
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277 · cited 4×
“Comparing to the well adopted Ullman’s algorithm [13], QuickSI achieves up to 1-4 orders of magnitude speed-up.”
MethodInfluentialData Structures and Algorithms
(2003) · Series on software engineering and knowledge engineering · doi:10.1142/9789812791245 · Cited by 2,117
gSpan: graph-based substructure pattern mining
Yan, X., & Han, J. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1184038 · Cited by 2,013 · cited 1×
“To overcome this problem, some recent work uses more complex and selective sub-structures as index features, mean-while adopt data mining techniques [15, 19] to improve performance and to reduce index size.”
MethodAn Automatic Method for Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_5 · Cited by 1,988
An Automatic Method of Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (1960) · Econometrica · doi:10.2307/1910129 · Cited by 1,942
Data Structures and Algorithms
Wirth, N. (1984) · Scientific American · doi:10.1038/scientificamerican0984-60 · Cited by 1,418
Proceedings 2001 IEEE International Conference on Data Mining
(2001) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989492 · Cited by 768
Proceedings of the International Conference on Very Large Data Bases
Kerr, D. S. (1975) · ACM eBooks · Cited by 701
Research works printed but not linked: 2
- 10.5555/646514.695831 · doi:10.5555/646514.695831
- 10.5555/2993947.2993981 · doi:10.5555/2993947.2993981
Cited by
Items 401–494 of 494
PIWD: A Plugin-Based Framework for Well-Designed SPARQL
Zhang, X., Song, Z., Feng, Z., & Wang, X. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-50112-3_16
“Existing algorithms mainly focus on finding all embedding in a single large graph, such as ULLmann[31], VF2[18], QUICKSI[28], GraphQL[14], SPath[39], STW[32] and TurboIso[13].”
BackgroundOn querying large scale information networks
Zhao, P. (2012) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Mining and Managing Large-Scale Temporal Graphs
Zong, B. (2015) · eScholarship (California Digital Library)
Leveraging efficient indexing schema to support multigraph query answering
Vijay, I., Ienco, D., & Poncelet, P. (2016) · Ingénierie des systèmes d information · doi:10.3166/isi.21.3.53-74
“Then a recursive subroutine called SUBGRAPHSEARCH is invoked to find all the possible embeddings of the query graph in the data graph (Cordella et al., 2004; Shang et al., 2008; He, Singh, 2008).”
MethodEfficient methods for querying and mining real-world graph data
Zhu, L. (2011) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/53624
Parallel subgraph matching on massive graphs
Suo, B., Li, Z., & Pan, W. (2016) · International Congress on Image and Signal Processing (CISP) · doi:10.1109/cisp-bmei.2016.7853034
“There are several types of graph indices[1], [2], [3], [4], [5], [6], [7], [8], [9] all of which follow a filtering-thensearching operation sequence.”
BackgroundGPU-based commonsense reasoning for real-time query answering and multimodal analysis
Tran, H. N. (2017) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/72092
Optimizing graph query performance by indexing and caching
Wang, J. (2017) · Enlighten: Theses (The University of Glasgow) · doi:10.5525/gla.thesis.8272
A Multifaceted Approach to Improving the Practicality of Structural Graph Algorithms
O’Brien, M. P. (2018) · NCSU Libraries Repository (North Carolina State University Libraries)
On Minimal Unique Induced Subgraph Queries
Jiang, L., Zhao, X. H., Ge, B., Hu, S., Xiao, W., Shang, H., & Jing, Y. (2018) · Applied Sciences · doi:10.3390/app8101798
“In recent years, many algorithms such as GraphGrep [14], VF2 [15], QuickSI [16] and TurboISO [17] have been proposed to solve the problem.”
MethodSelf-citationTowards a taxonomy of subgraph isomorphism algorithms
Rammoko, P., & Marshall, L. (2018) · South African Institute of Computer Scientists and Information Technologists · doi:10.1145/3278681.3278696
“For labeled graphs, if we consider two graphs G1 = (V 1,E1,L1) and G2 = (V 2,E2,L2) then graph G1 is subgraph isomorphic to G2 if there exists an injective function f : G1 → G2 such that: (i) ∀v ∈ V 1, ∃f (v) ∈ V 2,L1(f (v)) = L2(f (v)) (ii) ∀(v,u) ∈ E1,∃(f (v), f (u)) ∈ E2, such that L1(v,u) = L2(f (v), f (u)) [18]”
BackgroundPolynomial Time Subgraph Isomorphism Algorithm for Large and Different Kinds of Graphs
Somkunwar, R. K., & Vaze, V. M. (2018) · Smart innovation, systems and technologies · doi:10.1007/978-981-13-1742-2_44
Efficient $K$-concern Matching in a Large Graph
Gai, L., Li, J., Shang, J., & Wang, X. (2018) · International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) · doi:10.1109/fskd.2018.8687149
“We evaluated four representative state-of-the-art matching algorithms, i.e., QuickSI[14], GraphQL[9], GADDI[20] and SPath[21].”
BackgroundInfluentialNew Subgraph Isomorphism Algorithms: Vertex versus Path-at-a-time MatchingPreprint
Hassaan, M., & Gouda, K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.08819
“QuickSI Algorithm QuickSI [Shang et al. 2008] is a recent subgraph checking algorithm.”
BackgroundAn Efficient Structural Descriptor Sequence to Identify Graph Isomorphism and Graph AutomorphismPreprint
Karunakaran, S., & Selvaganesh, L. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.07394
Adaptive Parallel Subgraph Sampling in Large Complex Networks
Cascais, A. E. N. (2018) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · doi:10.34626/3v7d-pc22
Subgraph Query for Building Service-Based Systems
Wu, J., Guo, X. L., Yang, G., Wu, S., Hassan, H., & Wu, J. (2019) · IEEE Access · doi:10.1109/access.2019.2927107
“Of course, other algorithms that outperform VF2, such as QuickSI [49], GraphQL [50], GADDI [51], SPath [52], etc.”
MethodTrade-offs Computing Minimum Hub Cover toward Optimized Labeled Graph Query Processing
Yelbay, B., Birbil, Ş. İ., Bülbül, K., & Jamil, H. M. (2018) · AJIT-e Academic Journal of Information Technology · doi:10.5824/1309-1581.2018.3.002.x
“Techniques such as GraphQL [3], QuickSI [4] and earlier research such as VFLib [5] and Ullmann [6] fall in the former category while TALE [7], and SAPPER [8] are representative of the latter.”
Any-k evaluation of conjunctive queries and its application to graph pattern matching
Yang, X. (2019) · Digital Repository Service (Northeastern University) · doi:10.17760/d20316246
Fast Graph Query Processing Algorithms Using Dynamic Programming
김현준 (2020) · Seoul National University Open Repository (Seoul National University)
An Efficient Graph Mining System for Large Patterns.Preprint
Jiang, P., Wang, R., & Wu, B. (2021) · arXiv (Cornell University)
HLMA: An Efficient Subgraph Matching Algorithm
Dai, G., Xu, B., & Yin, H. (2020)
Path Index-Enhanced Incremental Subgraph Matching Algorithm for Dynamic Graph
Sun, Y., Li, G., Ning, B., & Han, B. (2021) · Lecture notes in electrical engineering · doi:10.1007/978-981-15-8411-4_247
Mathematical programming models based on hub covers in graph query processing
Yelbay, B., Birbil, Ş. İ., & Bülbül, K. (2017) · Sabanci University
Declarative cleaning, analysis, and querying of graph-structured data
Deshpande, A., Getoor, L. C., & Moustafa, W. E. (2013) · University Libraries (University of Maryland)
(2019) · International Journal of Recent Technology and Engineering (IJRTE) · doi:10.35940/ijrte.b1068.0882s819
A Scalable Graph-Coarsening Based Index for Dynamic Graph Databases
Kansal, A. (2017) · ScholarWorks (Boise State University) · doi:10.18122/b2042r
Storage, processing and analysis of large evolving graphs
Semertzidis, K. (2018) · doi:10.12681/eadd/44986
Isolate-Set-Based In-Memory Parallel Subgraph Matching Framework
Qie, H., & Dou, Y. (2022) · doi:10.1145/3569966.3570004
Efficient Subhypergraph Containment Queries on Hypergraph Databases
Su, Y., Song, Y., Li, X., Li, F., & Gu, Y. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20309-1_44
Subgraph Search over Neural-Symbolic Graphs
Yuan, Y., Ma, D., Wu, A., & Qin, J. (2023) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3539618.3591773
“In the first category, the symbolic methods include the classical backtrack search [5, 16, 17, 30, 40], especially determining the optimal search order by the dynamic programming; and the encoding and indexing techniques [2, 19, 28, 36, 42, 45] for which the nodes within a distance of each node are encoded as signatur…”
MethodA Neighborhood Encoding for Subgraph Queries in Graph Databases
Nabti, C. E., Mecharnia, T., Boukhetta, S. E., Amrouche, K., & Seba, H. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-39847-6_30
GERNS: A Graph Embedding with Repeat-Free Neighborhood Structure for Subgraph Matching Optimization
Chang, Y., Wang, T., Tian, C., Zhan, D., Chen, C., Wu, X., Liu, C., Tong, E., & Niu, W. (2023) · Communications in computer and information science · doi:10.1007/978-981-99-7224-1_14
Ansari, Z. A., Abulaish, M., Thoker, I. R., & Jahiruddin (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2312.02988
“…to address the problem subgraph isomorphism finding in [Ullmann(1976 CFL-Match [Bi et al.(2016)Bi, Chang, Lin, Qin, and Zhang], Sum ISO [Nabti and Seba(2017)], QuickSI [Shang et al.(2008)Shang, Zhang, Lin, and Yu], Turbo ISO [Han et al.(2013)Han, Lee, and Lee], and BoostIso [Ren and Wang(2015)].”
BackgroundMethodInfluentialFrequent Itemset Mining in the Graph Data Field
邱, 文. (2024) · Computer Science and Application · doi:10.12677/csa.2024.141017
Subgraph Matching of Spatiotemporal RDF Data
(2023) · Advances in systems analysis, software engineering, and high performance computing book series · doi:10.4018/978-1-6684-9108-9.ch006
Uncertainty-Aware Efficient Subgraph Isomorphism Using Graph TopologyPreprint
Kusari, A., & Sun, W. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4826330
Agbeto, W., Coti, C., & Reinharz, V. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.02.28.640915
“Finally, Section IV presents the experimental results.”
Periodic Subgraph Matching on Temporal Graphs
Lu, M., Zang, Y., Zhang, Q., & Zhu, X. (2025) · World Conference on Computing and Communication Technologies (WCCCT) · doi:10.1109/wccct65447.2025.11027964
M2M: Subgraph Matching Based on Minimum Spanning Tree and Candidate GraphPreprint
Ma, H., Xu, M. Z., Chen, Y., Zhao, Y., & Yu, C. (2025) · Research Square · doi:10.21203/rs.3.rs-6502762/v1
PSC‐SBFL: Combining PSC With SBFL to Improve Software Fault Localization
Guo, Z., Ji, S., Xu, X., & Chen, X. (2025) · Software Testing Verification and Reliability · doi:10.1002/stvr.70007
“One such algorithm is QuickSI [34], which compares graphs by defining feature labels for nodes and edges and incorporating these labels into the matching process.”
A Dynamic Multi-hop Attention Integrated Graph Neural Network for Subgraph Matching
Zhang, S., Liu, Y., Qu, Y., & Wu, J. (2025) · International Symposium on Visual Information Communication and Interaction (VINCI) · doi:10.1145/3769534.3769546
アライ, ジ., & 新井, 淳. (2019) · Institutional Repositories DataBase (IRDB) · doi:10.18910/72597
Graph database, and its tale on uncertainty
Zhu, K. (2013) · UNSWorks (University of New South Wales, Sydney, Australia) · doi:10.26190/unsworks/16195
Duong, C. T. (2022) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-thesis-8046
Cohesive subgraph computation over large heterogeneous information networks
Yang, Y. (2021) · UNSWorks (UNSW Sydney) · doi:10.26190/unsworks/2382
Efficient algorithms for graph substructure search
Shang, H. (2011) · UNSWorks (UNSW Sydney) · doi:10.26190/unsworks/23811
Self-citationAdvancements in equivalence checking for abstract argumentation frameworks
Bellositz, P. (2018) · reposiTUm (TU Wien) · doi:10.34726/hss.2018.52528
Efficient processing of advanced structural queries in graph databases
Zhao, X. (2014) · UNSWorks (UNSW Sydney) · doi:10.26190/unsworks/16609
Efficient and Scalable Graph Pattern Matching on Massive Graphs
Yang, Z. (2022) · UNSWorks (University of New South Wales, Sydney, Australia) · doi:10.26190/unsworks/24590
Evaluating Temporal Queries over Videos
Chen, Y. (2023) · YorkSpace (York University)
Subgraph Isomorphism Search with Multi-Query Optimization on GPUs
Rowe, B. (2024) · eScholarship (California Digital Library)
On efficient temporal subgraph query processing
Zhu, K. (2021) · TU/e Research Portal
Yang, D. (2023) · eScholarship (California Digital Library)
High performance DFS-based subgraph enumeration on GPUs
Dodeja, V. (2021) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Neural Graph Navigation for Intelligent Subgraph MatchingPreprint
Ying, Y., Dai, Y., Li, W., Huang, W., Wang, R., Zheng, T., Wang, Y., Yuan, H., & Song, M. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2511.17939
“Section A.1 demonstrates that the NeuGN-enhanced enumerator outputs exactly the same match set as any sound-and-complete base-line searcher (e.g., QSI, GQL, VF3, CECI, etc.) whose pruning routine obeys the standard safe–pruning requirement: no candidate that could still be extended to a full match is discarded before…”
InfluentialA customizable inexact subgraph matching algorithm for attributed graphsPreprint
Benko, T., Jones, R., & Tate, L. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2512.04280
“Many exact graph matching algorithms used today are based on Ullmann’s algorithm [18], [19], [20], [4], [21], [22], each with additional novel approaches for reducing the search space.”
PISCES:Push-Pull Hybrid Optimization for Graph Pattern Matching
Xu, C. J., Meng, K., Lin, Z., & Tan, G. T. (2025) · Proceedings of the International Conference on Parallel Processing · doi:10.1145/3754598.3754650
NaviMap: Partial Order-Guided Neural Architecture via Deep Q-Networks for Efficient CGRA Mapping
Kou, M., Zeng, J., Peng, X., Ji, W., & Yao, H. (2025) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd65941.2025.00059
Algorithmic and Learning-based Approaches to Subgraph Matching and Counting: A SurveyPreprint
Li, R., Wang, H., Zhang, Y., & Zhang, W. (2026) · doi:10.36227/techrxiv.176739510.09317820/v1
Self-citationInformation-Theoretic Limits on Exact Subgraph Alignment ProblemPreprint
Shiu, C. H. M., Cheng, H. V., & Wang, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2601.05173
“Several influential works, including efficient heuristics and algorithms such as QuickSI [37], GraphQL [38], have been developed to address subgraph alignment tasks in real-life applications.”
RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement LearningPreprint
Huang, W., Wang, H., Wen, D., Cao, X., Han, B., Zhang, Y., & Zhang, W. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2601.12416
“Later on, several in-memory subgraph counting methods have been proposed with backtracking technique as summarized in [29], such as VF3 [3], QuickSI [28] and GraphQL [12].”
Self-citationPrivacy-preserving graph similarity search with attribute-based access control
Khan, S., Khan, S., Si, W., & Javad, B. (2026) · Cybersecurity · doi:10.1186/s42400-025-00457-3
“Several algorithms (e.g, Quick SI Shang et al. 2008, VF2 Cordella et al. 2004 and Turbo iso (Han et al. 2013)) have been proposed to enhanced the Ull-mann (1976) algorithm.”
Accelerating Subgraph Matching Using Isolated Vertices and BFS Data Structures
Zhang, G., Ning, B., & Zhou, X. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-6426-2_25
Sub-graph isomorphism queries in large fuzzy spatiotemporal RDF graphs
Bai, L., Di, X., Wang, J., Lu, J., & Li, Q. (2026) · Knowledge-Based Systems · doi:10.1016/j.knosys.2026.115768
Funamoto, N., & Inokuchi, A. (2026) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2025edp7212
Big Graph Processing : Partitioning and Aggregated Querying
Echbarthi, G. (2017) · theses.fr (ABES) · doi:10.70675/86232303z95bdz4ed5z8588z134c4f36c4ac
“Interested readers are directed to [100, 118, 119] and references therein for a survey on graph indexing methods and other filtering and verification graph querying methods.”
BackgroundShi, M., Peng, P., Xiao, X., Zou, L., Li, K., & Zhou, X. (2026) · Proceedings of the ACM on Management of Data · doi:10.1145/3786685
“For example, QuikSI [6] orders matches by weighting query edges by label frequency, while RI [37] repeatedly selects the highest-degree vertex.”
LIVE: Learnable Monotonic Vertex Embedding for Efficient Exact Subgraph Matching (Technical Report)Preprint
Ye, Y., Ren, W., Liu, Y., Yan, M., Wang, R., Sun, L., Li, J., & Yu, P. S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.19116
Mitigating Automated Obfuscation Attacks on Software Plagiarism Detection Systems
Sağlam, T. (2026) · OAPEN (The OAPEN Foundation) · doi:10.5445/ksp/1000185090
Efficient Subgraph Matching with Adaptive Filtering and Core-Set Prioritization
Xiao, H., & Chen, Z. (2026) · Communications in computer and information science · doi:10.1007/978-981-95-7996-9_5
Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability BoundsPreprint
Wang, Z., & Ying, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.12879
Memory Efficient Very-Large Colored Subgraph Detection
Tsentsiper, S., Siminovsky, D., & Louzoun, Y. (2026) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2026.3705310
“(cid:2) Optimal Vertex Ordering: The heuristic-based ordering not only improves computational efficiency but also allows VELCRO to dynamically adapt to the structure of the input graph, addressing limitations in fixed ordering strategies used in QuickSI [26].”
TopoMatch: A Hierarchy-Aware Subgraph Matching Framework for Efficient Circuit Pattern Recognition
Kong, L., Mao, J., Wang, Y., Zhang, Z., & Wang, L. (2025) · doi:10.1109/iccs66653.2025.11569657
Guo, Q., Yang, J., Zhang, W., Wang, H., Zhang, Y., & Lin, X. (2026) · Proceedings of the ACM on Management of Data · doi:10.1145/3837094
Self-citationCEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination
Yang, L., Su, X., Zou, L., Gou, X., & Lin, Y. (2026) · Proceedings of the VLDB Endowment · doi:10.14778/3801059.3801070
LG-Index: Learning-based graph indexing for subgraph queries
Yang, B., Zou, Z., & Ye, J. (2026) · Information Sciences · doi:10.1016/j.ins.2026.123913
LISA: A Label-Aware In-Place Scheduling Algorithm for High-Throughput Exact Subgraph Isomorphism
Fang, L. (2026) · Lecture notes in electrical engineering · doi:10.1007/978-981-92-0779-4_2
Counterfactual Analysis on Large Graphs
Chen, H.-W., Pei, J., Yang, D.-N., & Chen⋆, M.-S. (2026) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3770855.3817647
Efficient Multi-Query Optimization for Continuous Subgraph Matching Over Streaming Graphs
Ma, Z., Ma, X., Yang, J., Yang, L., Yin, L., & Lin, X. (2026) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2026.3721816
“According to the widely adopted matching cost model [28], [57], [59], the matching cost is determined by the vertex matching order.”
Self-citationShareFlow: An Efficient Framework for Multi-Query Continuous Subgraph Matching
Yuan, P., Feng, Z., Xu, R., Li, K., Mao, R., & Tang, B. (2026) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde65706.2026.00204
Runtime and compilation optimizations for GPU-based subgraph matching
Wei, Y. (2026) · Iowa Research Online (The University of Iowa) · doi:10.25820/etd.008420
Subgraph Enumeration: Beyond Tree Decomposition
Li, Q., Yu, J. X., & He, Z. (2026) · Proceedings of the VLDB Endowment · doi:10.14778/3819518.3819552
Self-citationEfficient GPU-Based Continuous Subgraph Matching on Batch Updates
Li, G., Sun, X., Luo, Q., & Chang, L. (2026) · Lecture notes in computer science · doi:10.1007/978-981-92-5693-8_31
Embracing Complexity for Integrative Multi-Omics Approaches in Life Sciences
Licheri, N. (n.d.) · Institutional Research Information System University of Turin (University of Turin)
Enhancements in high performance subgraph enumeration on graphics processors
Kawtikwar, S. (2022) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
PPG: a public-private graph evaluation framework for efficient querying and analysis
Jiang, J., Zhan, J., Xu, L., Choi, B. K. K., Wang, Q., Liu, N., He, B., & Xu, J. (2026) · The VLDB Journal · doi:10.1007/s00778-026-00991-7
Graph Structured Data Security using Trusted Third Party Query Process in Cloud Computing
Prakash, G., Prateek, M., & Singh, I. (2015) · International Journal of Computer Network and Information Security · doi:10.5815/ijcnis.2015.07.04
“To reduce these overheads during searching process, there are many graph filtering and verification methods are introduced [2], [3].”
BackgroundMethodInfluentialData Engineering in Graph Databases
Choi, B. K. K., Hu, H., Xu, J., Cheung, W. K., Li, C.-H., & Liu, J. (2010) · Lecture notes in electrical engineering · doi:10.1007/978-90-481-9794-1_26
Metadata
- Authors
- Shang, H., Zhang, Y., Lin, X., & Yu, J. X.
- Affiliations
- UNSW Sydney (AU)
- Chinese University of Hong Kong (HK)
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2008-08
- Volume
- 1
- Issue
- 1
- Pages
- 364-375
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2140840007
- Cited by
- 401
- References
- 29
- Citations by year
- 2026: 13 · 2025: 29 · 2024: 32 · 2023: 22 · 2022: 28 · 2021: 38 · 2020: 25 · 2019: 27 · 2018: 24 · 2017: 24 · 2016: 23 · 2015: 24 · 2014: 18 · 2013: 15 · 2012: 23
- FWCI
- 17.28
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Proceedings of the VLDB Endowment (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Keywords
- subgraph isomorphism, graph retrieval, NP-hardness, scalability, query graph
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.