Relevant bibliographies by topics / Distributed transaction systems

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Distributed transaction systems'

Author: Grafiati
Published: 6 September 2023

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Distributed transaction systems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Distributed transaction systems"

1

BOCCHI, LAURA, and EMILIO TUOSTO. "Attribute-based transactions in service oriented computing." Mathematical Structures in Computer Science 25, no. 3 (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 (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 (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 (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 (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 (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, et al. "FoundationDB: A Distributed Key-Value Store." Communications of the ACM 66, no. 6 (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 (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

Dissertations / Theses on the topic "Distributed transaction systems"

1

Xia, Yu S. M. Massachusetts Institute of Technology. "Logical timestamps in distributed transaction processing systems." Thesis, Massachusetts Institute of Technology, 2018. https://hdl.handle.net/1721.1/122877.

Full text
Abstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 73-79).<br>Distributed transactions are such transactions with remote data access. They usually suffer from high network latency (compared to the internal overhead) during data operations on remote data servers, and therefore lengthen the entire transaction executiont time. This increases the probability of conflicting with other transactions, causing high abort rates. This, in turn, causes poor performance. In this work, we constructed Sundial, a distributed concurrency control algorithm that applies logical timestamps seaminglessly with a cache protocol, and works in a hybrid fashion where an optimistic approach is combined with lock-based schemes. Sundial tackles the inefficiency problem in two ways. Firstly, Sundial decides the order of transactions on the fly. Transactions get their commit timestamp according to their data access traces. Each data item in the database has logical leases maintained by the system. A lease corresponds to a version of the item. At any logical time point, only a single transaction holds the 'lease' for any particular data item. Therefore, lease holders do not have to worry about someone else writing to the item because in the logical timeline, the data writer needs to acquire a new lease which is disjoint from the holder's. This lease information is used to calculate the logical commit time for transactions. Secondly, Sundial has a novel caching scheme that works together with logical leases. The scheme allows the local data server to automatically cache data from the remote server while preserving data coherence. We benchmarked Sundial along with state-of-the-art distributed transactional concurrency control protocols. On YCSB, Sundial outperforms the second best protocol by 57% under high data access contention. On TPC-C, Sundial has a 34% improvement over the state-of-the-art candidate. Our caching scheme has performance gain comparable with hand-optimized data replication. With high access skew, it speeds the workload by up to 4.6 x.<br>"This work was supported (in part) by the U.S. National Science Foundation (CCF-1438955)"<br>by Yu Xia.<br>S.M.<br>S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
APA, Harvard, Vancouver, ISO, and other styles
2

Xie, Wanxia. "Supporting Distributed Transaction Processing Over Mobile and Heterogeneous Platforms." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/14073.

Full text
Abstract:
Recent advances in pervasive computing and peer-to-peer computing have opened up vast opportunities for developing collaborative applications. To benefit from these emerging technologies, there is a need for investigating techniques and tools that will allow development and deployment of these applications on mobile and heterogeneous platforms. To meet these challenging tasks, we need to address the typical characteristics of mobile peer-to-peer systems such as frequent disconnections, frequent network partitions, and peer heterogeneity. This research focuses on developing the necessary models, techniques and algorithms that will enable us to build and deploy collaborative applications in the Internet enabled, mobile peer-to-peer environments. This dissertation proposes a multi-state transaction model and develops a quality aware transaction processing framework to incorporate quality of service with transaction processing. It proposes adaptive ACID properties and develops a quality specification language to associate a quality level with transactions. In addition, this research develops a probabilistic concurrency control mechanism and a group based transaction commit protocol for mobile peer-to-peer systems that greatly reduces blockings in transactions and improves the transaction commit ratio. To the best of our knowledge, this is the first attempt to systematically support disconnection-tolerant and partition-tolerant transaction processing. This dissertation also develops a scalable directory service called PeerDS to support the above framework. It addresses the scalability and dynamism of the directory service from two aspects: peer-to-peer and push-pull hybrid interfaces. It also addresses peer heterogeneity and develops a new technique for load balancing in the peer-to-peer system. This technique comprises an improved routing algorithm for virtualized P2P overlay networks and a generalized Top-K server selection algorithm for load balancing, which could be optimized based on multiple factors such as proximity and cost. The proposed push-pull hybrid interfaces greatly reduce the overhead of directory servers caused by frequent queries from directory clients. In order to further improve the scalability of the push interface, this dissertation also studies and evaluates different filter indexing schemes through which the interests of each update could be calculated very efficiently. This dissertation was developed in conjunction with the middleware called System on Mobile Devices (SyD).
APA, Harvard, Vancouver, ISO, and other styles
3

Dixon, Eric Richard. "Developing distributed applications with distributed heterogenous databases." Thesis, Virginia Tech, 1993. http://hdl.handle.net/10919/42748.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Andersson, Joachim, and Byggnings Johan Lindbom. "Reducing the load on transaction-intensive systems through distributed caching." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-186676.

Full text
Abstract:
Scania is an international trucks, buses and engines manufacturer with sales and service organization in more than 100 countries all over the globe (Scania, 2011). In 2011 alone, Scania delivered over 80 000 vehicles, which is an increase by a margin of 26% from the previous year. The company continues to deliver more trucks each year while expanding to other areas of the world, which means that the data traffic is going to increase remarkably in the transaction- intensive fleet management system (FMS). This increases the need for a scalable system; adding more sources to handle these requests in parallel. Distributed caching is one technique that can solve this issue. The technique makes applications and systems more scalable, and it can be used to reduce load on the underlying data sources. The purpose of this thesis is to evaluate whether or not distributed caching is a suitable technical solution for Scania FMS. The aim of the study is to identify scenarios in FMS where a distributed cache solution could be of use, and to test the performance of two distributed cache products while simulating these scenarios.  The results from the tests are then used to evaluate the distributed cache products and to compare distributed caching performance to a single database. The products evaluated in this thesis are Alachisoft NCache and Microsoft Appfabric. The results from the performance tests show that that NCache outperforms AppFabric in all aspects. In conclusion, distributed caching has been demonstrated  to be a viable option when scaling out the system.
APA, Harvard, Vancouver, ISO, and other styles
5

Hirve, Sachin. "On the Fault-tolerance and High Performance of Replicated Transactional Systems." Diss., Virginia Tech, 2015. http://hdl.handle.net/10919/56668.

Full text
Abstract:
With the recent technological developments in last few decades, there is a notable shift in the way business/consumer transactions are conducted. These transactions are usually triggered over the internet and transactional systems working in the background ensure that these transactions are processed. The majority of these transactions nowadays fall in Online Transaction Processing (OLTP) category, where low latency is preferred characteristic. In addition to low latency, OLTP transaction systems also require high service continuity and dependability. Replication is a common technique that makes the services dependable and therefore helps in providing reliability, availability and fault-tolerance. Deferred Update Replication (DUR) and Deferred Execution Replication (DER) represent the two well known transaction execution models for replicated transactional systems. Under DUR, a transaction is executed locally at one node before a global certification is invoked to resolve conflicts against other transactions running on remote nodes. On the other hand, DER postpones the transaction execution until the agreement on a common order of transaction requests is reached. Both DUR and DER require a distributed ordering layer, which ensures a total order of transactions even in case of faults. In today's distributed transactional systems, performance is of paramount importance. Any loss in performance, e.g., increased latency due to slow processing of client requests, may entail loss of revenue for businesses. On one hand, the DUR model is a good candidate for transaction processing in those systems in case the conflicts among transactions are rare, while it can be detrimental for high conflict workload profiles. On the other hand, the DER model is an attractive choice because of its ability to behave as independent of the characteristics of the workload, but trivial realizations of the model ultimately do not offer a good performance increase margin. Indeed transactions are executed sequentially and the total order layer can be a serious bottleneck for latency and scalability. This dissertation proposes novel solutions and system optimizations to enhance the overall performance of replicated transactional systems. The first presented result is HiperTM, a DER-based transaction replication solution that is able to alleviate the costs of the total order layer via speculative execution techniques. HiperTM exploits the time that is between the broadcast of a client request and the finalization of the order for that request to speculatively execute the request, so to achieve an overlapping between replicas coordination and transactions execution. HiperTM proposes two main components: OS-Paxos, a novel total order layer that is able to early deliver requests optimistically according to a tentative order, which is then either confirmed or rejected by a final total order; SCC, a lightweight speculative concurrency control protocol that is able to exploit the optimistic delivery of OS-Paxos and execute transactions in a speculative fashion. SCC still processes write transactions serially in order to minimize the code instrumentation overheads, but it is able to parallelize the execution of read-only transactions thanks to its built-in object multiversion scheme. The second contribution in this dissertation is X-DUR, a novel transaction replication system that addressed the high cost of local and remote aborts in case of high contention on shared objects in DUR based approaches, due to which the performance is adversely affected. Exploiting the knowledge of client's transaction locality, X-DUR incorporates the benefits of state machine approach to scale-up the distributed performance of DUR systems. As third contribution, this dissertation proposes Archie, a DER-based replicated transactional system that improves HiperTM in two aspects. First, Archie includes a highly optimized total order layer that combines optimistic-delivery and batching thus allowing the anticipation of a big amount of work before the total order is finalized. Then the concurrency control is able to process transactions speculatively and with a higher degree of parallelism, although the order of the speculative commits still follows the order defined by the optimistic delivery. Both HiperTM and Archie perform well up to a certain number of nodes in the system, beyond which their performance is impacted by limitations of single leader-based total-order layer. This motivates the design of Caesar, the forth contribution of this dissertation, which is a transactional system based on a novel multi-leader partial order protocol. Caesar enforces a partial order on the execution of transactions according to their conflicts, by letting non-conflicting transactions to proceed in parallel and without enforcing any synchronization during the execution (e.g., no locks). As the last contribution, this dissertation presents Dexter, a replication framework that exploits the commonly observed phenomenon such that not all read-only workloads require up-to-date data. It harnesses the application specific freshness and content-based constraints of read-only transactions to achieve high scalability. Dexter services the read-only requests according to the freshness guarantees specified by the application and routes the read-only workload accordingly in the system to achieve high performance and low latency. As a result, Dexter framework also alleviates the interference between read-only requests and read-write requests thereby helping to improve the performance of read-write requests execution as well.<br>Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
6

Chan, Kinson, and 陳傑信. "Distributed software transactional memory with clock validation on clusters." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hub.hku.hk/bib/B5053404X.

Full text
Abstract:
Within a decade, multicore processors emerged and revolutionised the world of computing. Nowadays, even a low-end computer comes with a multi-core processor and is capable running multiple threads simultaneously. It becomes impossible to make the best computation power out from a computer with a single-threaded program. Meanwhile, writing multi-threaded software is daunting to a lot of programmers as the threads share data and involve complicated synchronisation techniques such as locks and conditions. Software transactional memory is a promising alternative model that programmers simply need to understand transactional consistency and segment code into transactions. Programming becomes exciting again, without races, deadlocks and other issues that are common in lock-based paradigms. To pursue high throughput, performance-oriented computers have several multicore processors per each. A processor’s cache is not directly accessible by the cores in other processors, leading to non-uniform latency when the threads share data. These computers no longer behave like the classical symmetric multiprocessor computers. Although old programs continue to work, they do not necessary benefit from the added cores and caches. Most software transactional memory implementations fall into this category. They rely on a centralised and shared meta-variable (like logical clock) in order to provide the single-lock atomicity. On a computer with two or more multicore processors, the single and shared meta-variable gets regularly updated by different processors. This leads to a tremendous amount of cache contentions. Much time is spent on inter-processor cache invalidations rather than useful computations. Nevertheless, as computers with four processors or more are exponentially complex and expensive, people would desire solving sophisticated problems with several smaller computers whenever possible. Supporting software transactional consistency across multiple computers is a rarely explored research area. Although we have similar mature research topics such as distributed shared memory and distributed relational database, they have remarkably different characteristics so that most of the implementation techniques and tricks are not applicable to the new system. There are several existing distributed software transactional memory systems, but we feel there is much room for improvement. One crucial area is the conflict detection mechanism. Some of these systems make use of broadcast messages to commit transactions, which are certainly not scalable for large-scale clusters. Others use directories to direct messages to the relevant nodes only, but they also keep visible reader lists for invalidation per node. Updating a shared reader lists involves cache invalidations on processors. Reading shared data on such systems are more expensive compared to the conventional low-cost invisible reader validation systems. In this research, we aim to have a distributed software transactional memory system, with distributed clock validation for conflict detection purpose. As preparation, we first investigate some issues such as concurrency control and conflict detection in single-node systems. Finally, we combine the techniques with a tailor-made cache coherence protocol that is differentiated from typical distributed shared memory.<br>published_or_final_version<br>Computer Science<br>Doctoral<br>Doctor of Philosophy
APA, Harvard, Vancouver, ISO, and other styles
7

Mena, Eduardo Illarramendi Arantza. "Ontology-based query processing for global information systems /." Boston [u.a.] : Kluwer Acad. Publ, 2001. http://www.loc.gov/catdir/enhancements/fy0813/2001029621-d.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wu, Jiang. "CHECKPOINTING AND RECOVERY IN DISTRIBUTED AND DATABASE SYSTEMS." UKnowledge, 2011. http://uknowledge.uky.edu/cs_etds/2.

Full text
Abstract:
A transaction-consistent global checkpoint of a database records a state of the database which reflects the effect of only completed transactions and not the re- sults of any partially executed transactions. This thesis establishes the necessary and sufficient conditions for a checkpoint of a data item (or the checkpoints of a set of data items) to be part of a transaction-consistent global checkpoint of the database. This result would be useful for constructing transaction-consistent global checkpoints incrementally from the checkpoints of each individual data item of a database. By applying this condition, we can start from any useful checkpoint of any data item and then incrementally add checkpoints of other data items until we get a transaction- consistent global checkpoint of the database. This result can also help in designing non-intrusive checkpointing protocols for database systems. Based on the intuition gained from the development of the necessary and sufficient conditions, we also de- veloped a non-intrusive low-overhead checkpointing protocol for distributed database systems. Checkpointing and rollback recovery are also established techniques for achiev- ing fault-tolerance in distributed systems. Communication-induced checkpointing algorithms allow processes involved in a distributed computation take checkpoints independently while at the same time force processes to take additional checkpoints to make each checkpoint to be part of a consistent global checkpoint. This thesis develops a low-overhead communication-induced checkpointing protocol and presents a performance evaluation of the protocol.
APA, Harvard, Vancouver, ISO, and other styles
9

Blackshaw, Bruce Philip. "Migration of legacy OLTP architectures to distributed systems." Thesis, Queensland University of Technology, 1997. https://eprints.qut.edu.au/36839/1/36839_Blackshaw_1997.pdf.

Full text
Abstract:
Mincom, a successful Australian software company, markets an enterprise product known as the Mincom Information Management System, or MIMS. MIMS is an integrated suite of modules covering materials, maintenance, financials, and human resources management. MIMS is an on-line transaction processing (OLTP) system, meaning it has special requirements in the areas of pe,jormance and scalability. MIMS consists of approxiniately 16 000 000 lines of code, most of which is written in COBOL. Its basic architecture is 3-tier client/server, utilising a database layer, application logic layer, and a Graphical User Inte,face (GUI). While this architecture has proved successful, Mincom is looking to gradually evolve MIMS into a distributed architecture. COREA is the target distributed framework. The development of an enterprise distributed system is fraught with difficulties. Key technical problems are not yet solved, and Mincom cannot afford the risk and cost involved in rewriting MIMS completely. The only viable approach is to gradually evolve MIMS into the desired architecture using a hybrid system that allows clients to access existing and new functionality. This thesis addresses the design and development of distributed systems, and the evolution of existing legacy systems into this architecture. It details the current MIMS architecture, and explains some of its shortcomings. The desirable characteristics of a new system based on a distributed architecture such as COREA are outlined. A case is established for a gradual migration of the current system via a hybrid system rather than a complete rewrite. Two experimental systems designed to investigate the proposed new architecture are discussed. The conclusion reached from the first, known as Genesis, is that the maturity of CORBA for ente1prise development is not sufficient-12-18 months are estimated to be required for the appropriate level of maturity to be reached. The second system, EGEN, demonstrates how workflow can be integrated into a distributed system. An event-based workflow architecture is demonstrated, and it is explained how a workflow event server can be used to provide workflow services across a hybrid system. EGEN also demonstrates how a middleware gateway can be used to allow COREA clients access to the functionality of the existing MIMS system. Finally, a proposed migration strategy for moving MIMS to a distributed architecture based on COREA is outlined. While developed specifically for MIMS, this strategy is broadly applicable to the migration of any large 3-tier client/server system to a distributed architecture.
APA, Harvard, Vancouver, ISO, and other styles
10

Rocha, Tarcisio da. "Serviços de transação abertos para ambientes dinamicos." [s.n.], 2008. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276015.

Full text
Abstract:
Orientador: Maria Beatriz Felgar de Toledo<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-13T03:59:50Z (GMT). No. of bitstreams: 1 Rocha_Tarcisioda_D.pdf: 1796192 bytes, checksum: 4b25ccccc2fa363f13a02764136f5208 (MD5) Previous issue date: 2008<br>Resumo: Tecnicas de processamento de transações tem sido de grande importancia no que diz respeito a preservação da correção em diversas areas da computação. Devido a funções como, garantir a consistencia de dados, a recuperação de falhas e o controle de concorrencia, transações são consideradas blocos de construção apropriados para a estruturação de sistemas confiaveis. Contudo, desenvolver tecnicas de apoio a transações para ambientes dinamicos pode ser uma tarefa complexa. O primeiro obstaculo esta no proprio dinamismo - a disponibilidade de recursos pode variar inesperadamente. Isso pode causar dois efeitos diretos: altas taxas de cancelamento de transações e grandes atrasos na execução das tarefas transacionais. O segundo obstaculo esta na crescente flexibilização do conceito de transação. Isso ocorre porque os requisitos transacionais exigidos pelas aplicações atuais estão se tornando mais variados, indo al'em das propriedades tradicionalmente definidas para uma transação. Nesse contexto, esta tese aborda a viabilização de serviços de transações abertos, ou seja, capazes de terem sua estrutura e comportamento configurados pelos programadores de aplicações como um meio de atender a requisitos especificos do dominio de suas aplicações. Como parte desse estudo foi proposto um modelo que abstrai alguns elementos arquiteturais como jumpers, slots e demultiplexadores que podem ser usados na especificação de pontos de configuração em serviços de transação. Esse modelo e implementado como uma camada acima de um modelo de componentes existente. Com isso, desenvolvedores de serviços de transação passam a contar com esses elementos abertos alem daqueles disponibilizados por abordagens tradicionais baseadas em componentes. Para confirmar os beneficios em usabilidade, flexibilidade e extensão, esta tese apresenta dois serviços de transação abertos que foram especificados com base no modelo proposto. O primeiro serviço faz parte de uma plataforma de transações adaptavel para ambientes de computação movel. O segundo serviço faz parte de um sistema que prove adaptação dinamica de protocolos de efetivação (commit) de transações. Segundo os testes realizados, a abordagem apresentada nesta tese trouxe a esses serviços a capacidade de atender requisitos de aplicações de diferentes dominios.<br>Abstract: Transaction processing techniques are considered important solutions on preserving correctness in several fields of computing. Due their functions such as, failure recovery and concurrency control, transactions are considered appropriated building blocks for structuring reliable systems. Despite its advantages, to develop transaction systems for dynamic environments is not an easy task. The first problem is the dynamism - the resource availability can vary unexpectedly. This can cause the following side effects: high transaction abort rates and relevant delays of transaction operations. The second problem is the flexibilization of the transaction concept. The transactional requirements are becoming more diversified - they extrapolate the bounds of the traditional transactional properties. In this context, this thesis approaches the practicability of open transaction services that can be configured by the application programmers for attending specific requirements of different application domains. This thesis includes a model that abstracts some architectural elements (slots, jumpers and demultiplexers) that can be used for specifying configuration points in transaction services. To confirm its benefits on usability, flexibility and extension, this thesis presents two open transaction services that were specified based on the proposed model. The first service is part of an adaptable transaction platform for mobile computing environments. The second service is part of a system that provides dynamic adaptation of commit protocols. According the accomplished tests, the approach presented in this thesis is able to give to these services the capacity of attending the requirement of applications in different domains.<br>Doutorado<br>Sistemas Distribuidos<br>Doutor em Ciência da Computação
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Distributed transaction systems"

1

N, Chorafas Dimitris. Transaction management: Managing complex transactions and sharing distributed databases. St. Martin's Press, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Breitbart, Y. Overview of multidatabase transaction management. Stanford University, Dept. of Computer Science, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Primatesta, Fulvio. TUXEDO, an open approach to OLTP. Prentice Hall, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Company, X/Open, ed. Distributed transaction processing: CPI-C specification, Version 2. X/Open, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bhalla, Subhash. Implementing message oriented transaction processing for distributed database management systems. Sloan School of Management, Massachusetts Institute of Technology, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Prusinski, Ben. Expert Oracle GoldenGate. Apress, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

1951-, Andrade Juan M., ed. The TUXEDO System: Software for constructing and managing distributed business applications. Addison-Wesley Pub., 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Prusinski, Ben. Expert Oracle GoldenGate. Apress, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Michał, Kapałka, ed. Principles of transactional memory. Morgan & Claypool, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Arantza, Illarramendi, ed. Ontology-based query processing for global information systems. Kluwer Academic Publishers, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Distributed transaction systems"

1

Tok, Wee Hyong. "Distributed Transaction Management." In Encyclopedia of Database Systems. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_710-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tok, Wee Hyong. "Distributed Transaction Management." In Encyclopedia of Database Systems. Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_710.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tok, Wee Hyong. "Distributed Transaction Management." In Encyclopedia of Database Systems. Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_710.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Özsu, M. Tamer, and Patrick Valduriez. "Distributed Transaction Processing." In Principles of Distributed Database Systems. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-26253-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Whiteley, David. "Transaction and Distributed Processing." In Introduction to Information Systems. Macmillan Education UK, 2004. http://dx.doi.org/10.1007/978-1-137-10325-3_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Spector, Alfred Z. "Distributed Transaction Processing and The Camelot System." In Distributed Operating Systems. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-642-46604-5_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Rouvoy, Romain, Patricia Serrano-Alvarado, and Philippe Merle. "Towards Context-Aware Transaction Services." In Distributed Applications and Interoperable Systems. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11773887_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kunkelmann, Thomas, Hartmut Vogler, and Susan Thomas. "Interoperability of distributed transaction processing systems." In Trends in Distributed Systems CORBA and Beyond. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61842-2_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Özsu, M. Tamer, and Patrick Valduriez. "Introduction to Transaction Management." In Principles of Distributed Database Systems, Third Edition. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-8834-8_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Banatre, Michel. "An Experience in Solving a Transaction Ordering Problem in a Distributed System." In Distributed Operating Systems. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-642-46604-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Distributed transaction systems"

1

Silva, Flávio M. Assis, Raimundo J. A. Macêdo, and Ana Vitoria Piaggio Freitas. "The MARES Platform: Support for Transactional and Fault-tolerant Execution of Mobile Agent-based Applications." In Workshop de Testes e Tolerância a Falhas. Sociedade Brasileira de Computação - SBC, 2003. http://dx.doi.org/10.5753/wtf.2003.23392.

Full text
Abstract:
Support for transactional behaviour and fault tolerant executions of mobile agent-based applications is a fundamental issue in the development of mobile agent systems. We are developing the MARES platform, which supports the modelling of mobile agent-based applications as distributed transactions. The executions of mobile agent-based transactions on top of the MARES platform are fault-tolerant, in the sense that if the location in the distributed environment where a part of a global transaction is being executed becomes faulty for a long time, the system performs a recovery procedure to resume the execution of that part of the transaction at another location. In this paper we present the transaction model used in the MARES platform, we outline the interface for modelling mobile agent-based transactions, and we discuss alternatives for implementing mobile agent fault tolerance that increase the level of flexibility for modelling reliable mobile agent-based applications when compared with previously proposed approaches.
APA, Harvard, Vancouver, ISO, and other styles
2

Damoah, Dominic, James B. Hayfron-Acquah, Shamo Sebastian, Edward Ansong, Brighter Agyemang, and Roy Villafane. "Transaction recovery in federated distributed database systems." In 2014 International Conference on Computer Communication & Systems (ICCCS). IEEE, 2014. http://dx.doi.org/10.1109/icccs.2014.7068178.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Fan, Hua, and Wojciech Golab. "Scalable Transaction Processing Using Functors." In 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS). IEEE, 2018. http://dx.doi.org/10.1109/icdcs.2018.00101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Groothuis, S. S., and S. Stramigioli. "Energy Budget Transaction Protocol for Distributed Robotic Systems." In 2019 International Conference on Robotics and Automation (ICRA). IEEE, 2019. http://dx.doi.org/10.1109/icra.2019.8794388.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Das, Ratul Antik, Md Muhaimin Shah Pahalovi, and Muhammad Nur Yanhaona. "Transaction Finality through Ledger Checkpoints." In 2019 IEEE 25th International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2019. http://dx.doi.org/10.1109/icpads47876.2019.00036.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Žežulka, Miloslav, Ondřej Chaloupka, and Bruno Rossi. "Integrating Distributed Tracing into the Narayana Transaction Manager." In 6th International Conference on Complexity, Future Information Systems and Risk. SCITEPRESS - Science and Technology Publications, 2021. http://dx.doi.org/10.5220/0010448200550062.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Amiri, Mohammad Javad, Divyakant Agrawal, and Amr El Abbadi. "ParBlockchain: Leveraging Transaction Parallelism in Permissioned Blockchain Systems." In 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS). IEEE, 2019. http://dx.doi.org/10.1109/icdcs.2019.00134.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sebestyen, Gh, and A. Hangan. "Transaction-based model for real-time distributed control systems." In 2008 IEEE International Conference on Automation, Quality and Testing, Robotics. IEEE, 2008. http://dx.doi.org/10.1109/aqtr.2008.4588814.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, Rui. "Identifying Performance-Critical Components in Transaction-Oriented Distributed Systems." In Fourth International Conference on Autonomic Computing (ICAC'07). IEEE, 2007. http://dx.doi.org/10.1109/icac.2007.24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Liao, Xintao, Ligang Dong, and Chuanhuang Li. "A Generic Transaction Model for ForCES-Based Distributed Systems." In 2009 Fifth International Joint Conference on INC, IMS and IDC. IEEE, 2009. http://dx.doi.org/10.1109/ncm.2009.298.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Distributed transaction systems"

1

Bielinskyi, Andrii O., Oleksandr A. Serdyuk, Сергій Олексійович Семеріков, Володимир Миколайович Соловйов, Андрій Іванович Білінський, and О. А. Сердюк. Econophysics of cryptocurrency crashes: a systematic review. Криворізький державний педагогічний університет, 2021. http://dx.doi.org/10.31812/123456789/6974.

Full text
Abstract:
Cryptocurrencies refer to a type of digital asset that uses distributed ledger, or blockchain technology to enable a secure transaction. Like other financial assets, they show signs of complex systems built from a large number of nonlinearly interacting constituents, which exhibits collective behavior and, due to an exchange of energy or information with the environment, can easily modify its internal structure and patterns of activity. We review the econophysics analysis methods and models adopted in or invented for financial time series and their subtle properties, which are applicable to time series in other disciplines. Quantitative measures of complexity have been proposed, classified, and adapted to the cryptocurrency market. Their behavior in the face of critical events and known cryptocurrency market crashes has been analyzed. It has been shown that most of these measures behave characteristically in the periods preceding the critical event. Therefore, it is possible to build indicators-precursors of crisis phenomena in the cryptocurrency market.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography