Distributed Subgraph Query Processing Using Filtering Scores on Spark
As various services have been generating large-scale graphs to represent multiple relationships between objects, studies have been conducted to obtain subgraphs with particular patterns. In this paper, we propose a distributed query processing method to efficiently search a subgraph for a large grap...
Main Authors: | Kyoungsoo Bok, Minyoung Kim, Hyeonbyeong Lee, Dojin Choi, Jongtae Lim, Jaesoo Yoo |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-08-01
|
Series: | Electronics |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-9292/12/17/3645 |
Similar Items
-
Efficient Continuous Subgraph Matching Scheme Based on Trie Indexing for Graph Stream Processing
by: Dojin Choi, et al.
Published: (2023-04-01) -
In-Memory Caching for Enhancing Subgraph Accessibility
by: Kyoungsoo Bok, et al.
Published: (2020-08-01) -
Detecting Incremental Frequent Subgraph Patterns in IoT Environments
by: Kyoungsoo Bok, et al.
Published: (2018-11-01) -
An Efficient Distributed SPARQL Query Processing Scheme Considering Communication Costs in Spark Environments
by: Jongtae Lim, et al.
Published: (2021-12-01) -
Spatiotemporal RDF Data Query Based on Subgraph Matching
by: Xiangfu Meng, et al.
Published: (2021-12-01)