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

Dojin Choi; Kyoungsoo Bok; Jaesoo Yoo

JOURNAL ARTICLE

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

Year: 2020 Journal: The Journal of the Korea Contents Association Vol: 20 (8)Pages: 42-53 Publisher: Korea Contents Associaition

Get Full-Text PDF Get Analytical Report

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

Cited By

0.00

FWCI (Field Weighted Citation Impact)

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

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

Metrics

Topics

Related Documents

Efficient continuous subgraph matching scheme considering data reuse

An Efficient Continuous Subgraph Matching Scheme Considering Data Reuse

Top-k subgraph matching query in a large graph

Approximate Subgraph Matching Query over Large Graph

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