Efficient access methods for very large distributed graph databases

TítuloEfficient access methods for very large distributed graph databases
AutoresDavid Luaces, José R.R.Viqueira, José M.Cotos, Julián C.Flores
TipoArtículo de revista
Fonte Information Sciences, ELSEVIER SCIENCE INC, Vol. 573, pp. 65-81 , 2021.
RankProvisionally ranked Q1 in Computer Science Applications by CiteScore 2020
DOI10.1016/j.ins.2021.05.047
AbstractSubgraph searching is an essential problem in graph databases, but it is also challenging due to the involved subgraph isomorphism NP-Complete sub-problem. Filter-Then-Verify (FTV) methods mitigate performance overheads by using an index to prune out graphs that do not fit the query in a filtering stage, reducing the number of subgraph isomorphism evaluations in a subsequent verification stage. Subgraph searching has to be applied to very large databases (tens of millions of graphs) in real applications such as molecular substructure searching. Previous surveys have identified the FTV solutions GraphGrepSX (GGSX) and CT-Index as the best ones for large databases (thousands of graphs), however they cannot reach reasonable performance on very large ones (tens of millions graphs). This paper proposes a generic approach for the distributed implementation of FTV solutions. Besides, three previous methods that improve the performance of GGSX and CT-Index are adapted to be executed in clusters. The evaluation shows how the achieved solutions provide a great performance improvement (between 70% and 90% of filtering time reduction) in a centralized configuration and how they may be used to achieve efficient subgraph searching over very large databases in cluster configurations.
Palabras chaveGraph databasesSubgraph search, Graph query processing, Graph indexing, Subgraph isomorphism, Large scale processing