Çulha, Davut

Profile Picture
Profile URL
https://hdl.handle.net/20.500.14411/6966
Name Variants
Çulha, Dr. Davut
Davut, Culha
Davut, Çulha
D., Culha
Ç.,Davut
D.,Çulha
Çulha,D.
Culha D.
Ç., Davut
Culha, Davut
D., Çulha
C.,Davut
Çulha, Davut
D.,Culha
Culha,D.
C., Davut
Job Title
Doçent Doktor
Email Address
davut.culha@atilim.edu.tr
Main Affiliation
Software Engineering
Status
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

7

Articles

1

Views / Downloads

28/165

Supervised MSc Theses

2

Supervised PhD Theses

0

WoS Citation Count

27

Scopus Citation Count

33

Patents

0

Projects

0

WoS Citations per Publication

3.86

Scopus Citations per Publication

4.71

Open Access Source

1

Supervised Theses

2

JournalCount
International Congress on Big Data, Deep Learning and Fighting Cyber Terrorism, IBIGDELFT 2018 - Proceedings -- 2018 International Congress on Big Data, Deep Learning and Fighting Cyber Terrorism, IBIGDELFT 2018 -- 3 December 2018 through 4 December 2018 -- Ankara -- 1445742
6th International Conference on Blockchain Computing and Applications -- NOV 26-29, 2024 -- Zayed University, Dubai, U ARAB EMIRATES1
International Congress on Big Data, Deep Learning and Fighting Cyber Terrorism (IBIGDELFT) -- DEC 03-04, 2018 -- Turkish IT Author, Ankara, TURKEY1
Journal of Universal Computer Science1
Current Page: 1 / 1

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

20251
Reset filters

Settings

Author: Culha, DavutSubject: Blockchain Path

Scholarly Output Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Article
    Binary Tree Blockchain of Decomposed Transactions
    (Graz University of Technology, Institute of Information Systems and Computer Media (IICM), 2025) Culha, Davut
    Widespread adoption of blockchain technologies requires scalability. To achieve scalability, various methods are applied, including new consensus algorithms, directed acyclic graph solutions, sharding solutions, and off-chain solutions. Sharding solutions are particularly promising as they distribute workload across different parts of the blockchain network. Similarly, directed acyclic graphs use graph data structures to distribute workload effectively. In this work, a binary tree data structure is used to enhance blockchain scalability. Binary trees offer several advantages, such as the ability to address nodes with binary numbers, providing a straightforward and efficient method for identifying and locating nodes. Each node in the tree contains a block of transactions, which allows for transactions to be directed to specific paths within the tree. This directionality not only increases scalability by enabling parallel processing of transactions but also ensures that the blockchain can handle a higher volume of transactions without becoming congested. Moreover, transactions are decomposed into transaction elements, improving the immutability of the binary tree blockchain. This novel decomposition process helps to minimize the computational overhead required for calculating account balances, making the system more efficient. By breaking down transactions into their fundamental components, the system can process and verify transactions more rapidly and accurately. This approach effectively realizes implicit sharding using a binary tree structure, distributing the processing load more evenly and reducing bottlenecks. The proposed method is simulated to assess its performance. Experimental results demonstrate that the proposed method achieves a significantly higher transaction throughput of 32307 transactions per second. Furthermore, block generation times decrease as the system scales, with an average block generation time of 0.13 seconds, underscoring the efficiency of the binary tree blockchain structure.