Journal articles: 'Distributed transaction systems'

1

BOCCHI, LAURA, and EMILIO TUOSTO. "Attribute-based transactions in service oriented computing." Mathematical Structures in Computer Science 25, no. 3 (November 10, 2014): 619–65. http://dx.doi.org/10.1017/s0960129512000904.

Full text

Abstract:

We present a theory for the design and verification of distributed transactions in dynamically reconfigurable systems. Despite several formal approaches have been proposed to study distributed transactional behaviours, the inter-relations between failure propagation and dynamic system reconfiguration still need investigation. We propose a formal model for transactions in service oriented architectures (SOAs) inspired by the attribute mechanisms of the Java Transaction API. Technically, we model services in ATc (after ‘Attribute-basedTransactionalcalculus’), a CCS-like process calculus where service declarations are decorated with atransactional attribute. Such attribute disciplines, upon service invocation, how the invoked service is executed with respect to the transactional scopes of the invoker. A type system ensures that well-typed ATc systems do not exhibit run-time errors due to misuse of the transactional mechanisms. Finally, we define a testing framework for distributed transactions in SOAs based on ATc and prove that under reasonable conditions some attributes are observationally indistinguishable.

APA, Harvard, Vancouver, ISO, and other styles

2

Zamanian, Erfan, Julian Shun, Carsten Binnig, and Tim Kraska. "Chiller." ACM SIGMOD Record 50, no. 1 (June 15, 2021): 15–22. http://dx.doi.org/10.1145/3471485.3471490.

Full text

Abstract:

Distributed transactions on high-overhead TCP/IP-based networks were conventionally considered to be prohibitively expensive. In fact, the primary goal of existing partitioning schemes is to minimize the number of cross-partition transactions. However, with the new generation of fast RDMAenabled networks, this assumption is no longer valid. In this paper, we first make the case that the new bottleneck which hinders truly scalable transaction processing in modern RDMA-enabled databases is data contention, and that optimizing for data contention leads to different partitioning layouts than optimizing for the number of distributed transactions. We then present Chiller, a new approach to data partitioning and transaction execution, which aims to minimize data contention for both local and distributed transactions.

APA, Harvard, Vancouver, ISO, and other styles

3

Ravoor, Suresh B., and Johnny S. K. Wong. "Multithreaded transaction processing in distributed systems." Journal of Systems and Software 38, no. 2 (August 1997): 107–17. http://dx.doi.org/10.1016/s0164-1212(96)00114-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Li, Rong, Shangping Wang, and Na Xie. "A Novel Epoch-Based Transaction Consistency Sorting Protocol for DAG Distributed Ledger." Security and Communication Networks 2022 (December 8, 2022): 1–13. http://dx.doi.org/10.1155/2022/3930858.

Full text

Abstract:

Because of the characteristics of decentralization, immutability, and transparency, blockchain has gradually become a new and revolutionary technology, which has far-reaching significance for the development of modern technology. However, the traditional Bitcoin blockchain that supports synchronous consensus suffers from the fatal flaw of low throughput. To improve throughput, a number of DAG distributed ledgers have been proposed that support asynchronous consensus, all of which allow multiple nodes to process concurrent transactions asynchronously. However, most DAG distributed ledgers do not implement consistent sorting of transactions, making it difficult to deploy smart contracts. To overcome this problem, in this paper, an epoch-based transaction consistency sorting protocol for DAG distributed ledger is proposed, which not only provides the possibility for the deployment of smart contracts but also can be used to resolve conflicting transactions in the ledger. Transaction consistency sorting protocol provides a more reasonably ordered list of all transactions by taking scalars, such as the set of their own past and future, parent block, and timestamp. In addition, through theoretical analysis, the stability and rationality of the transaction consistency sorting protocol are proved, and there is no Condorcet cycle. Finally, the simulation results demonstrate the protocol is efficient and achieve a throughput of at least 2000 transactions per second.

APA, Harvard, Vancouver, ISO, and other styles

5

Jiang, Yongbo, Gongxue Sun, and Tao Feng. "Research on Data Transaction Security Based on Blockchain." Information 13, no. 11 (November 8, 2022): 532. http://dx.doi.org/10.3390/info13110532.

Full text

Abstract:

With the increasing value of various kinds of data in the era of big data, the demand of different subjects for data transactions has become more and more urgent. In this paper, a blockchain-based data transaction protection scheme is proposed to realize the secure transaction sharing among data. This paper carries out the following work: by analyzing the existing data transaction models, we find the data security and transaction protection problems, establish a third-party-free data transaction platform using blockchain, protect users’ data security by combining AES and improved homomorphic encryption technology, and upload the encrypted data to the Interplanetary File System (IPFS) for distributed storage. Finally, we use the powerful functions of the IPFS, combined with inadvertent transmission protocol, two-way authentication, zero-knowledge proof, and other security verification for data transactions. The security analysis proves that this scheme has higher security despite the time overhead, and we will continue to optimize the scheme to improve efficiency in the future.

APA, Harvard, Vancouver, ISO, and other styles

6

Daniels, Dean S., Alfred Z. Spector, and Dean S. Thompson. "Distributed logging for transaction processing." ACM SIGMOD Record 16, no. 3 (December 1987): 82–96. http://dx.doi.org/10.1145/38714.38728.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

RUSINKIEWICZ, MAREK, PIOTR KRYCHNIAK, and ANDRZEJ CICHOCKI. "TOWARDS A MODEL FOR MULTIDATABASE TRANSACTIONS." International Journal of Cooperative Information Systems 01, no. 03n04 (December 1992): 579–617. http://dx.doi.org/10.1142/s0218215792000155.

Full text

Abstract:

In many application areas the information that may be of interest to a user is stored under the control of multiple, autonomous database systems. To support global transactions in a multidatabase environment, we must coordinate the activities of multiple Database Management Systems that were designed for independent, stand-alone operation. The autonomy and heterogeneity of these systems present a major impediment to the direct adaptation of transaction management mechanisms developed for distributed databases. In this paper we introduce a transaction model designed for a multidatabase environment. A multidatabase transaction is defined by providing a set of (local) sub-transactions, together with their precedence and dataflow requirements. Additionally, the transaction designer may specify failure atomicity and execution atomicity requirements of the multidatabase transaction. These high-level specifications are then used by the scheduler of a multidatabase transaction to assure that its execution satisfies the constraints imposed by the semantics of the application. Uncontrolled interleaving of multidatabase transactions may lead to the violation of interdatabase integrity constraints. We discuss the issues involved in a concurrent execution of multidatabase transactions and propose a new concurrency control correctness criterion that is less restrictive than global serializability. We also show how the multidatabase SQL can be extended to allow the user to specify multidatabase transactions in a nonprocedural way.

APA, Harvard, Vancouver, ISO, and other styles

8

Zhou, Jingyu, Meng Xu, Alexander Shraer, Bala Namasivayam, Alex Miller, Evan Tschannen, Steve Atherton, et al. "FoundationDB: A Distributed Key-Value Store." Communications of the ACM 66, no. 6 (May 24, 2023): 97–105. http://dx.doi.org/10.1145/3592838.

Full text

Abstract:

FoundationDB is an open-source transactional key-value store created more than 10 years ago. It is one of the first systems to combine the flexibility and scalability of NoSQL architectures with the power of ACID transactions. FoundationDB adopts an unbundled architecture that decouples an in-memory transaction management system, a distributed storage system, and a built-in distributed configuration system. Each sub-system can be independently provisioned and configured to achieve scalability, high availability, and fault tolerance. FoundationDB includes a deterministic simulation framework, used to test every new feature under a myriad of possible faults. This rigorous testing makes FoundationDB extremely stable and allows developers to introduce and release new features in a rapid cadence. FoundationDB offers a minimal and carefully chosen feature set, which has enabled a range of disparate systems to be built as layers on top. FoundationDB is the underpinning of cloud infrastructure at Apple, Snowflake, and other companies, due to its consistency, robustness, and availability for storing user data, system metadata and configuration, and other critical information.

APA, Harvard, Vancouver, ISO, and other styles

9

Martella, G., B. Pernici, and F. A. Schreiber. "An Availability Model for Distributed Transaction Systems." IEEE Transactions on Software Engineering SE-11, no. 5 (May 1985): 483–91. http://dx.doi.org/10.1109/tse.1985.232488.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Yu, P. S., S. Balsamo, and Y. H. Lee. "Dynamic transaction routing in distributed database systems." IEEE Transactions on Software Engineering 14, no. 9 (1988): 1307–18. http://dx.doi.org/10.1109/32.6174.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Johannsen, Wolfgang. "Transaction models for federative distributed database systems." Future Generation Computer Systems 7, no. 2-3 (April 1992): 329–37. http://dx.doi.org/10.1016/0167-739x(92)90020-c.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Mafla, E., and B. Bhargava. "Communication facilities for distributed transaction-processing systems." Computer 24, no. 8 (August 1991): 61–66. http://dx.doi.org/10.1109/2.84878.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Pei, Ouya, Zhanhuai Li, Hongtao Du, Wenjie Liu, and Jintao Gao. "Dependence-Cognizant Locking Improvement for the Main Memory Database Systems." Mathematical Problems in Engineering 2021 (February 20, 2021): 1–12. http://dx.doi.org/10.1155/2021/6654461.

Full text

Abstract:

The traditional lock manager (LM) seriously limits the transaction throughput of the main memory database systems (MMDB). In this paper, we introduce dependence-cognizant locking (DCLP), an efficient improvement to the traditional LM, which dramatically reduces the locking space while offering efficiency. With DCLP, one transaction and its direct successors are collocated in its context. Whenever a transaction is committed, it wakes up its direct successors immediately avoiding the expensive operations, such as lock detection and latch contention. We also propose virtual transaction which has better time and space complexity by compressing continuous read-only transactions/operations. We implement DCLP in Calvin and carry out experiments in both multicore and shared-nothing distributed databases. Experiments demonstrate that, in contrast with existing algorithms, DCLP can achieve better performance in many workloads, especially high-contention workloads.

APA, Harvard, Vancouver, ISO, and other styles

14

Chen, Joy Iong-Zong, and Lu-Tsou Yeh. "Enhancing the Speed of Response in Digital Money Transactions using Distributed Blockchain System." September 2021 3, no. 3 (October 29, 2021): 193–209. http://dx.doi.org/10.36548/jitdw.2021.3.004.

Full text

Abstract:

Waiting for anything is undesirable by most of the human beings. Especially in the case of digital money transactions, most of the people may have doubtful thoughts on their mind about the success rate of their transactions while taking a longer processing time. The Unified Payment Interface (UPI) system was developed in India for minimizing the typographic works during the digital money transaction process. The UPI system has a separate UPI identification number of each individual consisting of their name, bank name, branch name, and account number. Therefore, sharing of account information has become easier and it reduces the chances of typographic errors in digital transaction applications. Sharing of UPI details are also made easy and secure with Quick Response (QR) code scanning methods. However, a digital transaction like UPI requires a lot of servers to be operated for a single transaction same as in National Electronic Fund Transfer (NEFT) and Immediate Payment Services (IMPS) in India. This increases the waiting time of digital transactions due to poor server communication and higher volume of payment requests on a particular server. The motive of the proposed work is to minimize the server communications by employing a distributed blockchain system. The performance is verified with a simulation experiment on BlockSim simulator in terms of transaction success rate and processing time over the traditional systems.

APA, Harvard, Vancouver, ISO, and other styles

15

Zhou, Jingyu, Meng Xu, Alexander Shraer, Bala Namasivayam, Alex Miller, Evan Tschannen, Steve Atherton, et al. "FoundationDB." ACM SIGMOD Record 51, no. 1 (May 31, 2022): 24–31. http://dx.doi.org/10.1145/3542700.3542707.

Full text

Abstract:

FoundationDB is an open source transactional key value store created more than ten years ago. It is one of the first systems to combine the flexibility and scalability of NoSQL architectures with the power of ACID transactions. FoundationDB adopts an unbundled architecture that decouples an in-memory transaction management system, a distributed storage system, and a built-in distributed configuration system. Each sub-system can be independently provisioned and configured to achieve scalability, high-availability and fault tolerance. FoundationDB includes a deterministic simulation framework, used to test every new feature under a myriad of possible faults. FoundationDB offers a minimal and carefully chosen feature set, which has enabled a range of disparate systems to be built as layers on top. FoundationDB is the underpinning of cloud infrastructure at Apple, Snowflake and other companies.

APA, Harvard, Vancouver, ISO, and other styles

16

Lee, Yann-Hang, Philip S. Yu, and Balakrishna R. Iyer. "Progressive Transaction Recovery in Distributed DB/DC Systems." IEEE Transactions on Computers C-36, no. 8 (August 1987): 976–87. http://dx.doi.org/10.1109/tc.1987.5009520.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Gligor, Virgil, and Radu Popescu-Zeletin. "Transaction management in distributed heterogeneous database management systems." Information Systems 11, no. 4 (January 1986): 287–97. http://dx.doi.org/10.1016/0306-4379(86)90009-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Park, Seongjoon, and Hwangnam Kim. "DAG-Based Distributed Ledger for Low-Latency Smart Grid Network." Energies 12, no. 18 (September 18, 2019): 3570. http://dx.doi.org/10.3390/en12183570.

Full text

Abstract:

In this paper, we propose a scheme that implements a Distributed Ledger Technology (DLT) based on Directed Acyclic Graph (DAG) to generate, validate, and confirm the electricity transaction in Smart Grid. The convergence of the Smart Grid and distributed ledger concept has recently been introduced. Since Smart Grids require a distributed network architecture for power distribution and trading, the Distributed Ledger-based Smart Grid design is a spotlighted research domain. However, only the Blockchain-based methods, which are a type of the distributed ledger scheme, are currently either being considered or adopted in the Smart Grid. Due to computation-intensive consensus schemes such as Proof-of-Work and discrete block generation, Blockchain-based distributed ledger systems suffer from efficiency and latency issues. We propose a DAG-based distributed ledger for Smart Grids, called PowerGraph, to resolve this problem. Since a DAG-based distributed ledger does not need to generate blocks for confirmation, each transaction of the PowerGraph undergoes the validation and confirmation process individually. In addition, transactions in PowerGraph are used to keep track of the energy trade and include various types of transactions so that they can fully encompass the events in the Smart Grid network. Finally, to ensure that PowerGraph maintains a high performance, we modeled the PowerGraph performance and proposed a novel consensus algorithm that would result in the rapid confirmation of transactions. We use numerical evaluations to show that PowerGraph can accelerate the transaction processing speed by over 5 times compared to existing DAG-based DLT system.

APA, Harvard, Vancouver, ISO, and other styles

19

Gu, Yonggen, Dingding Hou, Xiaohong Wu, Jie Tao, and Yanqiong Zhang. "Decentralized Transaction Mechanism Based on Smart Contract in Distributed Data Storage." Information 9, no. 11 (November 17, 2018): 286. http://dx.doi.org/10.3390/info9110286.

Full text

Abstract:

Distributed data storage has received more attention due to its advantages in reliability, availability and scalability, and it brings both opportunities and challenges for distributed data storage transaction. The traditional transaction system of storage resources, which generally runs in a centralized mode, results in high cost, vendor lock-in and single point failure risk. To overcome the above shortcomings, considering the storage policy with erasure coding, in this paper we propose a decentralized transaction method for cloud storage based on a smart contract, which takes into account the resource cost for distributed data storage. First, to guarantee the availability and decrease the storing cost, a reverse Vickrey-Clarke-Groves (VCG) based auction mechanism is proposed for storage resource selection and transaction. Then we deploy and implement the proposed mechanism by designing a corresponding smart contract. Especially, we address the problem of how to implement a VCG-like mechanism in a blockchain environment. Based on the private chain of Ethereum, we make the simulation for the proposed storage transaction method. The results of simulation show that the proposed transaction model can realize competitive trading of storage resources and ensure the safe and economic operation of resource trading.

APA, Harvard, Vancouver, ISO, and other styles

20

Hiraga, Kohei, Osamu Tatebe, and Hideyuki Kawashima. "Scalable Distributed Metadata Server Based on Nonblocking Transactions." JUCS - Journal of Universal Computer Science 26, no. 1 (January 28, 2020): 89–106. http://dx.doi.org/10.3897/jucs.2020.006.

Full text

Abstract:

Metadata performance scalability is critically important in high-performance computing when accessing many small files from millions of clients. This paper proposes a design of a scalable distributed metadata server, PPMDS, for parallel file systems using multiple key-value servers. In PPMDS, hierarchical namespace of a file system is efficiently managed by multiple servers. Multiple entries can be atomically updated using a nonblocking distributed transaction based on an algorithm of dynamic software transactional memory. This paper also proposes optimizations to further improve the metadata performance by introducing a server-side transaction processing, multiple readers, and a shared lock mode, which reduce the number of remote procedure calls and prevent unnecessary blocking. Performance evaluation shows the scalable performance up to 3 servers, and achieves 62,000 operations per second, which is 2.58x performance improvement compared to a single metadata performance.

APA, Harvard, Vancouver, ISO, and other styles

21

Mazurova, Oksana, Artem Naboka, and Mariya Shirokopetleva. "RESEARCH OF ACID TRANSACTION IMPLEMENTATION METHODS FOR DISTRIBUTED DATABASES USING REPLICATION TECHNOLOGY." Innovative Technologies and Scientific Solutions for Industries, no. 2 (16) (July 6, 2021): 19–31. http://dx.doi.org/10.30837/itssi.2021.16.019.

Full text

Abstract:

Today, databases are an integral part of most modern applications designed to store large amounts of data and to request from many users. To solve business problems in such conditions, databases are scaled, often horizontally on several physical servers using replication technology. At the same time, many business operations require the implementation of transactional compliance with ACID properties. For relational databases that traditionally support ACID transactions, horizontal scaling is not always effective due to the limitations of the relational model itself. Therefore, there is an applied problem of efficient implementation of ACID transactions for horizontally distributed databases. The subject matter of the study is the methods of implementing ACID transactions in distributed databases, created by replication technology. The goal of the work is to increase the efficiency of ACID transaction implementation for horizontally distributed databases. The work is devoted to solving the following tasks: analysis and selection of the most relevant methods of implementation of distributed ACID transactions; planning and experimental research of methods for implementing ACID transactions by using of NoSQL DBMS MongoDB and NewSQL DBMS VoltDB as an example; measurements of metrics of productivity of use of these methods and formation of the recommendation concerning their effective use. The following methods are used: system analysis; relational databases design; methods for evaluating database performance. The following results were obtained: experimental measurements of the execution time of typical distributed transactions for the subject area of e-commerce, as well as measurements of the number of resources required for their execution; revealed trends in the performance of such transactions, formed recommendations for the methods studied. The obtained results allowed to make functions of dependence of the considered metrics on loading parameters. Conclusions: the strengths and weaknesses of the implementation of distributed ACID transactions using MongoDB and VoltDB were identified. Practical recommendations for the effective use of these systems for different types of applications, taking into account the resources consumed and the types of requests.

APA, Harvard, Vancouver, ISO, and other styles

22

Dong, Zhiyuan, Zhaoguo Wang, Xiaodong Zhang, Xian Xu, Changgeng Zhao, Haibo Chen, Aurojit Panda, and Jinyang Li. "Fine-Grained Re-Execution for Efficient Batched Commit of Distributed Transactions." Proceedings of the VLDB Endowment 16, no. 8 (April 2023): 1930–43. http://dx.doi.org/10.14778/3594512.3594523.

Full text

Abstract:

Distributed transaction systems incur extensive cross-node communication to execute and commit serializable OLTP transactions. As a result, their performance greatly suffers. Caching data at nodes that execute transactions can cut down remote reads. Batching transactions for validation and persistence can amortize the communication cost during committing. However, caching and batching can significantly increase the likelihood of conflicts, causing expensive aborts. In this paper, we develop Hackwrench to address the challenge of caching and batching. Instead of aborting conflicted transactions, Hackwrench tries to repair them using fine-grained re-execution by tracking the dependencies of operations among a batch of transactions. Tracked dependencies allow Hackwrench to selectively invalidate and re-execute only those operations necessary to "fix" the conflict, which is cheaper than aborting and executing an entire batch of transactions. Evaluations using TPC-C and other micro-benchmarks show that Hackwrench can outperform existing commercial and research systems including FoundationDB, Calvin, COCO, and Sundial under comparable settings.

APA, Harvard, Vancouver, ISO, and other styles

23

Shahriar Hazari, Shihab, and Qusay H. Mahmoud. "Improving Transaction Speed and Scalability of Blockchain Systems via Parallel Proof of Work." Future Internet 12, no. 8 (July 27, 2020): 125. http://dx.doi.org/10.3390/fi12080125.

Full text

Abstract:

A blockchain is a distributed ledger forming a distributed consensus on a history of transactions, and is the underlying technology for the Bitcoin cryptocurrency. Its applications are far beyond the financial sector. The transaction verification process for cryptocurrencies is much slower than traditional digital transaction systems. One approach to scalability or the speed at which transactions are processed is to design a solution that offers faster Proof of Work. In this paper, we propose a method for accelerating the process of Proof of Work based on parallel mining rather than solo mining. The goal is to ensure that no more than two or more miners put the same effort into solving a specific block. The proposed method includes a process for selection of a manager, distribution of work and a reward system. This method has been implemented in a test environment that contains all the characteristics needed to perform Proof of Work for Bitcoin and has been tested, using a variety of case scenarios, by varying the difficulty level and number of validators. Experimental evaluations were performed locally and in a cloud environment, and experimental results demonstrate the feasibility the proposed method.

APA, Harvard, Vancouver, ISO, and other styles

24

Milev, Aleksandar, and Svetlana Vasileva. "MODELLING OF CENTRALIZED TWO-PHASE LOCKING WITH INTEGRATED MECHANISM OF TIMESTAMPS BY THE “WAIT – DIE” METHOD." Journal scientific and applied research 4, no. 1 (October 10, 2013): 66–73. http://dx.doi.org/10.46687/jsar.v4i1.82.

Full text

Abstract:

This paper presents an algorithm for two-phase locking (2PL) in which deadlocks of distributed transactions for distributed database management systems (DDBMS) are avoided. The method of timestamps is chosen for solving deadlocks and the centralized 2PL algorithm is implemented in DDBMS. The „wait - die” strategy of timestamps mechanism for deadlocks avoiding is presented in this paper. The simulation results of modeling “wait-die” algorithm are given by using GPSS World Personal Version for two and three elements length of distributed transaction.

APA, Harvard, Vancouver, ISO, and other styles

25

Zhang, Han Lin, Sui Yi Li, and Xiao Jing Jia. "Research on Reputation Systems Based on E-Business to Guarantee Integrity Transactions." Advanced Materials Research 403-408 (November 2011): 2953–57. http://dx.doi.org/10.4028/www.scientific.net/amr.403-408.2953.

Full text

Abstract:

It should be designed one kind of reputation system based on the public-key certificate system to assure the strangers in the environment of E-Business to guarantee integrity transactions. This reputation system should satisfy the transaction characteristics of entity in the E-business, which can not only store the reputation evaluation data in a distributed way but also delete the malicious entity effectively based on certificate revocation mechanisms. Aiming at the transaction characteristics of objectivity, simplicity and utility, this paper gives us an improvement on add algorithm and subtraction algorithm for reputation data in the system. At last, using the experiment in analog simulation, it shows that the reputation system can realize those functions effectively.

APA, Harvard, Vancouver, ISO, and other styles

26

Lakshmi, J. Suba, K. Arulanandam, and T. Varadarajan. "Scalable Transaction Management with Snapshot Isolation for Distributed Systems." International Journal of Computer Trends and Technology 39, no. 1 (September 25, 2016): 18–22. http://dx.doi.org/10.14445/22312803/ijctt-v39p104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Ulusoy, Özgür. "Transaction processing in distributed active real-time database systems." Journal of Systems and Software 42, no. 3 (September 1998): 247–62. http://dx.doi.org/10.1016/s0164-1212(98)10013-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Aguilar, Jose, and Erol Gelenbe. "Task assignment and transaction clustering heuristics for distributed systems." Information Sciences 97, no. 1-2 (March 1997): 199–219. http://dx.doi.org/10.1016/s0020-0255(96)00178-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Yoon, Yong I., and Song C. Moon. "Reliable transaction processing for real-time distributed database systems." Microprocessing and Microprogramming 34, no. 1-5 (February 1992): 63–66. http://dx.doi.org/10.1016/0165-6074(92)90103-e.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

YAKOVCHUK, MYKOLA, VITALY MIKHALEVSKY, and TETYANA SKRYPNYK. "COMPARISON OF MANAGEMENT EFFICIENCY IN DECENTRALIZED AND CENTRALIZED SYSTEMS." Herald of Khmelnytskyi National University 301, no. 5 (October 2021): 41–44. http://dx.doi.org/10.31891/2307-5732-2021-301-5-41-44.

Full text

Abstract:

This article describes and investigates the difference between a decentralized and a centralized information system. The efficiency of use and introduction of new technologies in production is studied. The construction of blockchain-based systems and their efficiency in solving the tasks are analyzed. Conclusions are formed about the tendency that the introduction of decentralization proves the need for digital management systems. At a time when the implementation of blockchain technology has greatly simplified the construction of new decentralized systems, which is a current trend in the world. The basis of blockchain technology is in a distributed information storage. It allows you to store important information simultaneously on many servers, and therefore keep them open and safe. For example, on the basis of this technology it is possible store both the history of customers’ bank transactions, voting results, and database of contracts, fingerprints or medical histories. And the information that stored simultaneously in many places, it is impossible to steal it, because in any case they can be restored from the original sources. As already mentioned, a blockchain, a block of transactions, is a structure for writing transaction groups. Transactions are carried out only when it is considered confirmed. It is reliable and convenient when it comes to making payments or the transfer of confidential data. So that the transaction is considered confirmed, its format and signatures must be verified. After that, the group transactions are recorded in a special block. In these blocks, all data is fast to verify. And in each subsequent information about the previous is stored. For example, in transactions on cryptocurrencies, the chain contains blocks information about all actions ever performed with bitcoins. The block includes a header and a list of transactions. The title of the block has its own hash, previous block hash, transaction hash and other additional official information. The first thing that is specified in the transaction block is getting a commission that will be as a reward, so the user who actually and will create this block. For transactions in the block tree hashing was used.

APA, Harvard, Vancouver, ISO, and other styles

31

Jinadu, O. T., O. V. Johnson, and M. Ganiyu. "Distributed Database System Optimization for Improved Service Delivery in Mobile and Cloud BigData Applications." International Journal of Computer Science and Mobile Computing 10, no. 9 (September 30, 2021): 38–45. http://dx.doi.org/10.47760/ijcsmc.2021.v10i09.004.

Full text

Abstract:

Many issues associated with managing centralized database include data isolation, redundancy, inconsistency, and atomicity of updates, among others; however, distributed database implementation over high-performance compute nodes maximizes information value across the networks. Also, analysis of bigdata generated/consumed over the mobile Internet, Internet of Things (IoT) and cloud computations necessitates low-latency reads and updates over cloud clusters. Conventionally, services in distributed systems demand optimized transactions. This paper examines transaction generation over distributed storage pool using suggested reference architectures of fragmentation using hybrid semi-join operations to offer mobility transparency as an additional ingredient of integrity transparency offer of DDBMS. Distributed storage pool is simulated using configured WLAN to activate multiple file transfers concurrently, engaging mobile nodes and large file sizes. Major functionality desired in the storage pool is improvised by storage virtualization whereby a global schema query optimizer effects transaction management to characterized latency-driven throughputs achieved by joint optimization of network and storage virtualization. Measurements and evaluations gave the best overall performance of low-latency reads and updates using the provisioned mobile-transmission control protocol (M-TCP). Appreciable improvement in service delivery is offered using distributed storage pool (DSP) facilitated with hybridized RAID construction and copy mechanisms. Improved response-time and speed-up transmissions evidently showed low-latency read and update transactions, depicting improved service delivery. Evaluating the DDBMS model simulated in the DSP architecture, all complexity (overheads) associated with conventional shared systems were minimized.

APA, Harvard, Vancouver, ISO, and other styles

32

Sherman, Mark. "Architecture of the Encina distributed transaction processing family." ACM SIGMOD Record 22, no. 2 (June 1993): 460–63. http://dx.doi.org/10.1145/170036.170136.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Levy, Eliezer, Henry F. Korth, and Abraham Silberschatz. "An optimistic commit protocol for distributed transaction management." ACM SIGMOD Record 20, no. 2 (April 1991): 88–97. http://dx.doi.org/10.1145/119995.115800.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Raza, Zeeshan, Irfan ul Haq, Muhammad Muneeb, and Omair Shafiq. "Energy Efficient Multiprocessing Solo Mining Algorithms for Public Blockchain Systems." Scientific Programming 2021 (October 31, 2021): 1–13. http://dx.doi.org/10.1155/2021/9996132.

Full text

Abstract:

Blockchain as a decentralized distributed ledger is revolutionizing the world with a secure design data storage mechanism. In the case of Bitcoin, mining involves a process of packing transactions in a block by calculating a random number termed as a nonce. The nonce calculation is done by special nodes called miners, and all the miners follow the Proof of Work (PoW) mining mechanism to perform the mining task. The transaction verification time in PoW-based blockchain systems, i.e., Bitcoin, is much slower than other digital transaction systems such as PayPal. It needs to be quicker if a system adapts PoW-based blockchain solutions, where there are thousands of transactions being computed at a time. Besides this, PoW mining also consumes a lot of energy to calculate the nonce of a block. Mining pools resulting into aggregated hashpower have been a popular solution to speed up the PoW mining, but they can be attacked by using different types of attacks. Parallel computing can be used to speed up the solo mining methods by utilizing the multiple processes of the contributing processors. In this research, we analyze various consensus mechanisms and see that the PoW-based blockchain systems have the limitations of low transaction confirmation time and high energy consumption. We also analyze various types of consensus layer attacks and their effects on miners and mining pools. To tackle these issues, we propose parallel PoW nonce calculation methods to accelerate the transaction verification process especially in solo mining. We have tested our techniques on different difficulty levels, and our proposed techniques yield better results than the traditional nonce computation mechanisms.

APA, Harvard, Vancouver, ISO, and other styles

35

Vivekanadam B. "Analysis of Recent Trend and Applications in Block Chain Technology." December 2020 2, no. 4 (October 6, 2020): 200–206. http://dx.doi.org/10.36548/jismac.2020.4.003.

Full text

Abstract:

Blockchain is a digital ledger in which each record known as blocks and that are combined in a single list known as a chain. It is regarded as Bitcoin’s backbone technology. It is also regarded as cohesive collections of digital wallets. Blockchains are primarily used by cryptocurrencies such as Bitcoin and other applications to record these transactions. A blockchain is commonly referred to as a collection of distributed databases that consists of all public transactions, records and digital events then that information is shared among the participants. Every transaction is verified and it cannot be removed. The main features of this technology are reliable, efficient operation, fault tolerance and scalability. Some of the applications are manufacturing, government and finance when the three properties met together (i.e., Efficiency, Scalability and Security). By using several computers, each transaction that is applied to a blockchain is validated. A peer-to-peer network is developed by these systems that are used to validate these forms of blockchain transactions. They work together to ensure that any transaction is legitimate until it is added to the blockchain, and invalid blocks cannot be added to the chain by these systems. When a new block is added, it can be connected to a previous block using a cryptographic hash and the chain cannot be broken and each block is recorded permanently. Blockchain can be used for an exchanging the transaction securely without an intermediate. It enables customer relationship and agile chain values and thereby integrating with IoT and Cloud technology. The functionality of distributed ledger is combined with blockchain security to solve the financial and non-financial industry problems. This paper proposes the blockchain technology with devices and creates a common platform and secure data communication.

APA, Harvard, Vancouver, ISO, and other styles

36

Fan, Caixiang, Sara Ghaemi, Hamzeh Khazaei, Yuxiang Chen, and Petr Musilek. "Performance Analysis of the IOTA DAG-Based Distributed Ledger." ACM Transactions on Modeling and Performance Evaluation of Computing Systems 6, no. 3 (September 30, 2021): 1–20. http://dx.doi.org/10.1145/3485188.

Full text

Abstract:

Distributed ledgers (DLs) provide many advantages over centralized solutions in Internet of Things projects, including but not limited to improved security, transparency, and fault tolerance. To leverage DLs at scale, their well-known limitation (i.e., performance) should be adequately analyzed and addressed. Directed acyclic graph-based DLs have been proposed to tackle the performance and scalability issues by design. The first among them, IOTA, has shown promising signs in addressing the preceding issues. IOTA is an open source DL designed for the Internet of Things. It uses a directed acyclic graph to store transactions on its ledger, to achieve a potentially higher scalability over blockchain-based DLs. However, due to the uncertainty and centralization of the deployed consensus, the current IOTA implementation exposes some performance issues, making it less performant than the initial design. In this article, we first extend an existing simulator to support realistic IOTA simulations and investigate the impact of different design parameters on IOTA’s performance. Then, we propose a layered model to help the users of IOTA determine the optimal waiting time to resend the previously submitted but not yet confirmed transaction. Our findings reveal the impact of the transaction arrival rate, tip selection algorithms, weighted tip selection algorithm randomness, and network delay on the throughput. Using the proposed layered model, we shed some light on the distribution of the confirmed transactions. The distribution is leveraged to calculate the optimal time for resending an unconfirmed transaction to the DL. The performance analysis results can be used by both system designers and users to support their decision making.

APA, Harvard, Vancouver, ISO, and other styles

37

Zhong, Wang, Wenlong Feng, Mengxing Huang, and Siling Feng. "ST-PBFT: An Optimized PBFT Consensus Algorithm for Intellectual Property Transaction Scenarios." Electronics 12, no. 2 (January 8, 2023): 325. http://dx.doi.org/10.3390/electronics12020325.

Full text

Abstract:

For the current Intellectual Property (IP) transaction scenario, consensus nodes need to simultaneously consensus transactions of the same transaction type, resulting in low consensus efficiency, accuracy, and reliability, which seriously hinders the development of intellectual property. Based on the consortium chain, this paper proposes a secure and efficient blockchain-distributed consensus algorithm, ST-PBFT (Shard Transaction Practical Byzantine Fault Tolerance), applied to the IP transaction scenario. The main contributions of ST-PBFT include the following: first, a grouping method based on the principle of consistent hashing is proposed to group consensus nodes, and nodes group consensus, which reduces the complexity of communication. Second, the transaction consensus group can process IP transactions in parallel, which improves the throughput of the algorithm. Third, a node reputation evaluation model is proposed, which can prevent byzantine nodes from being repeatedly elected as primary nodes. The experimental results show that ST-PBFT can significantly improve the consensus efficiency and reliability and reduce consensus latency.

APA, Harvard, Vancouver, ISO, and other styles

38

Mohan, C., B. Lindsay, and R. Obermarck. "Transaction management in the R* distributed database management system." ACM Transactions on Database Systems 11, no. 4 (December 1986): 378–96. http://dx.doi.org/10.1145/7239.7266.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Kraft, Peter, Qian Li, Xinjing Zhou, Peter Bailis, Michael Stonebraker, Matei Zaharia, and Xiangyao Yu. "Epoxy: ACID Transactions across Diverse Data Stores." Proceedings of the VLDB Endowment 16, no. 11 (July 2023): 2742–54. http://dx.doi.org/10.14778/3611479.3611484.

Full text

Abstract:

Developers are increasingly building applications that incorporate multiple data stores, for example to manage heterogeneous data. Often, these require transactional safety for operations across stores, but few systems support such guarantees. To solve this problem, we introduce Epoxy, a protocol for providing transactions across heterogeneous data stores. We make two contributions. First, we adapt multi-version concurrency control to a cross-data store setting, storing versioning information in record metadata and filtering reads with predicates on metadata so they only see record versions in a global transaction snapshot. Second, we show our design enables an atomic commit protocol that does not require data stores implement the participant protocol of two-phase commit, requiring only durable writes. We implement Epoxy for five data stores: Postgres, Elasticsearch, MongoDB, Google Cloud Storage, and MySQL. We evaluate it by adapting TPC-C and microservice workloads to a multi-data store environment. We find it has comparable performance to the distributed transaction protocol XA on TPC-C while providing stronger guarantees like isolation, and has overhead of <10% compared to a non-transactional baseline on read-mostly microservice workloads and 72% on write-heavy workloads.

APA, Harvard, Vancouver, ISO, and other styles

40

Li, Junru, Youyou Lu, Yiming Zhang, Qing Wang, Zhuo Cheng, Keji Huang, and Jiwu Shu. "SwitchTx." Proceedings of the VLDB Endowment 15, no. 11 (July 2022): 2881–94. http://dx.doi.org/10.14778/3551793.3551838.

Full text

Abstract:

Online-transaction-processing (OLTP) applications require the underlying storage system to guarantee consistency and serializability for distributed transactions involving large numbers of servers, which tends to introduce high coordination cost and cause low system performance. In-network coordination is a promising approach to alleviate this problem, which leverages programmable switches to move a piece of coordination functionality into the network. This paper presents a fast and scalable transaction processing system called SwitchTx. At the core of SwitchTx is a decentralized multi-switch in-network coordination mechanism, which leverages modern switches' programmability to reduce coordination cost while avoiding the central-switch-caused problems in the state-of-the-art Eris transaction processing system. SwitchTx abstracts various coordination tasks (e.g., locking, validating, and replicating) as in-switch gather-and-scatter (GaS) operations, and offloads coordination to a tree of switches for each transaction (instead of to a central switch for all transactions) where the client and the participants connect to the leaves. Moreover, to control the transaction traffic intelligently, SwitchTx reorders the coordination messages according to their semantics and redesigns the congestion control combined with admission control. Evaluation shows that SwitchTx outperforms current transaction processing systems in various workloads by up to 2.16X in throughput, 40.4% in latency, and 41.5% in lock time.

APA, Harvard, Vancouver, ISO, and other styles

41

Obermeier, Sebastian, Stefan Böttcher, Martin Hett, Panos K. Chrysanthis, and George Samaras. "Blocking reduction for distributed transaction processing within MANETs." Distributed and Parallel Databases 25, no. 3 (February 24, 2009): 165–92. http://dx.doi.org/10.1007/s10619-009-7033-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Gao, Shurui, and Weidong Meng. "Development of a Personalized Recommendation System for E-Commerce Products for Distributed Storage Systems." Computational Intelligence and Neuroscience 2022 (June 20, 2022): 1–13. http://dx.doi.org/10.1155/2022/4752981.

Full text

Abstract:

Because the distributed storage system is based on network technology, it can store data in multiple independent low-cost physical storage devices, and it is also suitable for large-capacity storage, so it has become more and more popular. Today, common applications of distributed storage systems include cloud storage services, data center storage services, and P2P storage services. Typical ones are GFS, HDFS, OceanStore, and Dynamo. Due to regional and economic differences, the development level of global e-commerce (b2c) is very inconsistent. b2c contains the following key tags: buying and selling, which is the core of the website platform. E-commerce provides business users with transparent information and high-quality cheap products. Logistics is the basic guarantee for customers to execute transactions, and it is also a strict indicator of the website platform. There will be many visits during the operation of the e-commerce system, and the number of users in the early stage will increase exponentially. A safe and efficient e-commerce system can provide users with one-stop transaction support and convenient transaction processes. The personalized recommendation system has formulated some rules for certain fields, based on these rules, and defined certain types of knowledge for certain items to meet the needs of certain users and use the defined reasoning rules to generate recommendation results.

APA, Harvard, Vancouver, ISO, and other styles

43

Mukkamala, R. "Efficient Schemes to Evaluate Transaction Performance in Distributed Database Systems." Computer Journal 33, no. 1 (January 1, 1990): 79–89. http://dx.doi.org/10.1093/comjnl/33.1.79.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Wedde, Horst F., and Sabine Böhm. "Adaptive Distributed Real-Time Transaction Management in Safety-Critical Systems." IFAC Proceedings Volumes 33, no. 7 (May 2000): 81–87. http://dx.doi.org/10.1016/s1474-6670(17)39937-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Nikolaou, C. N., M. Marazakis, and G. Georgiannakis. "Transaction routing for distributed OLTP systems: Survey and recent results." Information Sciences 97, no. 1-2 (March 1997): 45–82. http://dx.doi.org/10.1016/s0020-0255(96)00173-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Rahm, Erhard. "A Framework for workload allocation in distributed transaction processing systems." Journal of Systems and Software 18, no. 2 (May 1992): 171–90. http://dx.doi.org/10.1016/0164-1212(92)90126-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

B., Sriman, and Ganesh Kumar S. "Enhanced Transaction Confirmation Performances without Gas by Using Ethereum Blockchain." Webology 19, no. 1 (January 20, 2022): 5310–29. http://dx.doi.org/10.14704/web/v19i1/web19357.

Full text

Abstract:

Blockchain is the distributed decentralized application for developing many of the use cases. In blockchain, the applications are transparent to all the nodes in the decentralized network and the application may be private or public depends upon the use cases. The nodes in the distributed network shares all the data to the other nodes without any modification in the blockchain technology. The transaction by the node is secured through the digital signatures. In this paper, we implemented the application by confirming the transaction without paying the gas fee by deploying the smart contract. The solidity is a JavaScript programming language for writing our smart contract. We explained the gas optimization technique used by the users and the gas station network in a decentralized application and also explained about the parameters in the Ethereum transactions. We used the open zeppelin library, which allows us to run our 𝐷𝑎𝑝𝑝 to implement the gasless transaction.

APA, Harvard, Vancouver, ISO, and other styles

48

Lu, Yi, Xiangyao Yu, Lei Cao, and Samuel Madden. "Epoch-based commit and replication in distributed OLTP databases." Proceedings of the VLDB Endowment 14, no. 5 (January 2021): 743–56. http://dx.doi.org/10.14778/3446095.3446098.

Full text

Abstract:

Many modern data-oriented applications are built on top of distributed OLTP databases for both scalability and high availability. Such distributed databases enforce atomicity, durability, and consistency through two-phase commit (2PC) and synchronous replication at the granularity of every single transaction. In this paper, we present COCO, a new distributed OLTP database that supports epoch-based commit and replication. The key idea behind COCO is that it separates transactions into epochs and treats a whole epoch of transactions as the commit unit. In this way, the overhead of 2PC and synchronous replication is significantly reduced. We support two variants of optimistic concurrency control (OCC) using physical time and logical time with various optimizations, which are enabled by the epoch-based execution. Our evaluation on two popular benchmarks (YCSB and TPC-C) show that COCO outperforms systems with fine-grained 2PC and synchronous replication by up to a factor of four.

APA, Harvard, Vancouver, ISO, and other styles

49

Bhunje, Anagha, and Swati Ahirrao. "Workload Aware Incremental Repartitioning of NoSQL for Online Transactional Processing Applications." International Journal of Advances in Applied Sciences 7, no. 1 (March 1, 2018): 54. http://dx.doi.org/10.11591/ijaas.v7.i1.pp54-65.

Full text

Abstract:

Numerous applications are deployed on the web with the increasing popularity of internet. The applications include, 1) Banking applications, 2) Gaming applications, 3) E-commerce web applications. Different applications reply on OLTP (Online Transaction Processing) systems. OLTP systems need to be scalable and require fast response. Today modern web applications generate huge amount of the data which one particular machine and Relational databases cannot handle. The E-Commerce applications are facing the challenge of improving the scalability of the system. Data partitioning technique is used to improve the scalability of the system. The data is distributed among the different machines which results in increasing number of transactions. The work-load aware incremental repartitioning approach is used to balance the load among the partitions and to reduce the number of transactions that are distributed in nature. Hyper Graph Representation technique is used to represent the entire transactional workload in graph form. In this technique, frequently used items are collected and Grouped by using Fuzzy C-means Clustering Algorithm. Tuple Classification and Migration Algorithm is used for mapping clusters to partitions and after that tuples are migrated efficiently.

APA, Harvard, Vancouver, ISO, and other styles

50

Liu, Jianhua, Shengbo Sun, Zheng Chang, Bo Zhou, Yongli Wang, Jingyan Wang, and Shuo Wang. "Application of blockchain in integrated energy system transactions." E3S Web of Conferences 165 (2020): 01014. http://dx.doi.org/10.1051/e3sconf/202016501014.

Full text

Abstract:

Blockchain technology is the underlying technology of Bitcoin, which is fair, transparent and decentralized. The integrated energy system has the characteristics of open interconnection, user-centered and distributed peer-to-peer sharing, and its energy trading model will also be developed centrally to distributed. The characteristics of blockchain technology make it naturally applicable to energy transactions in integrated energy systems. This article first analyzes the characteristics of the integrated energy system market and summarizes the participants in the market. Then, based on the existing research and analysis, a blockchain-based energy transaction architecture is designed, and a weakly centralized management method is introduced. finally, the problems and challenges faced by the application of blockchain in energy transactions are analyzed.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Distributed transaction systems'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles