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

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 (December 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 (December 1994): 537–85. http://dx.doi.org/10.1145/195664.195666.

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

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

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

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 (March 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 transactions to exploit possible concurrency during restart. Each non-access transaction, object, and the scheduler is modeled as I/O automaton. Each of these automata is specified with the help of some pre-and post-conditions. These pre-and post-conditions capture the operational semantics and the behavior of each automaton during recovery operations. Our proof technique makes use of assertional reasoning and provide many interesting invariant, thus gives a better understanding of our recovery algorithm.
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 (November 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 (December 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 (February 1, 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 serializable graphs, whose properties are such that (i) a serializable graph can be associated with each serializable history, and this can be done for various notions of serializability of histories and for serializability under various sets of constraints, and (ii) a serializable history, in fact a serial one, can be associated with each serializable graph. We use serializable graphs to characterize, in an intuitive manner, serializable histories involving general multi-step transactions, where the same data item can be accessed by several read and write steps of a transaction in an arbitrary manner, and those involving nested transactions. We also define a new notion of serializability for nested transactions. This enables relating several acceptable concurrent executions of transactions, that are not serializable with the traditional transaction concept, to sequential behaviour. Serializability under this notion is also characterized. The main graph-theoretic properties used in these characterizations are a directed cutset matching property and graph contraction.
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 (September 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, Xiaosong Zhang, Xiaofen Wang, Beibei Li, and Zheyuan He. "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 graph analysis, we found accounts that are strongly associated with these attacks and are still active. We have done a systematic analysis of these accounts to analyze their threats. Finally, we also analyzed the correlation between the information collected through RPC and these accounts and finally found that some accounts can find their IP addresses.
APA, Harvard, Vancouver, ISO, and other styles
10

Mohammadian, Abolfazl, and Eric J. Miller. "Empirical Investigation of Household Vehicle Type Choice Decisions." Transportation Research Record: Journal of the Transportation Research Board 1854, no. 1 (January 2003): 99–106. http://dx.doi.org/10.3141/1854-11.

Full text
Abstract:
Automobile ownership models are an integral part of comprehensive transportation modeling systems. Recent work and ongoing advances in the area of activity-based travel demand modeling have recognized the need for increased experimentation with automobile choice models. On the other hand, while automobiles are very important in people's everyday lives, they also have a serious impact on the environment. This impact occurs at the micro level (pollution) as well as the macro level (emission of greenhouse gases and global warming). Such impacts have led to increased interest in reducing motor vehicle emissions. A household automobile type choice model was developed at a disaggregate level. The model can provide a direct forecast of consumer demand for personal-use vehicles given the available choices. A well-developed form of discrete choice modeling techniques, the nested logit model, was used to investigate the process of household automobile type choice decisions given that a transaction has occurred.
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), Scheduling-based Parallel Nesting} (SPN), Cluster-based Transactional Scheduler} (CTS), and Locality-aware Transactional Scheduler} (LTS). The schedulers consider Herlihy and Sun's dataflow execution model, where transactions are immobile and objects are migrated to invoking transactions, relying on directory-based cache-coherence protocols to locate and move objects. Within this execution model, the proposed schedulers target different DTM models. Bi-interval considers the single object copy DTM model, and categorizes concurrent requests into read and write intervals to maximize the concurrency of read transactions. This allows an object to be simultaneously sent to read transactions, improving transactional makespan. We show that Bi-interval improves the makespan competitive ratio of DTM without such a scheduler to O(log(N)) for the worst-case and (log(N - k) for the average-case, for N nodes and k read transactions. Our implementation reveals that Bi-interval enhances transactional throughput over the no-scheduler case by as much as 1.71x, on average. CRF considers multi-versioned DTM. Traditional multi-versioned TM models use multiple object versions to guarantee commits of read transactions, but limit concurrency of write transactions. CRF relies on the notion of commutative transactions, i.e., those that ensure consistency of the shared data-set even when they are validated and committed concurrently. CRF detects conflicts between commutative and non-commutative write transactions and then schedules them according to the execution state, enhancing the concurrency of write transactions. Our implementation shows that transactional throughput is improved by up to 5x over a state-of-the-art competitor (DecentSTM). RTS and DATS consider transactional nesting in DTM, and focus on the closed and open nesting models, respectively. RTS determines whether a conflicting outer transaction must be aborted or enqueued according to the level of contention. If a transaction is enqueued, its closed-nested transactions do not have to retrieve objects again, resulting in reduced communication delays. DATS's goal is to boost the throughput of open-nested transactions by reducing the overhead of running expensive compensating actions and acquiring/releasing abstract locks when the outer transaction aborts. The contribution of DATS is twofold. First, it allows commutable outer transactions to be validated concurrently and allows non-commutable outer transactions -- depending on their inner transactions -- to be committed before others without dependencies. Implementations reveal effectiveness: RTS and DATS improve throughput (over the no-scheduler case), by as much as 1.88x and 2.2x, respectively. SPN considers parallel nested transactions in DTM. The idea of parallel nesting is to execute the inner transactions that access different objects concurrently, and execute the inner transactions that access the same objects serially, increasing performance. However, the parallel nesting model may be ineffective if all inner transactions access the same object due to the additional overheads needed to identify both types of inner transactions. SPN avoids this overhead and allows inner transactions to request objects and to execute them in parallel. Implementations reveal that SPN outperforms non-parallel nesting (i.e., closed nesting) by up to 3.5x and 4.5x on a micro-benchmark (bank) and the TPC-C transactional benchmark, respectively. CTS considers the replicated DTM model: object replicas are distributed across clusters of nodes, where clusters are determined based on inter-node distance, to maximize locality and fault-tolerance, and to minimize memory usage and communication overhead. CTS enqueues transactions that are aborted due to early validation over clusters and assigns their backoff times, reducing communication overhead. Implementation reveals that CTS improves throughput over competitor replicated DTM solutions including GenRSTM and DecentSTM by as much as 1.64x, on average. LTS considers the genuine partial replicated DTM model. In this model, LTS exploits locality by: 1) employing a transaction scheduler, which enables/disables object ownership changes depending on workload fluctuations, and 2) splitting hot-spot objects into multiple replicas for reducing contention. Our implementation reveals that LTS outperforms state-of-the-art competitors (Score and CTS) by up to 2.6x on micro-benchmarks (Linked List and Skip List) and by up to 2.2x on TPC-C.
Ph. D.
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 parent, thus reducing the amount of work that needs to be retried. In the open nesting model, sub- transactions can commit to the shared state independently of their parents. This reduces isolation and increases concurrency. Our first main contribution in this dissertation are two extensions to the existing Transac- tional Forwarding Algorithm (TFA). Our extensions are N-TFA and TFA-ON, and support closed nesting and open nesting, respectively. We additionally extend the existing SCORe algorithm with support for open nesting (we call the result SCORe-ON). We implement these algorithms in a Java DTM framework and evaluate them. This represents the first study of transaction nesting in the context of DTM, and contributes the first DTM implementation which supports closed nesting or open nesting. Closed nesting through our N-TFA implementation proved insufficient for any significant throughput improvements. It ran on average 2% faster than flat nesting, while performance for individual tests varied between 42% slowdown and 84% speedup. The workloads that benefit most from closed nesting are characterized by short transactions, with between two and five sub-transactions. Open nesting, as exemplified by our TFA-ON and SCORe-ON implementations, showed promising results. We determined performance improvement to be a trade-off between the overhead of additional commits and the fundamental conflict rate. For write-intensive, high- conflict workloads, open nesting may not be appropriate, and we observed a maximum speedup of 30%. On the other hand, for lower fundamental-conflict workloads, open nesting enabled speedups of up to 167% in our tests. In addition to the two nesting algorithms, we also develop Hyflow2, a high-performance DTM framework for the Java Virtual Machine, written in Scala. It has a clean Scala API and a compatibility Java API. Hyflow2 was on average two times faster than Hyflow on high-contention workloads, and up to 16 times faster in low-contention workloads. Our second main contribution for improving DTM performance is automated data partition- ing. Modern transactional processing systems need to be fast and scalable, but this means many such systems settled for weak consistency models. It is however possible to achieve all of strong consistency, high scalability and high performance, by using fine-grained partitions and light-weight concurrency control that avoids superfluous synchronization and other over- heads such as lock management. Independent transactions are one such mechanism, that rely on good partitions and appropriately defined transactions. On the downside, it is not usually straightforward to determine optimal partitioning schemes, especially when dealing with non-trivial amounts of data. Our work attempts to solve this problem by automating the partitioning process, choosing the correct transactional primitive, and routing transactions appropriately. Our third main contribution is Alvin, a system for managing concurrently running trans- actions on a geographically replicated data-store. Alvin supports general-purpose transactions, and guarantees strong consistency criteria. Through a novel partial order broadcast protocol, Alvin maximizes the parallelism of ordering and local transaction processing, resulting in low client-perceived latency. Alvin can process read-only transactions either lo- cally or globally, according to the desired consistency criterion. Conflicting transactions are ordered across all sites. We built Alvin in the Go programming language. We conducted our evaluation study on Amazon EC2 infrastructure and compared against Paxos- and EPaxos- based state machine replication protocols. Our results reveal that Alvin provides significant speed-up for read-dominated TPC-C workloads: as much as 4.8x when compared to EPaxos on 7 datacenters, and up to 26% in write-intensive workloads. Our fourth and final contribution is M2Paxos, a multi-leader implementation of Generalized Consensus. Single leader-based consensus protocols are known to stop scaling once the leader reaches its saturation point. Ordering commands based on conflicts is appealing due to the potentially higher parallelism, but is imperfect due to the higher quorum sizes required for fast decisions and the need to compare commands and track their dependencies. M2Paxos on the other hand exploits fast decisions (i.e., delivery of a command in two communication delays) by leveraging a classic quorum size, matching a majority of nodes deployed. M2Paxos does not establish command dependencies based on conflicts, but it binds accessed objects to nodes, making sure commands operating on the same object will be ordered by the same node. Our evaluation study of M2Paxos (also built in Go) confirms the effectiveness of this approach, getting up to 7⨉ improvements in performance over state- of-the-art consensus and generalized consensus algorithms.
Ph. D.
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, particularly the smallest airports. This study employs qualitative and quantitative methods to explore the viability of the nation’s smallest primary commercial service airports. Three journal articles are fused in examining different aspects of the viability question. In Article 1, a longitudinal comparative analysis presents historic growth patterns for various sized airports during deregulation and reveals a distinctly lower growth rate for nonhub airports than their larger rivals. Even with a burgeoning market for travelers, growth for nonhub airports was anemic and the industry experienced massive passenger migration to the 60 largest airports. Article 2 addresses the topic of consumer switching, expands on extant literature with qualitative analyses, and proposes a theoretic, conceptual framework of four primary types of traveler purchasers. Each traveler type has its own distinct switching rationale and creates leakage patterns contoured to the features of their preferred airport. Building on the migration and switching findings of the first two articles, Article 3 explores converging market conditions and factors that are threatening future airline service for dozens of the smallest airports. By extracting findings from contemporary research, a comparative analysis of airports identifies 33 airports that face the highest risk of losing air service. The explanatory model places the airports in rank order by weighting various threat criteria. Qualitative interviews of air service professionals offer insider observations generally not known to the public, confirm observations found in existing research and verify that market forces are acting to reduce the number of airports in the network. The key contribution of the three articles of the thesis is its description of how key actors (firms, customers, agencies) interact and respond to policy decisions that have unintended consequences to small airports and their regional economies. There are predictable patterns in the relational linkages of these actors that contribute to our understanding of how a particular industry evolves under various pressures and how it interacts with factors outside the industry. The preponderance of the evidence from this study reveals that current market trends are generally caustic to the continued operation of small airports. Industry experts are reticent in acknowledging that the next phase of deregulation is underway with the consolidation of the nation’s nonhub airports.
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

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

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, 1–4. New York, NY: 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, 1896–99. Boston, MA: 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, 2485–89. New York, NY: 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, 1–5. New York, NY: 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, 1978–81. Boston, MA: 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, 2597–601. New York, NY: 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, 160–72. Berlin, Heidelberg: 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, 448–59. Berlin, Heidelberg: 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, 195–206. Berlin, Heidelberg: 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, 98–112. Berlin, Heidelberg: 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. New York, New York, USA: 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. New York, New York, USA: 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. New York, New York, USA: 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. New York, NY, USA: 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. New York, NY, USA: 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. New York, New York, USA: 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