Дисертації з теми "Distributed transaction systems"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Distributed transaction systems".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
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.
Повний текст джерела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
Xie, Wanxia. "Supporting Distributed Transaction Processing Over Mobile and Heterogeneous Platforms." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/14073.
Повний текст джерелаDixon, Eric Richard. "Developing distributed applications with distributed heterogenous databases." Thesis, Virginia Tech, 1993. http://hdl.handle.net/10919/42748.
Повний текст джерелаAndersson, Joachim, and Byggnings Johan Lindbom. "Reducing the load on transaction-intensive systems through distributed caching." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-186676.
Повний текст джерелаHirve, Sachin. "On the Fault-tolerance and High Performance of Replicated Transactional Systems." Diss., Virginia Tech, 2015. http://hdl.handle.net/10919/56668.
Повний текст джерелаPh. D.
Chan, Kinson, and 陳傑信. "Distributed software transactional memory with clock validation on clusters." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hub.hku.hk/bib/B5053404X.
Повний текст джерелаpublished_or_final_version
Computer Science
Doctoral
Doctor of Philosophy
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.
Повний текст джерелаWu, Jiang. "CHECKPOINTING AND RECOVERY IN DISTRIBUTED AND DATABASE SYSTEMS." UKnowledge, 2011. http://uknowledge.uky.edu/cs_etds/2.
Повний текст джерелаBlackshaw, Bruce Philip. "Migration of legacy OLTP architectures to distributed systems." Thesis, Queensland University of Technology, 1997. https://eprints.qut.edu.au/36839/1/36839_Blackshaw_1997.pdf.
Повний текст джерелаRocha, Tarcisio da. "Serviços de transação abertos para ambientes dinamicos." [s.n.], 2008. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276015.
Повний текст джерелаTese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-13T03:59:50Z (GMT). No. of bitstreams: 1 Rocha_Tarcisioda_D.pdf: 1796192 bytes, checksum: 4b25ccccc2fa363f13a02764136f5208 (MD5) Previous issue date: 2008
Resumo: Tecnicas de processamento de transações tem sido de grande importancia no que diz respeito a preservação da correção em diversas areas da computação. Devido a funções como, garantir a consistencia de dados, a recuperação de falhas e o controle de concorrencia, transações são consideradas blocos de construção apropriados para a estruturação de sistemas confiaveis. Contudo, desenvolver tecnicas de apoio a transações para ambientes dinamicos pode ser uma tarefa complexa. O primeiro obstaculo esta no proprio dinamismo - a disponibilidade de recursos pode variar inesperadamente. Isso pode causar dois efeitos diretos: altas taxas de cancelamento de transações e grandes atrasos na execução das tarefas transacionais. O segundo obstaculo esta na crescente flexibilização do conceito de transação. Isso ocorre porque os requisitos transacionais exigidos pelas aplicações atuais estão se tornando mais variados, indo al'em das propriedades tradicionalmente definidas para uma transação. Nesse contexto, esta tese aborda a viabilização de serviços de transações abertos, ou seja, capazes de terem sua estrutura e comportamento configurados pelos programadores de aplicações como um meio de atender a requisitos especificos do dominio de suas aplicações. Como parte desse estudo foi proposto um modelo que abstrai alguns elementos arquiteturais como jumpers, slots e demultiplexadores que podem ser usados na especificação de pontos de configuração em serviços de transação. Esse modelo e implementado como uma camada acima de um modelo de componentes existente. Com isso, desenvolvedores de serviços de transação passam a contar com esses elementos abertos alem daqueles disponibilizados por abordagens tradicionais baseadas em componentes. Para confirmar os beneficios em usabilidade, flexibilidade e extensão, esta tese apresenta dois serviços de transação abertos que foram especificados com base no modelo proposto. O primeiro serviço faz parte de uma plataforma de transações adaptavel para ambientes de computação movel. O segundo serviço faz parte de um sistema que prove adaptação dinamica de protocolos de efetivação (commit) de transações. Segundo os testes realizados, a abordagem apresentada nesta tese trouxe a esses serviços a capacidade de atender requisitos de aplicações de diferentes dominios.
Abstract: Transaction processing techniques are considered important solutions on preserving correctness in several fields of computing. Due their functions such as, failure recovery and concurrency control, transactions are considered appropriated building blocks for structuring reliable systems. Despite its advantages, to develop transaction systems for dynamic environments is not an easy task. The first problem is the dynamism - the resource availability can vary unexpectedly. This can cause the following side effects: high transaction abort rates and relevant delays of transaction operations. The second problem is the flexibilization of the transaction concept. The transactional requirements are becoming more diversified - they extrapolate the bounds of the traditional transactional properties. In this context, this thesis approaches the practicability of open transaction services that can be configured by the application programmers for attending specific requirements of different application domains. This thesis includes a model that abstracts some architectural elements (slots, jumpers and demultiplexers) that can be used for specifying configuration points in transaction services. To confirm its benefits on usability, flexibility and extension, this thesis presents two open transaction services that were specified based on the proposed model. The first service is part of an adaptable transaction platform for mobile computing environments. The second service is part of a system that provides dynamic adaptation of commit protocols. According the accomplished tests, the approach presented in this thesis is able to give to these services the capacity of attending the requirement of applications in different domains.
Doutorado
Sistemas Distribuidos
Doutor em Ciência da Computação
Kim, Junwhan. "Scheduling Memory Transactions in Distributed Systems." Diss., Virginia Tech, 2013. http://hdl.handle.net/10919/24768.
Повний текст джерелаPh. D.
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.
Повний текст джерелаTurcu, Alexandru. "On Improving Distributed Transactional Memory through Nesting, Partitioning and Ordering." Diss., Virginia Tech, 2015. http://hdl.handle.net/10919/51593.
Повний текст джерелаPh. D.
Taleb, Nasser. "Transactions serialization in distributed multidatabase systems." Thesis, University of Salford, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.420459.
Повний текст джерелаHedman, Surlien Peter. "Economic advantages of Blockchain technology VS Relational database : An study focusing on economic advantages with Blockchain technology and relational databases." Thesis, Blekinge Tekniska Högskola, Institutionen för industriell ekonomi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-17366.
Повний текст джерелаPang, Gene. "Scalable Transactions for Scalable Distributed Database Systems." Thesis, University of California, Berkeley, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3733329.
Повний текст джерелаWith the advent of the Internet and Internet-connected devices, modern applications can experience very rapid growth of users from all parts of the world. A growing user base leads to greater usage and large data sizes, so scalable database systems capable of handling the great demands are critical for applications. With the emergence of cloud computing, a major movement in the industry, modern applications depend on distributed data stores for their scalable data management solutions. Many large-scale applications utilize NoSQL systems, such as distributed key-value stores, for their scalability and availability properties over traditional relational database systems. By simplifying the design and interface, NoSQL systems can provide high scalability and performance for large data sets and high volume workloads. However, to provide such benefits, NoSQL systems sacrifice traditional consistency models and support for transactions typically available in database systems. Without transaction semantics, it is harder for developers to reason about the correctness of the interactions with the data. Therefore, it is important to support transactions for distributed database systems without sacrificing scalability.
In this thesis, I present new techniques for scalable transactions for scalable database systems. Distributed data stores need scalable transactions to take advantage of cloud computing, and to meet the demands of modern applications. Traditional techniques for transactions may not be appropriate in a large, distributed environment, so in this thesis, I describe new techniques for distributed transactions, without having to sacrifice traditional semantics or scalability.
I discuss three facets to improving transaction scalability and support in distributed database systems. First, I describe a new transaction commit protocol that reduces the response times for distributed transactions. Second, I propose a new transaction programming model that allows developers to better deal with the unexpected behavior of distributed transactions. Lastly, I present a new scalable view maintenance algorithm for convergent join views. Together, the new techniques in this thesis contribute to providing scalable transactions for modern, distributed database systems.
Vale, Tiago Marques do. "A modular distributed transactional memory framework." Master's thesis, Faculdade de Ciências e Tecnologia, 2012. http://hdl.handle.net/10362/8738.
Повний текст джерелаThe traditional lock-based concurrency control is complex and error-prone due to its low-level nature and composability challenges. Software transactional memory (STM), inherited from the database world, has risen as an exciting alternative, sparing the programmer from dealing explicitly with such low-level mechanisms. In real world scenarios, software is often faced with requirements such as high availability and scalability, and the solution usually consists on building a distributed system. Given the benefits of STM over traditional concurrency controls, Distributed Software Transactional Memory (DSTM) is now being investigated as an attractive alternative for distributed concurrency control. Our long-term objective is to transparently enable multithreaded applications to execute over a DSTM setting. In this work we intend to pave the way by defining a modular DSTM framework for the Java programming language. We extend an existing, efficient, STM framework with a new software layer to create a DSTM framework. This new layer interacts with the local STM using well-defined interfaces, and allows the implementation of different distributed memory models while providing a non-intrusive, familiar,programming model to applications, unlike any other DSTM framework. Using the proposed DSTM framework we have successfully, and easily, implemented a replicated STM which uses a Certification protocol to commit transactions. An evaluation using common STM benchmarks showcases the efficiency of the replicated STM,and its modularity enables us to provide insight on the relevance of different implementations of the Group Communication System required by the Certification scheme, with respect to performance under different workloads.
Fundação para a Ciência e Tecnologia - project (PTDC/EIA-EIA/113613/2009)
Silva, João André Almeida e. "Partial replication in distributed software transactional memory." Master's thesis, Faculdade de Ciências e Tecnologia, 2013. http://hdl.handle.net/10362/10769.
Повний текст джерелаDistributed software transactional memory (DSTM) is emerging as an interesting alternative for distributed concurrency control. Usually, DSTM systems resort to data distribution and full replication techniques in order to provide scalability and fault tolerance. Nevertheless, distribution does not provide support for fault tolerance and full replication limits the system’s total storage capacity. In this context, partial data replication rises as an intermediate solution that combines the best of the previous two trying to mitigate their disadvantages. This strategy has been explored by the distributed databases research field, but has been little addressed in the context of transactional memory and, to the best of our knowledge, it has never before been incorporated into a DSTM system for a general-purpose programming language. Thus, we defend the claim that it is possible to combine both full and partial data replication in such systems. Accordingly, we developed a prototype of a DSTM system combining full and partial data replication for Java programs. We built from an existent DSTM framework and extended it with support for partial data replication. With the proposed framework, we implemented a partially replicated DSTM. We evaluated the proposed system using known benchmarks, and the evaluation showcases the existence of scenarios where partial data replication can be advantageous, e.g., in scenarios with small amounts of transactions modifying fully replicated data. The results of this thesis show that we were able to sustain our claim by implementing a prototype that effectively combines full and partial data replication in a DSTM system. The modularity of the presented framework allows the easy implementation of its various components, and it provides a non-intrusive interface to applications.
Fundação para a Ciência e Tecnologia - (FCT/MCTES) in the scope of the research project PTDC/EIA-EIA/113613/2009 (Synergy-VM)
Niles, Duane Francis Jr. "Improving Performance of Highly-Programmable Concurrent Applications by Leveraging Parallel Nesting and Weaker Isolation Levels." Thesis, Virginia Tech, 2015. http://hdl.handle.net/10919/54557.
Повний текст джерелаMaster of Science
Yahalom, Raphael. "Managing the order of transactions in widely-distributed data systems." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359877.
Повний текст джерелаAbouzeki, Jenane Hassib. "A tool for building distributed transactions system with XML." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ62180.pdf.
Повний текст джерела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.
Повний текст джерелаBjörk, Mårten, and Sofia Max. "ARTSY : A Reproduction Transaction System." Thesis, Linköping University, Department of Electrical Engineering, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1611.
Повний текст джерелаA Transaction Reproduction System (ARTSY) is a distributed system that enables secure transactions and reproductions of digital content over an insecure network. A field of application is reproductions of visual arts: A print workshop could for example use ARTSY to print a digital image that is located at a remote museum. The purpose of this master thesis project was to propose a specification for ARTSY and to show that it is technically feasible to implement it.
An analysis of the security threats in the ARTSY context was performed and a security model was developed. The security model was approved by a leading computer security expert. The security mechanisms that were chosen for the model were: Asymmetric cryptology, digital signatures, symmetric cryptology and a public key registry. A Software Requirements Specification was developed. It contains extra directives for image reproduction systems but it is possible to use it for an arbitrary type of reproduction system. A prototype of ARTSY was implemented using the Java programming language. The prototype uses XML to manage information and Java RMI to enable remote communication between its components. It was built as a platform independent system and it has been tested and proven to be operational on the Sun Solaris platform as well as the Win32 platform.
Felgar, de Toledo Maria Beatriz. "A flexible approach to transaction management in a distributed cooperative system." Thesis, Lancaster University, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359908.
Повний текст джерелаTrigonakis, Vasileios. "Design of a Distributed Transactional Memory for Many-core systems." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-48339.
Повний текст джерелаSaad, Ibrahim Mohamed Mohamed. "HyFlow: A High Performance Distributed Software Transactional Memory Framework." Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/32966.
Повний текст джерелаMaster of Science
Pandey, Utkarsh. "Optimizing Distributed Transactions: Speculative Client Execution, Certified Serializability, and High Performance Run-Time." Thesis, Virginia Tech, 2016. http://hdl.handle.net/10919/72867.
Повний текст джерелаMaster of Science
Sylla, Adja Ndeye. "Support intergiciel pour la conception et le déploiement adaptatifs fiables, application aux bâtiments intelligents." Thesis, Université Grenoble Alpes (ComUE), 2017. http://www.theses.fr/2017GREAM095/document.
Повний текст джерелаIn the context of pervasive computing and internet of things, systems are heterogeneous,distributed and adaptive (e.g., transport management systems, building automation). Thedesign and the deployment of these systems are made difficult by their heterogeneous anddistributed nature but also by the risk of conflicting adaptation decisions and inconsistenciesat runtime. Inconsistencies are caused by hardware failures or communication errors. Theyoccur when actions corresponding to the adaptation decisions are assumed to be performedbut are not done.This thesis proposes a middleware support, called SICODAF, for the design and thedeployment of reliable adaptive systems. SICODAF combines a behavioral reliability (absenceof conflicting decisions) by means of transitions systems and an execution reliability(absence of inconsistencies) through a transactional middleware. SICODAF is based on autonomiccomputing. It allows to design and deploy an adaptive system in the form of anautonomic loop which consists of an abstraction layer, a transactional execution mechanismand a controller. SICODAF supports three types of controllers (based on rules, on continuousor discrete control theory). SICODAF also allows for loop reconfiguration, to dealwith changing objectives in the considered system, and the integration of a hardware failuredetection system. Finally, SICODAF allows for the design of multiple loops for systems thatconsist of a high number of entities or that require controllers of different types. These loopscan be combined in parallel, coordinated or hierarchical.SICODAF was implemented using the transactional middleware LINC, the abstractionenvironment PUTUTU and the language Heptagon/BZR that is based on transitionssystems. SICODAF was also evaluated using three case studies
Rahgozar, Maseud. "Controle de concurrence par gestion des evenements." Paris 6, 1987. http://www.theses.fr/1987PA066594.
Повний текст джерелаZhang, Bo. "Supporting Software Transactional Memory in Distributed Systems: Protocols for Cache-Coherence, Conflict Resolution and Replication." Diss., Virginia Tech, 2011. http://hdl.handle.net/10919/29571.
Повний текст джерелаPh. D.
Aivars, Sablis. "Benefits of transactive memory systems in large-scale development." Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-11703.
Повний текст джерелаZajac, Stephanie. "Exploring new boundaries in team cognition: Integrating knowledge in distributed teams." Master's thesis, University of Central Florida, 2014. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/6390.
Повний текст джерелаM.S.
Masters
Psychology
Sciences
Industrial Organizational Psychology
Poudel, Pavan. "Tools and Techniques for Efficient Transactions." Kent State University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=kent1630591700589561.
Повний текст джерелаPoudel, Pavan. "Tools and Techniques for Efficient Transactions." Kent State University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=kent1630591700589561.
Повний текст джерелаBalachandran, Nandu. "Utilization of Distributed Generation in Power System Peak Hour Load Shedding Reduction." ScholarWorks@UNO, 2016. http://scholarworks.uno.edu/td/2124.
Повний текст джерелаXiong, Fanfan. "Resource Efficient Parallel VLDB with Customizable Degree of Redundancy." Diss., Temple University Libraries, 2009. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/43445.
Повний текст джерелаPh.D.
This thesis focuses on the practical use of very large scale relational databases. It leverages two recent breakthroughs in parallel and distributed computing: a) synchronous transaction replication technologies by Justin Y. Shi and Suntain Song; and b) Stateless Parallel Processing principle pioneered by Justin Y. Shi. These breakthroughs enable scalable performance and reliability of database service using multiple redundant shared-nothing database servers. This thesis presents a Functional Horizontal Partitioning method with customizable degree of redundancy to address practical very large scale database applications problems. The prototype VLDB implementation is designed for transparent non-intrusive deployments. The prototype system supports Microsoft SQL Servers databases. Computational experiments are conducted using industry-standard benchmark (TPC-E).
Temple University--Theses
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.
Повний текст джерелаDepartment of Computer Science
Danes, Ferencz Adriana. "Service transactionnel souple pour systèmes répartis à objets persistants." Grenoble 1, 1996. https://theses.hal.science/tel-00004984.
Повний текст джерелаLe STG est composé de classes spécialisées qui constituent son interface, et qui repose sur des mécanismes systèmes spécifiques implantés dans le noyau du système Guide
Zia, Muhammad Fahad. "On energy management optimization for microgrids enriched with renewable energy sources Microgrids energy management systems: a critical review on methods, solutions, and prospects, in Applied Energy 222, July 2018 Optimal operational planning of scalable DC microgrid with demand response, islanding, and battery degradation cost considerations, in Applied Energy 237, March 2019 Energy management system for an islanded microgrid with convex relaxation, in IEEE Transactions on Industry Applications 55, Nov.-Dec. 2019 Microgrid transactive energy: review, architectures, distributed ledger technologies, and market analysis, in IEEE Access, January 2020." Thesis, Brest, 2020. http://theses-scd.univ-brest.fr/2020/These-2020-SPI-Genie_electrique-ZIA_Muhammad_Fahad.pdf.
Повний текст джерелаThe current electric power system isfacing the challenges of environmental protection,increasing global electricity demand, high reliability requirement, cleanliness of energy, and planning restrictions. To evolve towards green and smart electric power system, centralized generating facilities are now being transformed into smaller and more distributed generations. As a consequence, the concept of microgrid emerges, where a microgrid can operate as a single controllable system and can be assumed as a cluster of loads and distributed energy resources, which may include many renewable energy sources and energy storage systems. The energy management of large numbers of distributed energy resources is needed for reliable operation of microgrid system. Therefore, energy management is the fundamental part of the microgrid operation for economical and sustainable development. In this regard, this thesis focuses on proposing energy management optimization models for optimal operation of microgrid system that include proposed practical Li-ion battery degradation cost model. These different energy management models include objective functions of operating cost of distributed generators, emission cost of conventional generation source, maximum utilization of renewable energy sources, battery degradation cost, demand response incentives, and load shedding penalization cost, with microgrid component and physical network constraints. A comprehensive conceptual seven layer model is also developed to provide standardized insights in implementing real transactive energy systems
Belfkih, Abderrahmen. "Contraintes temporelles dans les bases de données de capteurs sans fil." Thesis, Le Havre, 2016. http://www.theses.fr/2016LEHA0014/document.
Повний текст джерелаIn this thesis, we are interested in adding real-time constraints in the Wireless Sensor Networks Database (WSNDB). Temporal consistency in WSNDB must be ensured by respecting the transaction deadlines and data temporal validity, so that sensor data reflect the current state of the environment. However, delays of transmission and/or reception in a data collection process can lead to not respect the data temporal validity. A database solution is most appropriate, which should coincide with the traditional database aspects with sensors and their environment. For this purpose, the sensor in WSN is considered as a table in a distributed database, which applied transactions (queries, updates, etc.). Transactions in a WSNDB require modifications to take into account of the continuous datastream and real-time aspects. Our contribution in this thesis focus on three parts: (i) a comparative study of temporal properties between a periodic data collection based on a remote database and query processing approach with WSNDB, (ii) the proposition of a real-time query processing model, (iii) the implementation of a real time WSNDB, based on the techniques described in the second contribution
Rustagi, Ram Prakash. "Studies in concurrency control for centralized, distributed and nested transaction systems." Thesis, 1998. http://localhost:8080/iit/handle/2074/2211.
Повний текст джерелаRahm, Erhard. "A Framework for workload allocation in distributed transaction processing systems." 1992. https://ul.qucosa.de/id/qucosa%3A31970.
Повний текст джерелаHaghjoo, Mostafa S. "Transactional actors in cooperative information systems." Phd thesis, 1995. http://hdl.handle.net/1885/137457.
Повний текст джерелаChen, Hong-Ren, and 陳鴻仁. "A Study on Transaction Scheduling in Distributed Real-Time Database Systems." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/60189547967791054074.
Повний текст джерела國立清華大學
資訊工程學系
91
In recent years, a distributed real-time database system (RTDBS) has become increasingly important in many real-life applications such as Internet stocking trading system, telecommunication, aircraft tracking, and automated control of medical patient monitoring. It must not only satisfy the data consistency, but also consider the time constraints associated with a real-time transaction. In general, a remote transaction usually accesses some data located at remote sites. However, traditional real-time schedulers do not consider the impact of communication delay in transferring remote data, resulting in a high MissRatio for remote transactions. This dissertation proposes a new real-time scheduler called FHR to reduce the MissRatio and lessen the unnecessary waiting time due to communication delay for a remote transaction. Transactions in advanced real-time database applications are characterized by being long and complex. The traditional flat transaction model cannot support all the requirements of these advanced applications. Thus, nested transactions play an important role in such applications. Nowadays, most of real-time schedulers are developed on the base of flat transaction models. A new real-time scheduler for nested transaction models called FHRN is proposed to efficiently schedule real-time nested transactions in a distributed RTDBS. FHRN consists of (1) FHRNp policy to schedule real-time nested transactions, and (2) 2PL_HPN resolve the concurrent data-accessing problem among interleaved nested transactions.
Gupta, Ramesh Kumar. "Commit Processing In Distributed On-Line And Real-Time Transaction Processing Systems." Thesis, 1997. https://etd.iisc.ac.in/handle/2005/1856.
Повний текст джерелаGupta, Ramesh Kumar. "Commit Processing In Distributed On-Line And Real-Time Transaction Processing Systems." Thesis, 1997. http://etd.iisc.ernet.in/handle/2005/1856.
Повний текст джерела(11132985), Thamir Qadah. "High-performant, Replicated, Queue-oriented Transaction Processing Systems on Modern Computing Infrastructures." Thesis, 2021.
Знайти повний текст джерелаRenaud, Karen Vera. "A comparative study of transaction management services in multidatabase heterogeneous systems." Diss., 1996. http://hdl.handle.net/10500/17612.
Повний текст джерелаComputing
M. Sc. (Computer Science)
Blackburn, Stephen. "Persistent store interface : a foundation for scalable persistent system design." Phd thesis, 1998. http://hdl.handle.net/1885/145415.
Повний текст джерелаAlagarsamy, K. "Some Theoretical Contributions To The Mutual Exclusion Problem." Thesis, 1997. https://etd.iisc.ac.in/handle/2005/1833.
Повний текст джерела