Transactions per second

Known as: TPS 
In a very generic sense, the term transactions per second refers to the number of atomic actions performed by certain entity per second. In a more… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Blockchain technologies are expected to make a significant impact on a variety of industries. However, one issue holding them… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2018
2018
This paper presents Conflux, a fast, scalable and decentralized blockchain system that optimistically process concurrent blocks… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2016
2016
Recent transaction processing systems attempt to leverage advanced hardware features like RDMA and HTM to significantly boost… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2015
Highly Cited
2015
Transactions with strong consistency and high availability simplify building and reasoning about distributed systems. However… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 2
Is this relevant?
2015
2015
The Deuteronomy architecture provides a clean separation of transaction functionality (performed in a transaction component, or… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Silo is a new in-memory database that achieves excellent performance and scalability on modern multicore machines. Silo was… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
2007
2007
A $2k computer can execute about 8k transactions per second. This is 80x more than one of the largest US bank’s 1970’s traffic… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Review
1985
Review
1985
transaction per second. contrasts the Several companies intend to provide general-purpose processing systems capable of one… (More)
Is this relevant?
Highly Cited
1970
Highly Cited
1970
Organization and maintenance of an index for a dynamic random access file is considered. It is assumed that the index must be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1970
Highly Cited
1970
Organization and maintenance of an index for a dynamic random access file is considered. It is assumed that the index must be… (More)
  • figure 3
  • figure 4
  • figure 6
Is this relevant?