Comparison of Data Structure Techniques used for the Implementation of Digital Currency Payment Models

Abstract

The emergence of electronic business has generated new payment
necessities that in many circumstances cannot be feasibly fulfilled by
the fiat payment systems. The success of electronic commerce business
depends on the credibility of the available electronic payment systems.
Digital currency payment models were designed to settle payment
transactions online, but experiences the issue of double-spending
fraud. Double-spending refers to the inability of digital currency
payment systems permitting the potentiality to spend the same units of
digital currency identification more than once. A number of models to
combat double-spending fraud have been designed and developed.
Some of the existing schemes prevent double-spending fraud after
digital currency payment transactions have been completed.
Therefore, this paper focuses on the determination of the digital
currency payment model that has the best computational time to
prevent double-spending fraud in payment transactions. This is done
by the procedural study of the data structure techniques used by the
digital currency payment models that prevent double-spending fraud
before it occurs in terms of data representation, implementation and
method used to prevent double-spending fraud and the required
search time. The appraisal culminated in the derivation of the time
complexity of each of the data structure techniques used for the
implementation of the digital currency payment models.