Massively Parallel Single-Source SimRanks in Rounds
SimRank is one of the most fundamental measures that evaluate the structural similarity
between two nodes in a graph and has been applied in a plethora of data management …
between two nodes in a graph and has been applied in a plethora of data management …
Topology-aware Parallel Joins
X Hu, P Koutris - Proceedings of the ACM on Management of Data, 2024 - dl.acm.org
We study the design and analysis of parallel join algorithms in a topology-aware
computational model. In this model, the network is modeled as a directed graph, where each …
computational model. In this model, the network is modeled as a directed graph, where each …
Work-efficient query evaluation with prams
J Keppeler, T Schwentick, C Spinrath - arXiv preprint arXiv:2301.08178, 2023 - arxiv.org
The paper studies query evaluation in parallel constant time in the PRAM model. While it is
well-known that all relational algebra queries can be evaluated in constant time on an …
well-known that all relational algebra queries can be evaluated in constant time on an …
Algorithms for a topology-aware massively parallel computation model
Most of the prior work in massively parallel data processing assumes homogeneity, ie, every
computing unit has the same computational capability and can communicate with every …
computing unit has the same computational capability and can communicate with every …
Attempts in Worst-Case Optimal Joins on Relational Data Systems: A Literature Survey
A Berdai, D Chiadmi - 2023 IEEE 6th International Conference …, 2023 - ieeexplore.ieee.org
Binary join algorithms are a very well researched topic in the databases field, but recent
progress in establishing tighter bounds over the size of the result of a join query has …
progress in establishing tighter bounds over the size of the result of a join query has …