Academic literature on the topic 'Transaction processing systems'

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 'Transaction processing 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 "Transaction processing systems"

1

Jain, Ashish. "Transaction Processing in Mobile Database Systems." SAMRIDDHI : A Journal of Physical Sciences, Engineering and Technology 7, no. 02 (December 25, 2015): 87–92. http://dx.doi.org/10.18090/samriddhi.v7i2.8631.

Full text
Abstract:
In a mobile computing environment, a potentially large number of mobile and fixed users may simultaneously access shared data; therefore, there is a need to provide a means to allow concurrent management of transactions. Specific characteristics of mobile environments make traditional transaction management techniques no longer appropriate. This is due the fact that the ACID properties of transactions are not simply followed, in particular the consistency property. Thus, transaction management models adopting weaker form of consistency are needed and these models can now tolerate a limited amount of consistency. In this paper we have proposed (execution framework based on common ground shared by most of mobile transaction models found in the literature and investigate it under different execution strategies. More over, the effects of the fixed host transaction are identified and included in the evaluation The integration between wired and wireless environments confirms that the execution strategy is critical for the performance of a system. Neither MHS nor FHS are optimal in all situations and the performance penalties and wasted wireless resources can be substantial. A combined strategy CHS at least matches the best performance of the FHS and MHS and shows better performance than both in many cases.
APA, Harvard, Vancouver, ISO, and other styles
2

Singh, Munindar P., Christine Tomlinson, and Darrell Woelk. "Relaxed transaction processing." ACM SIGMOD Record 23, no. 2 (June 1994): 505. http://dx.doi.org/10.1145/191843.191949.

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

Marifati, Imam Soleh, and Vadlya Maarif. "Sistem Informasi Akuntansi Pemesanan dan Pembayaran (Ordering and Billing) Makanan dan Minuman Berbasis Android Pada RM. Ayam Goreng “Padamara” Purbalingga." Indonesian Journal on Software Engineering (IJSE) 4, no. 2 (July 23, 2019): 33–38. http://dx.doi.org/10.31294/ijse.v4i2.5978.

Full text
Abstract:
Abstract - Ordering and billing transactions of food and beverages in a restaurant business are in the revenue cycle. Transactions in the revenue cycle have an important role for the company because from this transaction the company gets cash income. The use of information technology to support the transaction process can increase the effectiveness of the transaction process. Transactions can be processed quickly and accurately. Restaurant business can use accounting information systems to improve the effectiveness and efficiency of transaction processes in the revenue cycle. A computer-based accounting information system is needed in processing transactions. In this study, the authors developed the application of accounting information systems to process transactions in the revenue cycle for restaurant business activities. This application processes transaction data starting from ordering, payment and making revenue reports from restaurant business activities. Keywords: Order, Billing, Accounting Information System
APA, Harvard, Vancouver, ISO, and other styles
4

Maliq, Rizky Gelar, R. Rizal Isnanto, and Ike Pertiwi Windasari. "Sistem Pemrosesan Transaksi Pada Toko Bangunan Berbasis Web Dengan PHP dan MySQL." Jurnal Teknologi dan Sistem Komputer 2, no. 2 (April 30, 2014): 170–74. http://dx.doi.org/10.14710/jtsiskom.2.2.2014.170-174.

Full text
Abstract:
Building supply store is a business entity engaged in the sale of construction materials for the building. Where there are still use the transaction data were administrative in bookkeeping way , so it takes a long time to figure out the sale and purchase transactions. Therefore, the author here takes issue in the sale and purchase itself. Transaction processing systems created using PHP programming language and MySQL database. System where this information can help in recording the transaction in the building supply store . In addition to recording can also be used for the preparation of monthly reports. The expected result from design of this transaction processing systems is to build a computerized information system to facilitate the operator in the transaction. With this expected to improve customer service so well that the presentation of information in a relatively quick and accurate transactions. Moreover, it can accelerate the collection of goods to see inventory and preparing reports.
APA, Harvard, Vancouver, ISO, and other styles
5

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
6

Leff, A., and C. Pu. "A classification of transaction processing systems." Computer 24, no. 6 (June 1991): 63–76. http://dx.doi.org/10.1109/2.86839.

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

Lewis, Philip M., Arthur Bernstein, and Michael Kifer. "Databases and transaction processing." ACM SIGMOD Record 31, no. 1 (March 2002): 74–75. http://dx.doi.org/10.1145/507338.507354.

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

Gaffney, Kevin P., Robert Claus, and Jignesh M. Patel. "Database isolation by scheduling." Proceedings of the VLDB Endowment 14, no. 9 (May 2021): 1467–80. http://dx.doi.org/10.14778/3461535.3461537.

Full text
Abstract:
Transaction isolation is conventionally achieved by restricting access to the physical items in a database. To maximize performance, isolation functionality is often packaged with recovery, I/O, and data access methods in a monolithic transactional storage manager. While this design has historically afforded high performance in online transaction processing systems, industry trends indicate a growing need for a new approach in which intertwined components of the transactional storage manager are disaggregated into modular services. This paper presents a new method to modularize the isolation component. Our work builds on predicate locking, an isolation mechanism that enables this modularization by locking logical rather than physical items in a database. Predicate locking is rarely used as the core isolation mechanism because of its high theoretical complexity and perceived overhead. However, we show that this overhead can be substantially reduced in practice by optimizing for common predicate structures. We present DIBS, a transaction scheduler that employs our predicate locking optimizations to guarantee isolation as a modular service. We evaluate the performance of DIBS as the sole isolation mechanism in a data processing system. In this setting, DIBS scales up to 10.5 million transactions per second on a TATP workload. We also explore how DIBS can be applied to existing database systems to increase transaction throughput. DIBS reduces per-transaction file system writes by 90% on TATP in SQLite, resulting in a 3X improvement in throughput. Finally, DIBS reduces row contention on YCSB in MySQL, providing serializable isolation with a 1.4X improvement in throughput.
APA, Harvard, Vancouver, ISO, and other styles
9

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
10

Appelbaum, Deniz, and Robert A. Nehmer. "Auditing Cloud-Based Blockchain Accounting Systems." Journal of Information Systems 34, no. 2 (October 25, 2019): 5–21. http://dx.doi.org/10.2308/isys-52660.

Full text
Abstract:
ABSTRACT In this research, we often refer to Nakamoto's (2008) seminal paper, “Bitcoin: A Peer-to-Peer Electronic Cash System,” to consider his proposed abstracted characteristics and how auditors could look at companies' transactions interfacing to a private/semi-private blockchain with Nakamoto's general characteristics and address the related audit domain for such transactions. We then take these design requirements for auditors and, using design science research (DSR), we consider the transaction processing and contracting contexts that match those requirements in permissioned blockchains.The blockchains discussed in this paper would typically be business-to-business or business-to-consumer, private or semi-private, and residing in either a private, semi-private, or public cloud. Those blockchains will each have their own design and operational procedures, including validation procedures (the miners). We consider the audit issues of data reliability, data security, and transaction transparency in accounting transactions that lend themselves to a permissioned blockchain as well as other contextual issues.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Transaction processing systems"

1

Prabhu, Nitin Kumar Vijay. "Transaction processing in Mobile Database System." Diss., UMK access, 2006.

Find full text
Abstract:
Thesis (Ph. D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2006.
"A dissertation in computer science and informatics and telecommunications and computer networking." Advisor: Vijay Kumar. Typescript. Vita. Title from "catalog record" of the print edition Description based on contents viewed Nov. 9, 2007. Includes bibliographical references (leaves 152-157). Online version of the print edition.
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

Dwyer, Barry. "Automatic design of batch processing systems." Title page, abstract, table of contents and introduction only, 1999. http://web4.library.adelaide.edu.au/theses/09PH/09phd993.pdf.

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

Hui, Chui Ying. "Broadcast algorithms and caching strategies for mobile transaction processing." HKBU Institutional Repository, 2007. http://repository.hkbu.edu.hk/etd_ra/781.

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

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
6

Chan, Yew Meng. "Processing mobile read-only transactions in broadcast environments with group consistency /." access full-text access abstract and table of contents, 2005. http://libweb.cityu.edu.hk/cgi-bin/ezdb/thesis.pl?mphil-cs-b19887504a.pdf.

Full text
Abstract:
Thesis (M.Phil.)--City University of Hong Kong, 2005.
"Submitted to Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Philosophy" Includes bibliographical references (leaves 98-102)
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

Reid, Elizabeth G. "Design and evaluation of a benchmark for main memory transaction processing systems." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53162.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Includes bibliographical references (p. 63).
We designed a diverse collection of benchmarks for Main Memory Database Systems (MMDBs) to validate and compare entries in a programming contest. Each entrant to the contest programmed an indexing system optimized for multicore multithread execution. The contest framework provided an API for the contestants, and benchmarked their submissions. This thesis describes the test goals, the API, and the test environment. It documents the website used by the contestants, describes the general nature of the tests run on each submission, and summarizes the results for each submission that was able to complete the tests.
by Elizabeth G. Reid.
M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
9

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
10

Flodin, Anton. "Leerec : A scalable product recommendation engine suitable for transaction data." Thesis, Mittuniversitetet, Avdelningen för informationssystem och -teknologi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-33941.

Full text
Abstract:
We are currently living in the Internet of Things (IoT) era, which involves devices that are connected to Internet and are communicating with each other. Each year, the number of devices increases rapidly, which result in rapid growth of data that is generated. This large amount of data is sometimes titled as Big Data, which is generated from different sources, such as log data of user behavior. These log files can be collected and analyzed in different ways, such as creating product recommendations. Product recommendations have been around since the late 90s, when the amount of data collected were not at the same level as it is today. The aim of this thesis has been to investigating methods to process and create product recommendations to see how well they are adapted for Big Data. This has been accomplished by three theory studies on how to process user events, how to make the product recommendation algorithm called collaborative filtering scalable and finally how to convert implicit feedback to explicit feedback (ratings). This resulted in a recommendation engine consisting of Apache Spark as the data processing system, which had three functions: read multiple log files and concatenate log files for each month, parsing the log files of the user events to create explicit ratings from the transactions and create four types of recommendations. The NoSQL database MongoDB was chosen as the database to store the different types of product recommendations that was created. To be able to get the recommendations from the recommendation engine and the database, a REST API was implemented which can be used by any third-party. What can be concluded from the results of this thesis work is that the system that was implemented is partial scalable. This means that Apache Spark was scalable for both concatenating files, parse and create ratings and also create the recommendations using the ALS method. However, MongoDB was shown to be not scalable when managing more than 100 concurrent requests. Future work involves making the recommendation engine distributed in a multi-node cluster to utilize the parallelization of Apache Spark. Other recommendations include considering other NoSQL databases that might be more scalable than MongoDB.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Transaction processing systems"

1

Krishnamurthy, E. V. Transaction processing systems. New York: Prentice Hall, 1991.

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

Claybrook, Billy G. OLTP, online transaction processing systems. New York: J. Wiley, 1992.

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

Eric, Newcomer, ed. Principles of transaction processing. 2nd ed. Amsterdam: Morgan Kaufmann Publishers, 2009.

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

Eric, Newcomer, ed. Principles of transaction processing. San Francisco, Calif: Morgan Kaufmann Publishers, 1997.

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

Jim, Gray. Transaction processing: Concepts and techniques. San Mateo, Calif: Morgan Kaufmann Publishers, 1993.

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

Bog, Anja. Benchmarking Transaction and Analytical Processing Systems. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-38070-9.

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

Performance analysis of transaction processing systems. Englewood Cliffs, N.J: Prentice Hall, 1989.

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

Atluri, Vijay. Multilevel secure transaction processing. Boston: Kluwer Academic, 2000.

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

Martin, R. Jason. Transaction processing facility: A guide for application programmers. Englewood Cliffs, N.J: Yourdon Press, 1990.

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

Boockholdt, James L. Accounting information systems: Transaction processing and controls. Homewood, IL: Irwin, 1991.

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

Book chapters on the topic "Transaction processing systems"

1

Ray, Indrakshi, and Thilina Buddhika. "Secure Transaction Processing." In Encyclopedia of Database Systems, 1–11. New York, NY: Springer New York, 2017. http://dx.doi.org/10.1007/978-1-4899-7993-3_331-3.

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

Ray, Indrakshi. "Secure Transaction Processing." In Encyclopedia of Database Systems, 2540–46. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_331.

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

Ray, Indrakshi, and Thilina Buddhika. "Secure Transaction Processing." In Encyclopedia of Database Systems, 3358–69. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_331.

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, 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
5

Hansson, Jörgen, and Ming Xiong. "Real-Time Transaction Processing." In Encyclopedia of Database Systems, 1–6. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_721-2.

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

Hansson, Jörgen, and Ming Xiong. "Real-Time Transaction Processing." In Encyclopedia of Database Systems, 1–6. New York, NY: Springer New York, 2017. http://dx.doi.org/10.1007/978-1-4899-7993-3_721-3.

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

Hansson, Jörgen, and Ming Xiong. "Real-Time Transaction Processing." In Encyclopedia of Database Systems, 2344–48. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_721.

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

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
9

Hansson, Jörgen, and Ming Xiong. "Real-Time Transaction Processing." In Encyclopedia of Database Systems, 3114–19. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_721.

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

Bever, M., M. Feldhoffer, and S. Pappe. "OSI services for transaction processing." In High Performance Transaction Systems, 1–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51085-0_40.

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

Conference papers on the topic "Transaction processing systems"

1

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
2

He, Tao, and Jianxin Li. "Adaptive Hybrid Transaction Processing with Hardware Transaction Memory." In 2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS). IEEE, 2019. http://dx.doi.org/10.1109/hpcc/smartcity/dss.2019.00245.

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

Xin Qi, Decheng Zuo, Zhan Zhang, and Xiaozong Yang. "Cost evaluation of component fault under transaction processing workload." In 2012 7th International Conference on System of Systems Engineering (SoSE). IEEE, 2012. http://dx.doi.org/10.1109/sysose.2012.6333425.

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

Young-Kuk Kim and Sang H. Son. "An Approach Towards Predictable Real-Time Transaction Processing." In Fifth Euromicro Workshop on Real-Time Systems. IEEE, 1993. http://dx.doi.org/10.1109/emwrt.1993.639058.

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

"AN INTELLIGENT TUTORING SYSTEM FOR DATABASE TRANSACTION PROCESSING." In 6th International Conference on Enterprise Information Systems. SciTePress - Science and and Technology Publications, 2004. http://dx.doi.org/10.5220/0002606701970203.

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

George, Binto, and Jayant Haritsa. "Secure transaction processing in firm real-time database systems." In the 1997 ACM SIGMOD international conference. New York, New York, USA: ACM Press, 1997. http://dx.doi.org/10.1145/253260.253362.

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

Economo, Simone, Emiliano Silvestri, Pierangelo Di Sanzo, Alessandro Pellegrin, and Francesco Quaglia. "Model-Based Proactive Read-Validation in Transaction Processing Systems." In 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2018. http://dx.doi.org/10.1109/padsw.2018.8644605.

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

Polyzois, Christos A., and Hector Garcia-Molina. "Evaluation of remote backup algorithms for transaction processing systems." In the 1992 ACM SIGMOD international conference. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/130283.130321.

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

Neeraj, K. R., P. S. Janardhanan, Anu Bonia Francis, and Reena Murali. "A domain specific language for business transaction processing." In 2017 IEEE International Conference on Signal Processing, Informatics, Communication and Energy Systems (SPICES). IEEE, 2017. http://dx.doi.org/10.1109/spices.2017.8091270.

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

Wei, Xingda, Jiaxin Shi, Yanzhe Chen, Rong Chen, and Haibo Chen. "Fast in-memory transaction processing using RDMA and HTM." In SOSP '15: ACM SIGOPS 25th Symposium on Operating Systems Principles. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2815400.2815419.

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

Reports on the topic "Transaction processing systems"

1

Barker, S. Integrated Information Support System (IISS). Volume 6. Network Transaction Manager Subsystem. Part 6. Network Transaction Manager (NTM) Message Processing Unit Product Specification. Fort Belvoir, VA: Defense Technical Information Center, September 1990. http://dx.doi.org/10.21236/ada250481.

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

Rabbin, Robert. Integrated Information Support System (IISS). Volume 6. Network Transaction Manager Subsystem. Part 6. NTM Message Processing Unit Product Specification. Fort Belvoir, VA: Defense Technical Information Center, November 1985. http://dx.doi.org/10.21236/ada182061.

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

Perdigão, Rui A. P. Beyond Quantum Security with Emerging Pathways in Information Physics and Complexity. Synergistic Manifolds, June 2022. http://dx.doi.org/10.46337/220602.

Full text
Abstract:
Information security and associated vulnerabilities have long been a pressing challenge, from the fundamental scientific backstage to the frontline across the most diverse sectors of society. At the tip of the iceberg of this problem, the citizens immediately feel that the reservation of privacy and the degradation of the quality and security of the information and communication on which they depend for the day-to-day activities, already of crucial relevance, are at stake. Naturally though, the challenges do not end there. There is a whole infrastructure for storing information, processing and communication, whose security and reliability depend on key sectors gearing modern society – such as emergency communication systems (medical, civil and environmental protection, among others), transportation and geographic information, the financial communications systems at the backbone of day-to-day transactions, the information and telecommunications systems in general. And crucially the entire defence ecosystem that in essence is a stalwart in preventing our civilisation to self-annihilate in full fulfilment of the second principle of thermodynamics. The relevance of the problem further encompasses the preservation of crucial values such as the right to information, security and integrity of democratic processes, internal administration, justice, defence and sovereignty, ranging from the well-being of the citizen to the security of the nation and beyond. In the present communication, we take a look at how to scientifically and technically empower society to address these challenges, with the hope and pragmatism enabled by our emerging pathways in information physics and complexity. Edging beyond classical and quantum frontiers and their vulnerabilities to unveil new principles, methodologies and technologies at the core of the next generation system dynamic intelligence and security. To illustrate the concepts and tools, rather than going down the road of engineered systems that we can ultimately control, we take aim at the bewildering complexity of nature, deciphering new secrets in the mathematical codex underlying its complex coevolutionary phenomena that so heavily impact our lives, and ultimately bringing out novel insights, methods and technologies that propel information physics and security beyond quantum frontiers.
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