JOURNAL ARTICLE

Approximate Top-k Subgraph Matching Scheme Considering Data Reuse in Large Graph Stream Environments

Dojin ChoiKyoungsoo BokJaesoo Yoo

Year: 2020 Journal:   The Journal of the Korea Contents Association Vol: 20 (8)Pages: 42-53   Publisher: Korea Contents Associaition
Keywords:
Reuse Computer science Graph Scheme (mathematics) Matching (statistics) Parallel computing Factor-critical graph Theoretical computer science Distributed computing Mathematics Engineering Line graph Statistics

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
0.12
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Network Packet Processing and Optimization
Physical Sciences →  Computer Science →  Hardware and Architecture
Graph Theory and Algorithms
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition
Advanced Graph Neural Networks
Physical Sciences →  Computer Science →  Artificial Intelligence

Related Documents

JOURNAL ARTICLE

Efficient continuous subgraph matching scheme considering data reuse

Dojin ChoiHyeonbyeong LeeJongtae LimKyoungsoo BokJaesoo Yoo

Journal:   Knowledge-Based Systems Year: 2023 Vol: 282 Pages: 111120-111120
JOURNAL ARTICLE

An Efficient Continuous Subgraph Matching Scheme Considering Data Reuse

Dojin ChoiKyoungsoo BokJae-Soo Yoo

Journal:   Journal of KIISE Year: 2019 Vol: 46 (8)Pages: 842-851
BOOK-CHAPTER

Approximate Subgraph Matching Query over Large Graph

Yu ZhaoChunhong ZhangTingting SunYang JiZheng HuXiaofeng Qiu

Lecture notes in computer science Year: 2016 Pages: 247-256
JOURNAL ARTICLE

Approximate Sub-Graph Matching Scheme for Large-Scale Graph Data in Spark Environments

Jongtae LimDojin ChoiDongmin SeoSeok Jong YuKyoungsoo BokJaesoo Yoo

Journal:   KIISE Transactions on Computing Practices Year: 2018 Vol: 24 (9)Pages: 463-469
© 2026 ScienceGate Book Chapters — All rights reserved.