Pagerank Dataset for Ethereum Blockchain
| Main Authors: | Baran Kılıç, Can Özturan, Alper Şen |
|---|---|
| Format: | info dataset Journal |
| Bahasa: | eng |
| Terbitan: |
, 2022
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/6038419 |
Daftar Isi:
- Description This dataset contains the Pagerank values and rankings of 147.098.561 Ethereum addresses. File format The dataset is compressed with bzip2. It can be uncompressed using the command bunzip2. It is a space-delimited plain text file and has the following four fields: <Ethereum Address> <rank> <rank with ties> <Pagerank value> Ethereum Address: A 42-character hexadecimal Ethereum address in the lowercase form (not in checksummed (mixed-case) form). E.g. 0x3f5ce5fbfe3e9af3971dd833d26ba9b5c936f0be rank: Unique Pagerank rank where the ties (addresses having the same Pagerank value) are resolved by sorting the addresses by hexadecimal value rank with ties: Pagerank rank where the ties (addresses having the same Pagerank value) have the same rank. Pagerank value: Pagerank of the address calculated using Pagerank algorithm. Dataset Generation The Ethereum transactions between blocks 0 (mined on 30.07.2015) and 13.799.999 (mined on 14.12.2021) are extracted. A transaction graph is constructed, where Ethereum addresses are nodes of the graph and the transactions are edges of the graph. Pagerank is applied on this transaction graph. This computation is performed using the system presented in the paper 'Parallel analysis of Ethereum blockchain transaction data using cluster computing'. Note If you use our dataset in your research, please cite our paper: https://link.springer.com/article/10.1007/s10586-021-03511-0 @article{kilic2022parallel, title={Parallel Analysis of Ethereum Blockchain Transaction Data using Cluster Computing}, journal={Cluster Computing}, author={K{\i}l{\i}{\c{c}}, Baran and {\"O}zturan, Can and Sen, Alper}, year={2022}, month={Jan} } Other Datasets If you are interested, please also check out our Pagerank Dataset for Bitcoin Blockchain.