Relevant bibliographies by topics / Distributed transaction processing

Contents

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

Academic literature on the topic 'Distributed transaction processing'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

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 processing.'

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 processing"

1

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
2

Jing, Changhong, Wenjie Liu, Jintao Gao, and Ouya Pei. "Research and implementation of HTAP for distributed database." Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University 39, no. 2 (April 2021): 430–38. http://dx.doi.org/10.1051/jnwpu/20213920430.

Full text
Abstract:
Data processing can be roughly divided into two categories, online transaction processing OLTP(on-line transaction processing) and online analytical processing OLAP(on-line analytical processing). OLTP is the main application of traditional relational databases, and it is some basic daily transaction processing, such as bank pipeline transactions and so on. OLAP is the main application of the data warehouse system, it supports some more complex data analysis operations, focuses on decision support, and provides popular and intuitive analysis results. As the amount of data processed by enterprises continues to increase, distributed databases have gradually replaced stand-alone databases and become the mainstream of applications. However, the current business supported by distributed databases is mainly based on OLTP applications, lacking OLAP implementation. This paper proposes an implementation method of HTAP for distributed database CBase, which provides an implementation method of OLAP analysis for CBase, and can easily deal with data analysis of large amounts of data.
APA, Harvard, Vancouver, ISO, and other styles
3

Kommareddy, Manjula, and Johnny Wong. "Non-blocking distributed transaction processing system." Journal of Systems and Software 54, no. 1 (September 2000): 65–76. http://dx.doi.org/10.1016/s0164-1212(00)00053-4.

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

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
5

Banks, Richard, Peter Furniss, Klaus Heien, and H. Rüdiger Wiehle. "OSI distributed transaction processing commitment optimizations." ACM SIGCOMM Computer Communication Review 28, no. 5 (October 1998): 61–75. http://dx.doi.org/10.1145/303297.303308.

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

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
7

Mills, John A. "Large scale interoperability and distributed transaction processing." Journal of Systems Integration 3, no. 3-4 (September 1993): 351–69. http://dx.doi.org/10.1007/bf01975520.

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

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
9

Chen, Graham. "Distributed transaction processing standards and their applications." Computer Standards & Interfaces 17, no. 4 (September 1995): 363–73. http://dx.doi.org/10.1016/0920-5489(95)00005-f.

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

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
More sources

Dissertations / Theses on the topic "Distributed transaction processing"

1

McCue, Daniel Lawrence. "Selective transparency in distributed transaction processing." Thesis, University of Newcastle Upon Tyne, 1992. http://hdl.handle.net/10443/2020.

Full text
Abstract:
Object-oriented programming languages provide a powerful interface for programmers to access the mechanisms necessary for reliable distributed computing. Using inheritance and polymorphism provided by the object model, it is possible to develop a hierarchy of classes to capture the semantics and inter-relationships of various levels of functionality required for distributed transaction processing. Using multiple inheritance, application developers can selectively apply transaction properties to suit the requirements of the application objects. In addition to the specific problems of (distributed) transaction processing in an environment of persistent objects, there is a need for a unified framework, or architecture in which to place this system. To be truly effective, not only the transaction manager, but the entire transaction support environment must be described, designed and implemented in terms of objects. This thesis presents an architecture for reliable distributed processing in which the management of persistence, provision of transaction properties (e.g., concurrency control), and organisation of support services (e.g., RPC) are all gathered into a unified design based on the object model.
APA, Harvard, Vancouver, ISO, and other styles
2

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
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 73-79).
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.
"This work was supported (in part) by the U.S. National Science Foundation (CCF-1438955)"
by Yu Xia.
S.M.
S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
APA, Harvard, Vancouver, ISO, and other styles
3

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
4

Wilkenloh, Christopher Joselane. "Design of a reliable message transaction protocol." Thesis, Georgia Institute of Technology, 1989. http://hdl.handle.net/1853/8307.

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

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
6

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
7

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.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
8

Poti, Allison Tamara S. "Building a multi-tier enterprise system utilizing visual Basic, MTS, ASP, and MS SQL." Virtual Press, 2001. http://liblink.bsu.edu/uhtbin/catkey/1221293.

Full text
Abstract:
Multi-tier enterprise systems consist of more than two distributed tiers. The design of multi-tier systems is considerably more involved than two tier systems. Not all systems should be designed as multi-tier, but if the decision to build a multi-tier system is made, there are benefits to this type of system design. CSCources is a system that tracks computer science course information. The requirements of this system indicate that it should be a multi-tier system. This system has three tiers, client, business and data. Microsoft tools are used such as Visual Basic (VB) that was used to build the client tier that physically resides on the client machine. VB is also used to create the business tier. This tier consists of the business layer and the data layer. The business layer contains most of the business logic for the system. The data layer communicates with the data tier. Microsoft SQL Server (MS SQL) is used for the data store. The database containsseveral tables and stored procedures. The stored procedures are used to add, edit, update and delete records in the database. Microsoft Transaction Server (MTS) is used to control modifications to the database. The transaction and security features available in the MTS environment are used. The business tier and data tier may or may not reside on the same physical computer or server. Active Server Pages (ASP) was built that accesses the business tier to retrieve the needed information for display on a web page. The cost of designing a distributed system, building a distributed system, upgrades to the system and error handling are examined.Ball State UniversityMuncie, IN 47306
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
9

Kendric, Hood A. "Improving Cryptocurrency Blockchain Security and Availability Adaptive Security and Partitioning." Kent State University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=kent1595038779436782.

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

Pu, Calton. "Replication and nested transactions in the Eden Distributed System /." Thesis, Connect to this title online; UW restricted, 1986. http://hdl.handle.net/1773/6881.

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

Books on the topic "Distributed transaction processing"

1

Roger, Jennings, and Lievano Rick A, eds. Microsoft Transaction Server 2.0. Indianapolis, IN: Sams Publishing, 1997.

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

Veijalainen, Jari. Transaction concepts in autonomous database environments. München: R. Oldenbourg, 1990.

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

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

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

Ng, Pui. A commit protocol for resilient transaction. Urbana, IL (1304 W. Springfield Ave., Urbana 61801): Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1987.

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

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

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

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

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

Nested transactions: An approach to reliable distributed computing. Cambridge, Mass: MIT Press, 1985.

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

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

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

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

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

Dwyer, Terence, Juan M. Andrade, Mark Carges, and Stephen Felts. The TUXEDO System: Software for Constructing and Managing Distributed Business Applications. Addison-Wesley Professional, 1996.

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

Book chapters on the topic "Distributed transaction processing"

1

Özsu, M. Tamer, and Patrick Valduriez. "Distributed Transaction Processing." In Principles of Distributed Database Systems, 183–246. Cham: 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
2

Weik, Martin H. "distributed transaction processing." In Computer Science and Communications Dictionary, 444. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_5412.

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

Rai, Rebika. "Distributed Transaction Processing." In NoSQL: Database for Storage and Retrieval of Data in Cloud, 1–22. Boca Raton, FL : CRC Press, Taylor & Francis Group, [2016] |Includes bibliographical references and index.: Chapman and Hall/CRC, 2017. http://dx.doi.org/10.1201/9781315155579-2.

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

Schill, Alexander. "Online Transaction Processing." In Das OSF Distributed Computing Environment, 231–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-60731-8_10.

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

Whiteley, David. "Transaction and Distributed Processing." In Introduction to Information Systems, 246–55. London: 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

Pitoura, Evaggelia, Panos K. Chrysanthis, and George Samaras. "Distributed Databases and Transaction Processing." In Mobile Agents in Networking and Distributed Computing, 219–42. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2012. http://dx.doi.org/10.1002/9781118135617.ch9.

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

Spector, Alfred Z. "Distributed Transaction Processing and The Camelot System." In Distributed Operating Systems, 331–53. Berlin, Heidelberg: 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
8

Kunkelmann, Thomas, Hartmut Vogler, and Susan Thomas. "Interoperability of distributed transaction processing systems." In Trends in Distributed Systems CORBA and Beyond, 177–90. Berlin, Heidelberg: 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

Lacoste, Gérard. "Distributed transaction processing in the IBC." In Lecture Notes in Computer Science, 377–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/bfb0013429.

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

Alonso, Gustavo, and C. Mohan. "Workflow Management: The Next Generation of Distributed Processing Tools." In Advanced Transaction Models and Architectures, 35–59. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6217-7_2.

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

Conference papers on the topic "Distributed transaction processing"

1

Daniels, Dean S., Alfred Z. Spector, and Dean S. Thompson. "Distributed logging for transaction processing." In the 1987 ACM SIGMOD international conference. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/38713.38728.

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

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
3

Spector, A. Z., R. F. Pausch, and G. Bruell. "Camelot: a flexible, distributed transaction processing system." In COMPCON Spring 88. IEEE, 1988. http://dx.doi.org/10.1109/cmpcon.1988.4907.

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

Lin, Zhian, and Chi Zhang. "A Transaction Processing Method for Distributed Database." In Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019). Paris, France: Atlantis Press, 2019. http://dx.doi.org/10.2991/icmeit-19.2019.58.

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

Djemaiel, Yacine, and Noureddine Boudriga. "Intrusion detection and tolerance for transaction based applications in wireless environments." In Distributed Processing (IPDPS). IEEE, 2009. http://dx.doi.org/10.1109/ipdps.2009.5161244.

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

Wook Stephen Do, Sang, and Michel Dubois. "Transaction-Based Core Reliability." In 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2020. http://dx.doi.org/10.1109/ipdps47924.2020.00027.

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

Sherman, Mark. "Architecture of the Encina distributed transaction processing family." In the 1993 ACM SIGMOD international conference. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/170035.170136.

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

Ibrahim, Romani Farid. "Mobile Transaction Processing for a Distributed War Environment." In 2019 14th International Conference on Computer Science & Education (ICCSE). IEEE, 2019. http://dx.doi.org/10.1109/iccse.2019.8845475.

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

Sun, Qiao, Lan-mei Fu, Bu-qiao Deng, and Jiasong Sun. "An efficient transaction processing method on the distributed database." In 2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI). IEEE, 2016. http://dx.doi.org/10.1109/cisp-bmei.2016.7853031.

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

Suganuma, Toshio, Akira Koseki, Kazuaki Ishizaki, Yohei Ueda, Ken Mizuno, Daniel Silva, Hideaki Komatsu, and Toshio Nakatani. "Distributed and fault-tolerant execution framework for transaction processing." In the 4th Annual International Conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1987816.1987819.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Distributed transaction processing' for particular source types:
Journal articles Dissertations / Theses Books
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