Relevant bibliographies by topics / Data replication

Contents

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

Academic literature on the topic 'Data replication'

Author: Grafiati
Published: 4 June 2021
Last updated: 15 June 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 'Data replication.'

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 "Data replication"

1

Zeng, Wen Ying, and Yue Long Zhao. "Mobile Data Replication Algorithms Based on Agent." Advanced Materials Research 225-226 (April 2011): 957–60. http://dx.doi.org/10.4028/www.scientific.net/amr.225-226.957.

Full text
Abstract:
In mobile transaction process, there exists frequently data transferring and replication. By the bandwidth limitation, discontinuous characteristics, there are a lot of questions in mobile data loss, replication failure, etc. Aimed at the questions, the paper proposes several mobile data transfer and replication algorithms based on agent. Every proposed algorithm is analyzed and simulation is performed to compare their delay. Result shows that through collecting small data transactions by agent, data are batch processed to servers, which may reduce the total cost of replication and promote replication success ratio and reduce the delay of replications. Adaptive algorithm is also considered.
APA, Harvard, Vancouver, ISO, and other styles
2

T.V., Rohini. "Adaptive Dynamic Data Replication with Load-balancing in Distributed Systems." Journal of Advanced Research in Dynamical and Control Systems 12, SP3 (2020): 1034–43. http://dx.doi.org/10.5373/jardcs/v12sp3/20201349.

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

Fang, Kuo-Chi, Husnu S. Narman, Ibrahim Hussein Mwinyi, and Wook-Sung Yoo. "PPHA-Popularity Prediction Based High Data Availability for Multimedia Data Center." International Journal of Interdisciplinary Telecommunications and Networking 11, no. 1 (2019): 17–29. http://dx.doi.org/10.4018/ijitn.2019010102.

Full text
Abstract:
Due to the growth of internet-connected devices and extensive data analysis applications in recent years, cloud computing systems are largely utilized. Because of high utilization of cloud storage systems, the demand for data center management has been increased. There are several crucial requirements of data center management, such as increase data availability, enhance durability, and decrease latency. In previous works, a replication technique is mostly used to answer those needs according to consistency requirements. However, most of the works consider full data, popular data, and geo-distance-based replications by considering storage and replication cost. Moreover, the previous data popularity based-techniques rely on the historical and current data access frequencies for replication. In this article, the authors approach this problem from a distinct aspect while developing replication techniques for a multimedia data center management system which can dynamically adapt servers of a data center by considering popularity prediction in each data access location. Therefore, they first label data objects from one to ten to track access frequencies of data objects. Then, they use those data access frequencies from each location to predict the future access frequencies of data objects to determine the replication levels and locations to replicate the data objects, and store the related data objects to close storage servers. To show the efficiency of the proposed methods, the authors conduct an extensive simulation by using real data. The results show that the proposed method has an advantage over the previous works in terms of data availability and increases the data availability up to 50%. The proposed method and related analysis can assist multimedia service providers to enhance their service qualities.
APA, Harvard, Vancouver, ISO, and other styles
4

Saadat, Nazanin, and Amir Masoud Rahmani. "A Two-Level Fuzzy Value-Based Replica Replacement Algorithm in Data Grids." International Journal of Grid and High Performance Computing 8, no. 4 (2016): 78–99. http://dx.doi.org/10.4018/ijghpc.2016100105.

Full text
Abstract:
One of the challenges of data grid is to access widely distributed data fast and efficiently and providing maximum data availability with minimum latency. Data replication is an efficient way used to address this challenge by replicating and storing replicas, making it possible to access similar data in different locations of the data grid and can shorten the time of getting the files. However, as the number and storage size of grid sites is limited and restricted, an optimized and effective replacement algorithm is needed to improve the efficiency of replication. In this paper, the authors propose a novel two-level replacement algorithm which uses Fuzzy Replica Preserving Value Evaluator System (FRPVES) for evaluating the value of each replica. The algorithm was tested using a grid simulator, OptorSim developed by European Data Grid projects. Results from simulation procedure show that the authors' proposed algorithm has better performance in comparison with other algorithms in terms of job execution time, total number of replications and effective network usage.
APA, Harvard, Vancouver, ISO, and other styles
5

Vilkienė, Loreta, Laura Vilkaitė-Lozdienė, Rita Juknevičienė, Justina Bružaitė-Liseckienė, Kinga Geben, and Birutė Ryvitytė. "Is it reliable and valid if it is not replicable? On the importance of replicability in quantitative research." Taikomoji kalbotyra, no. 14 (June 16, 2020): 33–38. http://dx.doi.org/10.15388/taikalbot.2020.14.3.

Full text
Abstract:
The idea of this paper arose in a reading group of several colleagues at the Faculty of Philology of Vilnius University after a discussion of a review article published by the editors of Language Teaching. Titled ‘Replication studies in language learning and teaching’ (2008), the paper focuses on replication studies and argues that they should be promoted and valued no less than original research. The participants of the reading group agreed that replication studies, understood here primarily as replications of quantitative research, are indeed an important issue that could be of interest to the broader community of applied linguists in Lithuania. The present paper argues that attempts to replicate earlier studies, which are very scarce or non-existent in Lithuania, deserve more attention both from novice and mature researchers. Replications are particularly valuable in developmental studies where replicating a study over a period of time allows the researcher to obtain data for continued analysis. Furthermore, a replication of a published study that deals with data collected in one country offers an opportunity to verify its findings in a different context and this way consolidates our understanding of phenomena under study. Finally, replication is an invaluable learning method to a novice linguist, be it a senior undergraduate or postgraduate student. Thus the authors of this paper would like to promote the idea of replication research in our community as well as encourage everyone interested make use of the increasingly growing amount of open access data available on the internet.
APA, Harvard, Vancouver, ISO, and other styles
6

Elango, P., K. Kuppusamy, and N. Prabhu. "Data Replication Using Data Mining Techniques." Asian Journal of Computer Science and Technology 8, S1 (2021): 107–9. http://dx.doi.org/10.51983/ajcst-2019.8.s1.1939.

Full text
Abstract:
Database Replication is the successive electronic duplicating of information from a database in one PC or server to a database in another with the goal that all clients share a similar dimension of data. The outcome is a conveyed database in which clients can get to information significant to their assignments without meddling with crafted by others. Anyway information replication is an entrancing theme for both hypothesis and practice. On the hypothetical side, numerous solid outcomes requirement what should be possible as far as consistency: e.g., the difficulty of achieving agreement in offbeat frameworks the blocking idea of CAP hypothesis, and the requirement for picking an appropriate rightness foundation among the numerous conceivable. On the pragmatic side, information replication assumes a key job in a wide scope of settings like storing, back-up, high accessibility, wide territory content dissemination, expanding versatility, parallel preparing, and so forth. Finding a replication arrangement that is reasonable in whatever number such settings as could reasonably be expected remains an open test.
APA, Harvard, Vancouver, ISO, and other styles
7

Jajodia, S. "Data replication gaining popularity." IEEE Concurrency 7, no. 2 (1999): 85–86. http://dx.doi.org/10.1109/mcc.1999.766976.

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

Sabaghian, Khatereh, Keyhan Khamforoosh, and Abdolbaghi Ghaderzadeh. "Presentation of a new method based on modern multivariate approaches for big data replication in distributed environments." PLOS ONE 16, no. 7 (2021): e0254210. http://dx.doi.org/10.1371/journal.pone.0254210.

Full text
Abstract:
As the amounts of data and use of distributed systems for data storage and processing have increased, reducing the number of replications has turned into a crucial requirement in these systems, which has been addressed by plenty of research. In this paper, an algorithm has been proposed to reduce the number of replications in big data transfer and, eventually to lower the traffic load over the grid by classifying data efficiently and optimally based on the sent data types and using VIKOR as a method of multivariate decision-making for ranking replication sites. Considering different variables, the VIKOR method makes it possible to take all the parameters effective in the assessment of site ranks into account. According to the results and evaluations, the proposed method has exhibited an improvement by about thirty percent in average over the LRU, LFU, BHR, and Without Rep. algorithms. Furthermore, it has improved the existing multivariate methods through different approaches to replication by thirty percent, as it considers effective parameters such as time, the number of replications, and replication site, causing replication to occur when it can make an improvement in terms of access.
APA, Harvard, Vancouver, ISO, and other styles
9

Hamad Thalij, Saadi, and Veli Hakkoymaz. "A Case Study of Snapshot Replication and Transfer of Data in Distributed Databases." Tikrit Journal of Pure Science 23, no. 10 (2019): 87. http://dx.doi.org/10.25130/j.v23i10.765.

Full text
Abstract:
The database replication refers to distributing a database among multiple locations. There are three kinds of database replication system: snapshot, transactional and merge. The snapshot replication refers to the fragment of database items and distributing them to multi databases at once. An important goal in this paper is to experiment with a distributed database study the snapshot replication and examine the issues associated with it. In this work, the data from another database is used to increase availability and flexibility as well as provide the information exchange between databases. In this process, the data is infrequently updated at specified periods by copying and changing the data from the original database towards the subscriber database. The work of agents in this technology will do the most of the work to achieve the stated goal. The experimental results show that at both vertical and horizontal fragmentation, the proposed approach of replicating distributed database is efficient and the performance is significantly improved in terms of data transfer time, load sharing and update of database fragmentation. Hence the snapshot replication system is much schedulable and protective replication in business markets.
 
 http://dx.doi.org/10.25130/tjps.23.2018.177
APA, Harvard, Vancouver, ISO, and other styles
10

Saadi Hamad Thalij and Veli Hakkoymaz. "A Case Study of Snapshot Replication and Transfer of Data in Distributed Databases." Tikrit Journal of Pure Science 23, no. 10 (2019): 97–101. http://dx.doi.org/10.25130/tjps.v23i10.571.

Full text
Abstract:
The database replication refers to distributing a database among multiple locations. There are three kinds of database replication system: snapshot, transactional and merge. The snapshot replication refers to the fragment of database items and distributing them to multi databases at once. An important goal in this paper is to experiment with a distributed database study the snapshot replication and examine the issues associated with it. In this work, the data from another database is used to increase availability and flexibility as well as provide the information exchange between databases. In this process, the data is infrequently updated at specified periods by copying and changing the data from the original database towards the subscriber database. The work of agents in this technology will do the most of the work to achieve the stated goal. The experimental results show that at both vertical and horizontal fragmentation, the proposed approach of replicating distributed database is efficient and the performance is significantly improved in terms of data transfer time, load sharing and update of database fragmentation. Hence the snapshot replication system is much schedulable and protective replication in business markets.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Data replication"

1

Martins, Vidal. "Data Replication in P2P Systems." Phd thesis, Université de Nantes, 2007. http://tel.archives-ouvertes.fr/tel-00481828.

Full text
Abstract:
Cette thèse porte sur la réplication de données dans les systèmes pair-à-pair (P2P). Elle est motivée par l'importance croissante des applications de collaboration répartie et leurs besoins spécifiques en termes de réplication de données, cohérence de données, passage à l'échelle, et haute disponibilité. En employant comme exemple un Wiki P2P, nous montrons que les besoins de réplication pour les applications collaborative sont : haut niveau d'autonomie, réplication multi-maître, détection et résolution de conflit basé sur sémantique, cohérence éventuelle parmi des répliques, hypothèses faibles de réseau, et indépendance des types de données. Bien que la réplication optimiste adresse la plupart de ces besoins, les solutions existantes sont peu applicables aux réseaux P2P puisqu'elles sont centralisées ou ne tiennent pas compte des limitations de réseau. D'autre part, les solutions existantes de réplication P2P ne répondent pas à toutes ces exigences simultanément. En particulier, aucune d'elles ne fournit la cohérence éventuelle parmi des répliques avec des hypothèses faibles de réseau. Cette thèse vise à fournir une solution de réconciliation fortement disponible et qui passe à l'échelle pour des applications de collaboration P2P en développant un protocole de réconciliation qui assure la cohérence éventuelle parmi des répliques et tient compte des coûts d'accès aux données. Cet objectif est accompli en cinq étapes. D'abord, nous présentons des solutions existantes pour la réplication optimiste et des stratégies de réplication P2P et nous analysons leurs avantages et inconvénients. Cette analyse nous permet d'identifier les fonctionnalités et les propriétés que notre solution doit fournir. Dans une deuxième étape, nous concevons un service de réplication pour le système APPA (en anglais, Atlas Peer-to-Peer Architecture). Troisièmement, nous élaborons un algorithme pour la réconciliation sémantique répartie appelée DSR, qui peut être exécuté dans différents environnements répartis (par ex. grappe, grille, ou P2P). Dans une quatrième étape, nous faisons évoluer DSR en protocole de réconciliation pour des réseaux P2P appelé P2P-reconciler. Finalement, la cinquième étape produit une nouvelle version de P2P-reconciler, appelée P2P-reconciler-TA, qui exploite les réseaux P2P conscients de leur topologie (en anglais, topology-aware) afin d'améliorer les performances de la réconciliation. Nous avons validé nos solutions et évalué leurs performances par l'expérimentation et la simulation. Les résultats ont montré que notre solution de réplication apporte haute disponibilité, excellent passage à l'échelle, avec des performances acceptables et surcharge limitée.
APA, Harvard, Vancouver, ISO, and other styles
2

Pamplona, Rodrigo Christovam. "Data replication in mobile computing." Thesis, Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-16448.

Full text
Abstract:
With the advances of technology and the popularization of mobile devices, the need of researching and discussing subjects related to mobile devices has raised. One of the subjects that needs to be further analyzed is data replication. This study investigates data replication on mobile devices focusing on power consumption. It presents four different scenarios that propose, describe, apply and evaluate data replication mechanisms, with the purpose of finding the best scenario that presents less energy consumption. In order to make the experiments, Sun SPOT was chosen as a mobile device. This device is fully programmed in a java environment. A different software was created in each scenario in order to verify the performance of the mobile devices regarding energy saving. The results found did not meet the expectations. While trying to find the best scenario a hardware limitation was found. Although software can be easily changed to fix errors, hardware cannot be changed as easily. The implications for the hardware limitation found in this study prevented the results to be optimal. The results found also imply that new hardware should be used in further experimentation. As this study proved to be limited, it suggests that additional studies should be carried out applying the new version of the hardware used in this study.
APA, Harvard, Vancouver, ISO, and other styles
3

Gu, Xuan. "Selective Data Replication for Distributed Geographical Data Sets." Thesis, University of Canterbury. Computer Science and Software Engineering, 2008. http://hdl.handle.net/10092/2545.

Full text
Abstract:
The main purpose of this research is to incorporate additional higher-level semantics into the existing data replication strategies in such a way that their flexibility and performance can be improved in favour of both data providers and consumers. The resulting approach from this research is referred to as the selective data replication system. With this system, the data that has been updated by a data provider is captured and batched into messages known as update notifications. Once update notifications are received by data consumers, they are used to evaluate so-called update policies, which are specified by data consumers containing details on when data replications need to occur and what data needs to be updated during the replications.
APA, Harvard, Vancouver, ISO, and other styles
4

Fan, Rui 1977. "Efficient replication of large data objects." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/29581.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.<br>Includes bibliographical references (p. 77-78).<br>Replication is an important technique for improving the reliability and scalability of data services. The primary problem encountered in replication is the trade-off between amount of replication, performance, and consistency. A rule of thumb states that any replication algorithm must sacrifice at least one of these criteria. In this thesis, we investigate replicating large data objects, such as files, whose size is large compared to metadata used by the replication algorithm. With this assumption, we present a distributed replication algorithm which simultaneously achieves a high replication factor, nearly optimal performance, and strong data consistency. Furthermore, our algorithm makes only basic assumptions about its environment. Our algorithm works in any asynchronous, reliable message-passing network, without relying on higher level functions such as distributed locking or group communication. Our algorithm is suitable for implementation in both LAN and WAN settings. This thesis is divided into two parts. In the first part, we formally state the assumptions and guarantees of our replication algorithm in terms of its trace properties. We then formally implement our algorithm in the IOA modeling language. We also give rigorous proofs of the algorithm's correctness and its performance analysis. The main idea of our algorithm is to separately maintain copies of the data, and information about the locations of the up-to-date copies. Our algorithm then mostly performs cheap operations on the location information, and avoids expensive operations on the actual data. The second part of this thesis presents two lower bounds on the costs of data replication. The first lower bound gives the minimum number of writes that must occur during a read operation. The second lower bound states that for a certain class of efficient replication algorithms, the replicas must use storage proportional to the maximum number of concurrent writers. The motivation for these lower bounds was certain algorithmic techniques we used in our replication algorithm. The lower bounds suggest that these techniques are necessary. The lower bounds are also of independent interest.<br>by Rui Fan.<br>S.M.
APA, Harvard, Vancouver, ISO, and other styles
5

Abushnagh, Yousef. "Contention management for distributed data replication." Thesis, University of Newcastle upon Tyne, 2013. http://hdl.handle.net/10443/2209.

Full text
Abstract:
Optimistic replication schemes provide distributed applications with access to shared data at lower latencies and greater availability. This is achieved by allowing clients to replicate shared data and execute actions locally. A consequence of this scheme raises issues regarding shared data consistency. Sometimes an action executed by a client may result in shared data that may conflict and, as a consequence, may conflict with subsequent actions that are caused by the conflicting action. This requires a client to rollback to the action that caused the conflicting data, and to execute some exception handling. This can be achieved by relying on the application layer to either ignore or handle shared data inconsistencies when they are discovered during the reconciliation phase of an optimistic protocol. Inconsistency of shared data has an impact on the causality relationship across client actions. In protocol design, it is desirable to preserve the property of causality between different actions occurring across a distributed application. Without application level knowledge, we assume an action causes all the subsequent actions at the same client. With application knowledge, we can significantly ease the protocol burden of provisioning causal ordering, as we can identify which actions do not cause other actions (even if they precede them). This, in turn, makes possible the client’s ability to rollback to past actions and to change them, without having to alter subsequent actions. Unfortunately, increased instances of application level causal relations between actions lead to a significant overhead in protocol. Therefore, minimizing the rollback associated with conflicting actions, while preserving causality, is seen as desirable for lower exception handling in the application layer. In this thesis, we present a framework that utilizes causality to create a scheduler that can inform a contention management scheme to reduce the rollback associated with the conflicting access of shared data. Our framework uses a backoff contention management scheme to provide causality preserving for those optimistic replication systems with high causality requirements, without the need for application layer knowledge. We present experiments which demonstrate that our framework reduces clients’ rollback and, more importantly, that the overall throughput of the system is improved when the contention management is used with applications that require causality to be preserved across all actions.
APA, Harvard, Vancouver, ISO, and other styles
6

Nukarapu, Dharma Teja. "Data replication in data intensive scientific applications with performance guarantee." Thesis, Wichita State University, 2009. http://hdl.handle.net/10057/2515.

Full text
Abstract:
Data replication is well adopted in data intensive scientific applications to reduce the data file transfer time and the bandwidth consumption. However, the problem of data replication in Data Grids, an enabling technology for data intensive applications, is proved to be NP-hard and even non-approximable. Previous research in this field are either theoretical investigations without practical consideration, or heuristics-based with little or no theoretical background. In this paper, we propose a data replication algorithm which not only has provable theoretical performance guarantee, but also can be implemented in a distributed and practical manner. Specifically, we design a replication technique which reduces the total job execution time at least half of that obtained from the optimal solution. Our centralized replication algorithm is amenable to distributed implementation, which can be easily adopted in a distributed environment such as the Data Grid. We have done extensive simulations to validate the proposed replication algorithms. Using our own simulator, we show that the centralized greedy replication algorithm performs comparably to the optimal algorithm under different network parameters. Using GridSim, a popular distributed Grid simulator, we demonstrate that the distributed replication technique significantly outperforms an existing replication technique; moreover, it is more adaptive to the dynamic change of file access pattern in Data Grids.<br>Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science
APA, Harvard, Vancouver, ISO, and other styles
7

Guo, Minzhe. "Algorithmic Mechanism Design for Data Replication Problems." University of Cincinnati / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470757536.

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

Sørensen, Egil. "Derby: Replication and Availability." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-8731.

Full text
Abstract:
<p>This paper describes the work done to add hot standby replication functionality to the Apache Derby Database Management System. The Apache Derby project is a relational database implemented entirely in Java. Its key advantages are that it has a small footprint and it is based on the standard Java JDBC and SQL standards. It is also easy to install, deploy and use as well as it can be embedded in almost any light-weight Java application. By implementing a hot standby scheme in Apache Derby several features are added. The contents of the database is replicated at run time to another site providing online runtime backup. As the hot standby takes over on faults availability is added in that a client can connect to the hot standby after a crash. Thus the crash is masked from the clients. In addition to this, online upgrades of software and hardware can be done by taking down one database at the time. Then when the upgrade is completed the upgraded server is synchronized and back online with no downtime. A fully functional prototype of the Apache Derby hot standby scheme has been created in this project using logical logs, fail-fast takeovers and logical catchups after an internal up-to-crash recovery and reconnection. This project builds on the ideas that are presented in Derby: Write to Neighbor Mode.</p>
APA, Harvard, Vancouver, ISO, and other styles
9

Hähner, Jörg. "Consistent data replication in mobile ad hoc networks." [S.l. : s.n.], 2007. http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-29798.

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

Roman, Pierre-Louis. "Exploring heterogeneity in loosely consistent decentralized data replication." Thesis, Rennes 1, 2018. http://www.theses.fr/2018REN1S091/document.

Full text
Abstract:
Les systèmes décentralisés sont par nature extensibles mais sont également difficiles à coordonner en raison de leur faible couplage. La réplication de données dans ces systèmes géo-répartis est donc un défi inhérent à leur structure. Les deux contributions de cette thèse exploitent l'hétérogénéité des besoins des utilisateurs et permettent une qualité de service personnalisable pour la réplication de données dans les systèmes décentralisés. Notre première contribution Gossip Primary-Secondary étend le critère de cohérence Update consistency Primary-Secondary afin d'offrir des garanties différenciées de cohérence et de latence de messages pour la réplication de données à grande échelle. Notre seconde contribution Dietcoin enrichit Bitcoin avec des nœuds diet qui peuvent (i) vérifier la validité de sous-chaînes de blocs en évitant le coût exorbitant de la vérification initiale et (ii) choisir leur propres garanties de sécurité et de consommation de ressources<br>Decentralized systems are scalable by design but also difficult to coordinate due to their weak coupling. Replicating data in these geo-distributed systems is therefore a challenge inherent to their structure. The two contributions of this thesis exploit the heterogeneity of user requirements and enable personalizable quality of services for data replication in decentralized systems. Our first contribution Gossip Primary-Secondary enables the consistency criterion Update consistency Primary-Secondary to offer differentiated guarantees in terms of consistency and message delivery latency for large-scale data replication. Our second contribution Dietcoin enriches Bitcoin with diet nodes that can (i) verify the correctness of entire subchains of blocks while avoiding the exorbitant cost of bootstrap verification and (ii) personalize their own security and resource consumption guarantees
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Data replication"

1

Charron-Bost, Bernadette, Fernando Pedone, and André Schiper. Replication: Theory and practice. Springer-Verlag, 2010.

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

Oliver, Spatscheck, ed. Web caching and replication. Addison-Wesley, 2002.

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

1958-, Heddaya Abdelsalam A., and Bhargava Bharat K. 1948-, eds. Replication techniques in distributed systems. Kluwer Academic Publishers, 1996.

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

Bandi, Reddy Jagan, and Tallman Jeff, eds. Sybase 15.0 replication server administration. Wordware Pub., 2008.

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

Cook, Jonathan. The DB2 replication certification guide. Prentice Hall PTR, 1999.

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

Data replication: Tools and techniques for managing distributed information. Wiley Computer Pub., 1997.

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

Paul, Sujoy. Pro SQL Server 2008 Replication. Apress, 2009.

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

International Business Machines Corporation. International Technical Support Organization, ed. Smarter Business: Dynamic Information with IBM InfoSphere Data Replication CDC. IBM, 2012.

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

Mobility management in wireless networks: Data replication strategies and applications. Kluwer Academic·, 2003.

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

Elmi, Amina H. N. Housing discrimination study: Replication of 1977 measures using current data. The Office, 1991.

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

Book chapters on the topic "Data replication"

1

Özsu, M. Tamer, and Patrick Valduriez. "Data Replication." In Principles of Distributed Database Systems, Third Edition. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-8834-8_13.

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

Kemme, Bettina. "Data Replication." In Encyclopedia of Database Systems. Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_110.

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

Özsu, M. Tamer, and Patrick Valduriez. "Data Replication." In Principles of Distributed Database Systems. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-26253-2_6.

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

Kemme, Bettina. "Data Replication." In Encyclopedia of Database Systems. Springer New York, 2017. http://dx.doi.org/10.1007/978-1-4899-7993-3_110-2.

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

Kemme, Bettina. "Data Replication." In Encyclopedia of Database Systems. Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_110.

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

van Steen, Maarten. "WAN Data Replication." In Encyclopedia of Database Systems. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_452-2.

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

van Steen, Maarten. "WAN Data Replication." In Encyclopedia of Database Systems. Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_452.

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

van Steen, Maarten. "WAN Data Replication." In Encyclopedia of Database Systems. Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_452.

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

Najafzadeh, Mahsa, and Suresh Jagannathan. "Geo-Replication Models." In Encyclopedia of Big Data Technologies. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-63962-8_186-1.

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

Najafzadeh, Mahsa, and Suresh Jagannathan. "Geo-replication Models." In Encyclopedia of Big Data Technologies. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-77525-8_186.

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

Conference papers on the topic "Data replication"

1

De Prisco, Roberto, Sergiy Shevchenko, and Pompeo Faruolo. "Blockchain Data Replication." In 20th International Conference on Security and Cryptography. SCITEPRESS - Science and Technology Publications, 2023. http://dx.doi.org/10.5220/0012121000003555.

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

Patil, Raksha, and Madhuri Zawar. "Improving replication results through directory server data replication." In 2017 International Conference on Trends in Electronics and Informatics (ICOEI). IEEE, 2017. http://dx.doi.org/10.1109/icoei.2017.8300788.

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

Al-Ekram, Raihan, and Ric Holt. "Multi-consistency Data Replication." In 2010 IEEE 16th International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2010. http://dx.doi.org/10.1109/icpads.2010.67.

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

Lin, Henry, J. H. Abawajy, and Rajkumar Buyya. "Economy-Based Data Replication Broker." In 2006 Second IEEE International Conference on e-Science and Grid Computing (e-Science'06). IEEE, 2006. http://dx.doi.org/10.1109/e-science.2006.261174.

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

Huang, Yixiu, Prasad Sistla, and Ouri Wolfson. "Data replication for mobile computers." In the 1994 ACM SIGMOD international conference. ACM Press, 1994. http://dx.doi.org/10.1145/191839.191845.

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

Jianfeng, Zhu, Qin Leihua, Zeng Dong, and Zhou Jinli. "A Duplicate-Aware Data Replication." In 2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST). IEEE, 2008. http://dx.doi.org/10.1109/fcst.2008.34.

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

Sathya, S. Siva, S. Kuppuswami, and R. Ragupathi. "Replication Strategies for Data Grids." In 2006 International Conference on Advanced Computing and Communications. IEEE, 2006. http://dx.doi.org/10.1109/adcom.2006.4289868.

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

Brinkmann, André, and Sascha Effert. "Data replication in p2p environments." In the twentieth annual symposium. ACM Press, 2008. http://dx.doi.org/10.1145/1378533.1378570.

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

Ping, Fan, Xiaohu Li, Christopher McConnell, Rohini Vabbalareddy, and Jeong-Hyon Hwang. "Towards Optimal Data Replication Across Data Centers." In 2011 31st International Conference on Distributed Computing Systems Workshops (ICDCS Workshops). IEEE, 2011. http://dx.doi.org/10.1109/icdcsw.2011.49.

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

Ren, Kun, Zhanhuai Li, Chao Wang, and Nan Jiang. "Design of Data Replication System on FreeBSD." In 2010 International Conference on Data Storage and Data Engineering (DSDE). IEEE, 2010. http://dx.doi.org/10.1109/dsde.2010.15.

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

Reports on the topic "Data replication"

1

Perez, David, and Andrew Hendrian. Advanced Patient Data Replication and Recovery. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada564156.

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

Perez, David, and Andrew E. Hendrian. Advanced Patient Data Replication and Recovery at Eisenhower. Defense Technical Information Center, 2009. http://dx.doi.org/10.21236/ada563928.

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

Nguyen-Tuong, Anh, Andrew S. Grimshaw, and John F. Karpovich. Fault Tolerance via Replication in Coarse Grain Data-Flow. Defense Technical Information Center, 2006. http://dx.doi.org/10.21236/ada447046.

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

Kang, Myong H., Judith N. Froscher, John McDermott, Oliver Costich, and Rodney Peyton. Achieving Database Security Through Data Replication: The Sintra Prototype. Defense Technical Information Center, 1994. http://dx.doi.org/10.21236/ada464289.

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

Douglas Kuflick Wood, Benjamin, and Michell Dong. Recalling extra data: a replication study of Finding missing markets. International Initiative for Impact Evaluation (3ie), 2015. http://dx.doi.org/10.23846/rps0005.

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

Talamas Marcos, Miguel Ángel. Data and Replication Materials for Grandmothers and the Gender Gap in the Mexican Labor Market. Inter-American Development Bank, 2023. http://dx.doi.org/10.18235/0004798.

Full text
Abstract:
The files include the data and replication materials for “Grandmothers and the gender gap in the Mexican labor market.” The dataset covers three-generation households from 2005 to 2020. The primary data source is the Mexican Occupation and Employment Survey collected by the Mexican Bureau of Statistics (INEGI). The data has a rotating panel format, and each household is observed for five quarters.
APA, Harvard, Vancouver, ISO, and other styles
7

Tegethoff, Thomas. Replication Data for: Strategy and additive technologies as the catalyst for outsourcing, process innovation and operational effectiveness. CESA, 2022. http://dx.doi.org/10.57130/fk2/szekno.

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

Matthew, Gray. Data from "Winter is Coming – Temperature Affects Immune Defenses and Susceptibility to Batrachochytrium salamandrivorans". University of Tennessee, Knoxville Libraries, 2021. http://dx.doi.org/10.7290/t7sallfxxe.

Full text
Abstract:
Environmental temperature is a key factor driving various biological processes, including immune defenses and host-pathogen interactions. Here, we evaluated the effects of environmental temperature on the pathogenicity of the emerging fungus, Batrachochytrium salamandrivorans (Bsal), using controlled laboratory experiments, and measured components of host immune defense to identify regulating mechanisms. We found that adult and juvenile Notophthalmus viridescens died faster due to Bsal chytridiomycosis at 14 ºC than at 6 and 22 ºC. Pathogen replication rates, total available proteins on the skin, and microbiome composition likely drove these relationships. Temperature-dependent skin microbiome composition in our laboratory experiments matched seasonal trends in wild N. viridescens, adding validity to these results. We also found that hydrophobic peptide production after two months post-exposure to Bsal was reduced in infected animals compared to controls, perhaps due to peptide release earlier in infection or impaired granular gland function in diseased animals. Using our temperature-dependent infection results, we performed a geographic analysis that suggested that N. viridescens populations in the northeastern United States and southeastern Canada are at greatest risk for Bsal invasion. Our results indicate that environmental temperature will play a key role in the epidemiology of Bsal and provide evidence that temperature manipulations may be a viable Bsal management strategy.
APA, Harvard, Vancouver, ISO, and other styles
9

Chejanovsky, Nor, and Suzanne M. Thiem. Isolation of Baculoviruses with Expanded Spectrum of Action against Lepidopteran Pests. United States Department of Agriculture, 2002. http://dx.doi.org/10.32747/2002.7586457.bard.

Full text
Abstract:
Our long-term goal is to learn to control (expand and restrict) the host range of baculoviruses. In this project our aim was to expand the host range of the prototype baculovirus Autographa cali/arnica nuclear polyhedrosis virus (AcMNPV) towards American and Israeli pests. To achieve this objective we studied AcMNPV infection in the non-permissive hosts L. dispar and s. littoralis (Ld652Y and SL2 cells, respectively) as a model system and the major barriers to viral replication. We isolated recombinant baculoviruses with expanded infectivity towards L. dispar and S. littoralis and tested their infectivity towards other Lepidopteran pests. The restricted host range displayed by baculoviruses constitutes an obstacle to their further implementation in the control of diverse Lepidopteran pests, increasing the development costs. Our work points out that cellular defenses are major role blocks to AcMNPV replication in non- and semi-permissive hosts. Therefore a major determinant ofbaculovirus host range is the ability of the virus to effectively counter cellular defenses of host cells. This is exemplified by our findings showing tliat expressing the viral gene Ldhrf-l overcomes global translation arrest in AcMNPV -infected Ld652Y cells. Our data suggests that Ld652Y cells have two anti-viral defense pathways, because they are subject to global translation arrest when infected with AcMNPV carrying a baculovirus apoptotic suppressor (e.g., wild type AcMNPV carryingp35, or recombinant AcMNPV carrying Opiap, Cpiap. or p49 genes) but apoptose when infected with AcMNPV-Iacking a functional apoptotic suppressor. We have yet to elucidate how hrf-l precludes the translation arrest mechanism(s) in AcMNPV-infected Ld652Y cells. Ribosomal profiles of AcMNPV infected Ld652Y cells suggested that translation initiation is a major control point, but we were unable to rule-out a contribution from a block in translation elongation. Phosphorylation of eIF-2a did not appear to playa role in AcMNPV -induced translation arrest. Mutagenesis studies ofhrf-l suggest that a highly acidic domain plays a role in precluding translation arrest. Our findings indicate that translation arrest may be linked to apoptosis either through common sensors of virus infection or as a consequence of late events in the virus life-cycle that occur only if apoptosis is suppressed. ~ AcMNPV replicates poorly in SL2 cells and induces apoptosis. Our studies in AcMNPV - infected SL2ceils led us to conclude that the steady-state levels of lEI (product of the iel gene, major AcMNPV -transactivator and multifunctional protein) relative to those of the immediate early viral protein lEO, playa critical role in regulating the viral infection. By increasing the IEl\IEO ratio we achieved AcMNPV replication in S. littoralis and we were able to isolate recombinant AcMNPV s that replicated efficiently in S. lifforalis cells and larvae. Our data that indicated that AcMNPV - infection may be regulated by an interaction between IE 1 and lED (of previously unknown function). Indeed, we showed that IE 1 associates with lED by using protein "pull down" and immunoprecipitation approaches High steady state levels of "functional" IE 1 resulted in increased expression of the apoptosis suppressor p35 facilitating AcMNPV -replication in SL2 cells. Finally, we determined that lED accelerates the viral infection in AcMNPV -permissive cells. Our results show that expressing viral genes that are able to overcome the insect-pest defense system enable to expand baculovirus host range. Scientifically, this project highlights the need to further study the anti-viral defenses of invertebrates not only to maximi~e the possibilities for manipulating baculovirus genomes, but to better understand the evolutionary underpinnings of the immune systems of vertebrates towards virus infection.
APA, Harvard, Vancouver, ISO, and other styles
10

Rodgers, A., Natalie Coon, and Scott Finfrock. SCALE Calculations Replicating ARH-600 Data. Office of Scientific and Technical Information (OSTI), 2022. http://dx.doi.org/10.2172/1886624.

Full text
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