Relevant bibliographies by topics / Nested transaction systems

Contents

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

Academic literature on the topic 'Nested transaction systems'

Author: Grafiati
Published: 6 September 2023
Last updated: 31 July 2025

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 'Nested 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 "Nested transaction systems"

1

Haerder, Theo, and Kurt Rothermel. "Concepts for transaction recovery in nested transactions." ACM SIGMOD Record 16, no. 3 (1987): 239–48. http://dx.doi.org/10.1145/38714.38741.

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

Goldman, Kenneth J., and Nancy Lynch. "Quorum consensus in nested-transaction systems." ACM Transactions on Database Systems 19, no. 4 (1994): 537–85. http://dx.doi.org/10.1145/195664.195666.

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

MADRIA, SANJAY KUMAR, S. N. MAHESHWARI, B. CHANDRA, and BHARAT BHARGAVA. "FORMALIZATION AND PROOF OF CORRECTNESS OF THE CRASH RECOVERY ALGORITHM FOR AN OPEN AND SAFE NESTED TRANSACTION MODEL." International Journal of Cooperative Information Systems 10, no. 01n02 (2001): 1–50. http://dx.doi.org/10.1142/s0218843001000242.

Full text
Abstract:
In this paper, we present, formalize and prove the correctness of recovery algorithm for our open and safe nested transaction model using I/O automaton model. Our nested transaction model uses the notion of a recovery point subtransaction in the nested transaction tree. It introduces a prewrite operation before each write operation to increase the potential concurrency. Our transaction model is termed as "open and safe" as prewrites allow early reads (before database writes on disk) without cascading aborts. The systems restart and buffer management operations are modelled as nested transactio
APA, Harvard, Vancouver, ISO, and other styles
4

Kang, I. E., and T. F. Keefe. "Reliable Nested Transaction Processing for Multidatabase Systems." Integrated Computer-Aided Engineering 2, no. 1 (1995): 49–67. http://dx.doi.org/10.3233/ica-1995-2105.

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

Bertino, Elisa, Barbara Catania, and Elena Ferrari. "A nested transaction model for multilevel secure database management systems." ACM Transactions on Information and System Security 4, no. 4 (2001): 321–70. http://dx.doi.org/10.1145/503339.503340.

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

Madria, Sanjay Kumar, S. N. Maheshwari, B. Chandra, and Bharat Bhargava. "An open and safe nested transaction model: concurrency and recovery." Journal of Systems and Software 55, no. 2 (2000): 151–65. http://dx.doi.org/10.1016/s0164-1212(00)00067-4.

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

Vidyasankar, K. "Unified Theory of Database Serializability12." Fundamenta Informaticae 14, no. 2 (1991): 147–83. http://dx.doi.org/10.3233/fi-1991-14202.

Full text
Abstract:
A database system is a collection of data items, read or written by transactions in a possibly interleaved fashion. An interleaved execution is assumed to be correct if the sequence of the steps of the transactions, called history, is serializable, that is, the effect of the execution is equivalent to that of some serial execution of the same transactions. In this paper we give a new characterization of serializability that brings out the inherent problem of serialization explicitly. We then give a graph-theoretic analogue of serializable histories. We define a new class of graphs, called seri
APA, Harvard, Vancouver, ISO, and other styles
8

Madria, Sanjay Kumar, S. N. Maheshwari, and B. Chandra. "Virtual partition algorithm in a nested transaction environment and its correctness." Information Sciences 137, no. 1-4 (2001): 211–44. http://dx.doi.org/10.1016/s0020-0255(01)00111-6.

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

Zhu, Hang, Weina Niu, Xuhan Liao, et al. "Attacker Traceability on Ethereum through Graph Analysis." Security and Communication Networks 2022 (January 27, 2022): 1–12. http://dx.doi.org/10.1155/2022/3448950.

Full text
Abstract:
Since the Ethereum virtual machine is Turing complete, Ethereum can implement various complex logics such as mutual calls and nested calls between functions. Therefore, Ethereum has suffered a lot of attacks since its birth, and there are still many attackers active in Ethereum transactions. To this end, we propose a traceability method on Ethereum, using graph analysis to track attackers. We collected complete user transaction data to construct the graph and analyzed data on several harmful attacks, including reentry attacks, short address attacks, DDoS attacks, and Ponzi contracts. Through g
APA, Harvard, Vancouver, ISO, and other styles
10

Andronie, Mihai, Roman Blažek, Mariana Iatagan, et al. "Generative artificial intelligence algorithms in Internet of Things blockchain-based fintech management." Oeconomia Copernicana 15, no. 4 (2024): 1349–81. https://doi.org/10.24136/oc.3283.

Full text
Abstract:
Research background: Big data-driven artificial Internet of Things (IoT) fintech algorithms can provide real-time personalized financial service access, strengthen risk management, and manage, monitor, and mitigate transaction operational risks by operational credit risk management, suspicious financial transaction abnormal pattern detection, and synthetic financial data-based fraud simulation. Blockchain technologies, automated financial planning and investment advice services, and risk scoring and fraud detection tools can be leveraged in financial trading forecasting and planning, cryptocur
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Nested transaction systems"

1

Kim, Junwhan. "Scheduling Memory Transactions in Distributed Systems." Diss., Virginia Tech, 2013. http://hdl.handle.net/10919/24768.

Full text
Abstract:
Distributed transactional memory (DTM) is an emerging, alternative concurrency control model that promises to alleviate the difficulties of lock-based distributed synchronization. In DTM, transactional conflicts are traditionally resolved by a contention manager. A complementary approach for handling conflicts is through a transactional scheduler, which orders transactional requests to avoid or minimize conflicts. We present a suite of transactional schedulers: Bi-interval, Commutative Requests First (CRF), Reactive Transactional Scheduler (RTS), Dependency-Aware Transactional Scheduler} (DATS
APA, Harvard, Vancouver, ISO, and other styles
2

Turcu, Alexandru. "On Improving Distributed Transactional Memory through Nesting, Partitioning and Ordering." Diss., Virginia Tech, 2015. http://hdl.handle.net/10919/51593.

Full text
Abstract:
Distributed Transactional Memory (DTM) is an emerging, alternative concurrency control model that aims to overcome the challenges of distributed-lock based synchronization. DTM employs transactions in order to guarantee consistency in a concurrent execution. When two or more transactions conflict, all but one need to be delayed or rolled back. Transactional Memory supports code composability by nesting transactions. Nesting how- ever can be used as a strategy to improve performance. The closed nesting model enables partial rollback by allowing a sub-transaction to abort without aborting its p
APA, Harvard, Vancouver, ISO, and other styles
3

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
4

Hammond, Rex. "Post-deregulation passenger selection of US airports." Thesis, University of Manchester, 2018. https://www.research.manchester.ac.uk/portal/en/theses/postderegulation-passenger-selection-of-us-airports(563a5b4e-6931-4288-8f2d-6ffab8c1736a).html.

Full text
Abstract:
Airlines have endured a prolonged period of intense competition with the advent of deregulation in 1978. Market innovations and price-cutting dramatically expanded the number of travelers utilizing the national air transportation network. Bankruptcies and mergers reduced the number of contestants in the industry and eventually produced four national carriers controlling 80-85 percent of the passengers and routes. This new market power of the dominant airlines is resulting in industry changes designed to reduce operational uncertainty but is also having detrimental effects on many airports, par
APA, Harvard, Vancouver, ISO, and other styles
5

Rustagi, Ram Prakash. "Studies in concurrency control for centralized, distributed and nested transaction systems." Thesis, 1998. http://localhost:8080/iit/handle/2074/2211.

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

Books on the topic "Nested transaction systems"

1

Pardon, Guy. Composite Systems: Decentralized nested transactions. 2000.

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

Book chapters on the topic "Nested transaction systems"

1

Karabatis, George. "Nested Transaction Models." In Encyclopedia of Database Systems. Springer New York, 2017. http://dx.doi.org/10.1007/978-1-4899-7993-3_716-2.

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

Karabatis, George. "Nested Transaction Models." In Encyclopedia of Database Systems. Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_716.

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

Karabatis, George. "Nested Transaction Models." In Encyclopedia of Database Systems. Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_716.

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

Buchmann, Alejandro. "Open Nested Transaction Models." In Encyclopedia of Database Systems. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_717-2.

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

Buchmann, Alejandro. "Open Nested Transaction Models." In Encyclopedia of Database Systems. Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_717.

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

Buchmann, Alejandro. "Open Nested Transaction Models." In Encyclopedia of Database Systems. Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_717.

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

Lee, J. K., and A. Fekete. "Multi-granularity locking for nested transaction systems." In MFDBS 91. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54009-1_12.

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

Boertjes, Erik M., Paul W. P. J. Grefen, Jochem Vonk, and Peter M. G. Apers. "An architecture for nested transaction support on standard database systems." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0054503.

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

Rukoz, Marta. "A distributed solution for detecting deadlock in distributed nested transaction systems." In Distributed Algorithms. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51687-5_43.

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

Madria, Sanjay Kumar, S. N. Maheshwari, and B. Chandra. "On the Correctness of Virtual Partition Algorithm in a Nested Transaction Environment." In Advances in Databases and Information Systems. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48252-0_8.

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

Conference papers on the topic "Nested transaction systems"

1

Goldman, Kenneth J., and Nancy A. Lynch. "Quorum consensus in nested transaction systems." In the sixth annual ACM Symposium. ACM Press, 1987. http://dx.doi.org/10.1145/41840.41843.

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

Lee, John Kyu. "Precision locking for nested transaction systems." In the second international conference. ACM Press, 1993. http://dx.doi.org/10.1145/170088.170451.

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

Lee, John Kyu. "B-TREE CONCURRENCY CONTROL ALGORITHM FOR NESTED TRANSACTION SYSTEMS." In Proceedings of the 3rd International Symposium on Database Systems for Advanced Applications. WORLD SCIENTIFIC, 1993. http://dx.doi.org/10.1142/9789814503730_0024.

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

Tesch, Thomas, and Jürgen Wäsch. "Global nested transaction management for ODMG-compliant multi-database systems." In the sixth international conference. ACM Press, 1997. http://dx.doi.org/10.1145/266714.266861.

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

Niles, Duane, Roberto Palmieri, and Binoy Ravindran. "Exploiting Parallelism of Distributed Nested Transactions." In SYSTOR '16: International Conference on Systems and Storage. ACM, 2016. http://dx.doi.org/10.1145/2928275.2928287.

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

Chapman, Keith, Antony L. Hosking, and J. Eliot B. Moss. "Hybrid STM/HTM for nested transactions on OpenJDK." In SPLASH '16: Conference on Systems, Programming, Languages, and Applications: Software for Humanity. ACM, 2016. http://dx.doi.org/10.1145/2983990.2984029.

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

"ENHANCING THE SUCCESS RATIO OF DISTRIBUTED REAL-TIME NESTED TRANSACTIONS." In 6th International Conference on Enterprise Information Systems. SciTePress - Science and and Technology Publications, 2004. http://dx.doi.org/10.5220/0002615002330240.

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

Pavlova, Ekaterina, and Igor Nekrestyanov. "Concurrency Control Protocol for Nested Transactions in Real-Time Databases." In Proceedings of the First East-European Symposium on Advances in Databases and Information Systems. BCS Learning & Development, 1997. http://dx.doi.org/10.14236/ewic/adbis1997.33.

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

Takizawa, Makoto, and S. Misbah Deen. "Lock Mode Based Resolution of Uncompensatable Deadlock in Compensating Nested Transactions." In Proceedings of the Second Far-East Workshop on Future Database Systems. WORLD SCIENTIFIC, 1992. http://dx.doi.org/10.1142/9789814503624_0020.

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

Vu, Xuan-Tung, Mai Thuong Tran, Anh-Hoang Truong, and Martin Steffen. "A type system for finding upper resource bounds of multi-threaded programs with nested transactions." In the Third Symposium. ACM Press, 2012. http://dx.doi.org/10.1145/2350716.2350722.

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