Decentralized Graph Processing for Reachability Queries

Answering queries on large graphs is an essential part of data processing. In this paper, we focus on determining reachability between vertices. We propose a labeling scheme which is inherently distributed and can be processed in parallel. We study what properties make it difficult to find a good re...

Full description

Saved in:
Bibliographic Details
Published inAdvanced Data Mining and Applications Vol. 13725; pp. 505 - 519
Main Authors Mathys, Joël, Fritsch, Robin, Wattenhofer, Roger
Format Book Chapter
LanguageEnglish
Published Switzerland Springer 2022
Springer Nature Switzerland
SeriesLecture Notes in Computer Science
Subjects
Data-mining-ready structures and pre-processing
Labeling scheme
Reachability query
Online AccessGet full text
ISBN3031220633
9783031220630
ISSN0302-9743
1611-3349
DOI10.1007/978-3-031-22064-7_36

Cover

More Information
Summary:Answering queries on large graphs is an essential part of data processing. In this paper, we focus on determining reachability between vertices. We propose a labeling scheme which is inherently distributed and can be processed in parallel. We study what properties make it difficult to find a good reachability labeling scheme for directed graphs. We focus on the genus of a graph. For graphs of bounded genus g, we design a labeling scheme of length $$\mathcal {O}(g\log n + {\log }^{2}{n})$$ . We also prove that no labeling schemes with labels shorter than $$\varOmega (\sqrt{g})$$ exist for this graph class.
Bibliography:Original Abstract: Answering queries on large graphs is an essential part of data processing. In this paper, we focus on determining reachability between vertices. We propose a labeling scheme which is inherently distributed and can be processed in parallel. We study what properties make it difficult to find a good reachability labeling scheme for directed graphs. We focus on the genus of a graph. For graphs of bounded genus g, we design a labeling scheme of length \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {O}(g\log n + {\log }^{2}{n})$$\end{document}. We also prove that no labeling schemes with labels shorter than \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varOmega (\sqrt{g})$$\end{document} exist for this graph class.
ISBN:3031220633
9783031220630
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-031-22064-7_36