Revisiting Link Prioritization for Efficient Traversal in Structured Decentralized Environments

From MaRDI portal
(Redirected from Dataset:6719700)



DOI10.5281/zenodo.14531949Zenodo14531949MaRDI QIDQ6719700FDOQ6719700

Dataset published at Zenodo repository.

Ruben Verborgh, Ruben Taelman, Ruben Eschauzier

Publication date: 19 December 2024

Copyright license: Creative Commons Attribution 4.0 International



Description

These files are the benchmark results produced for the analysis in the paper: "Revisiting Link Prioritization forEfficient Traversal in Structured DecentralizedEnvironments". These include the timing runs without $R^{3}$ tracking, five $R^{3}$ runs for the diefficiency, and one run for calculating the $R^{3}$. To process this data you can use and follow the instructions from this repository.







This page was built for dataset: Revisiting Link Prioritization for Efficient Traversal in Structured Decentralized Environments

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Revisiting_Link_Prioritization_for_Efficient_Traversal_in_Structured_Decentralized_Environments&oldid=54687362"
Powered by MediaWiki