<p>Distributed real-time databases can be used to support data sharing</p><p>for applications in wireless ad-hoc networks. In such networks, topology changes frequently and partitions may be unpredictable and last for an unbounded period. In this thesis, the existing database replication protocol PRiDe is extended to handle such long-lasting partitions. The protocol uses optimistic and detached replication to provide predictable response times in unpredictable networks and forward conflict resolution to guarantee progress.</p><p>The extension, pPRiDe, combines update and state transfer strategies. Update transfer for intra-partition communication can reduce bandwidth usage and ease conflict resolution. State transfer for inter partition conflicts removes dependency on a common state between partitions prior to the merge to apply update messages on. This makes the resource usage independent of the life span of partitions. This independence comes at the cost of global data stability guarantees and pPRiDe can thus only provide per partition guarantees. The protocol supports application specific conflict resolution routines for both</p><p>state and update conflicts. A basic simulator for mobile ad-hoc networks has been developed to validate that pPRiDe provides eventual consistency.</p><p>pPRiDe shows that a hybrid approach to change propagation strategy can be beneficial in networks where collaboration by data sharing within long lasting partitions and predictable resource usage is necessary. These types of systems already require the conflict management routines necessary for pPRiDe and can benefit from an existing protocol.</p><p>In addition to pPRiDe and the simulator this thesis provides a flexible object database suitable for future works and an implementation of PRiDe on top of that database.</p>

<p>The focus of this dissertation is on large-scale and long-running networked real-time multiplayer games. In this type of games, each player controls one or many entities, which interact in a shared virtual environment. Three attributes - scalability, security, and fault tolerance - are considered essential for this type of games. The normal approaches for building this type of games, using a client/server or peer-to-peer architecture, fail in achieving all three attributes. We propose a server-network architecture that supports these attributes. In this architecture, a cluster of servers collectively manage the game state and each server manages a separate region of the virtual environment. We discuss how the architecture can be extended using proxies, and we compare it to other similar architectures. Further, we investigate how a distributed database management system can support the proposed architecture. Since efficiency is very important in this type of games, some properties of traditional database systems must be relaxed. We also show how methods for increasing scalability, such as interest management and dead reckoning, can be implemented in a database system. Finally, we suggest how the proposed architecture can be validated using a simulation of a large-scale game.</p>

Thesis (Ph. D.)--University of Washington, 2002. / Vita. Includes bibliographical references (p. 166-185).

Many organizations use relational databases (RDB) at this time. These databases can be different producers (Oracle, MS SQL Server and etc.), operate different operating systems and use different software. But the main problem if organizations want collaborate they must exchange data between them. Sometimes if they use different data structures exchange data between them is very hard or impossible. If they want integrate different databases they must use general standard. This standard must be adjustable for different databases. One of the general standards is XML. The main purpose of this project was to analyse two functional requirements supply methods (UML and Communication Action Loops), possible architecture decisions and separate replication streams of distributed databases. One of the possible architecture decisions is replication using XML. Considering to this was created the appropriate software tool. Using this software, administrator can manipulate data and exchange data between two databases (MS SQL Server and Oracle) using XML. We have same data in two databases and we need write same date in two different databases and in this project used XML to solve this problem.

No description available.

No description available.

Thesis (M.S. in Information Technology Management)--Naval Postgraduate School, September 2009. / Thesis Advisor(s): Cook, Glenn. "September 2009." Description based on title screen as viewed on 6 November 2009. Author(s) subject terms: Enterprise architecture, project management, business process transformation, operating model, IT governance, IT systems, data quality, data migration, business operating model, personnel IT systems, HRM, ERP. Includes bibliographical references (p. 89-92). Also available in print.

Thesis (Ph.D.) -- Mississippi State University. Department of Computer Science and Engineering. / Title from title screen. Includes bibliographical references.

Thesis (M.Sc.)--Acadia University, 1999. / Includes bibliographical references (leaves 88-89). Also available on the Internet via the World Wide Web.

Thesis (M.App.Sc.) - Carleton University, 2007. / Includes bibliographical references (p. 173-187). Also available in electronic format on the Internet.