BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification
- Authors
- Choi, Yunyoung; Park, Kunsoo; Kim, Hyunjoon
- Issue Date
- May-2023
- Publisher
- ASSOC COMPUTING MACHINERY
- Citation
- PROCEEDINGS OF THE VLDB ENDOWMENT, v.16, no.9, pp.2186 - 2198
- Indexed
- SCIE
SCOPUS
- Journal Title
- PROCEEDINGS OF THE VLDB ENDOWMENT
- Volume
- 16
- Number
- 9
- Start Page
- 2186
- End Page
- 2198
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/189678
- DOI
- 10.14778/3598581.3598591
- ISSN
- 2150-8097
- Abstract
- Subgraph matching is the problem of searching for all embeddings of a query graph in a data graph, and subgraph query processing (also known as subgraph search) is to find all the data graphs that contain a query graph as subgraphs. Extensive research has been done to develop practical solutions for both problems. However, the existing solutions still show limited query processing time due to a lot of unnecessary computations in search. In this paper, we focus on exploring as compact search space as possible by using three techniques: (1) pruning by bipartite matching, (2) pruning by failing sets with bipartite matching Abstr(3) cell-wide verifica- tion. We propose a new algorithm Bid, hich combines these three techniques. We conduct extensive periments on real-world datasets as well as synthetic datasets to evaluate the effectiveness of the techniques. Experiments show that our approach outper- forms the fastest existing subgraph search algorithm by up to two orders of magnitude in terms of elapsed time to process a query. Our approach also outperforms state-of-the-art subgraph matching algorithms by up to two orders of magnitude.
- Files in This Item
-
Go to Link
- Appears in
Collections - ETC > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.