Allison L. Powell · 2001
The proliferation of online information resources increases the importance of e ective and e cient information retrieval in a multi-collection environment. Multi-collection searching includes distributed searching as a special case but is more broadly defined here to incorporate searching partitioned content independently from its physical storage. It is cast in three parts: collection selection (also referred to as database selection) -- decide where should a query be sent; query processing -- execute the query at each selected collection; and results merging -- combine the results from individual collections into a single coherent list for the searcher. We focus our attention on collection selection. We compare anumber of different collection selection approaches and examine the effect of collection selection on document retrieval performance. We consider multi-collection retrieval in six different test environments utilizing three document testbeds. Considering collection selection in isolation, we find that effective collection selection can be achieved using limited information about each collection. We then turn our attention from selection alone to data item retrieval in a multi-collection environment, considering retrieval perfor-
Cited by 0
Gabriel Dragomir, Iosif Ignat · 2006
In this paper we are going to discuss about a subject that although was treated for a long period of time, it still remains a challenging one. In distributed database, the fundamental architecture is client-server multi-tier. The efforts in distributed database environment domain consist in heterogeneous data sources inter-linking, new applications with new data models that have impact on their functionality. In our work we made a series of scenario tests of a distributed database environment implemented at external level, with active views. Two distributed databases were used, the first one simply referring to students and exams and the second one more complicated, like TPC-H benchmark model
Cited by 0
Héctor García-Molina, Robert Abbott · Proceedings of the IEEE · 1987
A reliable distributed database must manage dispersed and replicated data, making them available to users in spite of hardware failures. In this paper we study the algorithms and techniques that can achieve this reliability. Three scenarios are considered for reliable (i.e., nonpartitionable) networks. In the first, data are distributed but not replicated; in the second, data are replicated; and in the third, both data and processing are fully replicated in an n-modular redundancy strategy. A brief survey of methods for handling network partitions is included.
Cited by 50
2015
Cited by 2
LING LIU, M. TAMER ÖZSU · Encyclopedia of Database Systems · 2009
Cited by 12
Wang-Chuan Tsai · 1982
Deadlock detection in distributed database systems is very complicated and difficult to handle because of the distributed nature of the system and the communication delay of the network. Many detection algorithms have been proposed in the past, but most of them have been shown to be incorrect and inefficient. Designing an applicable algorithm is still worthy of intensive study.
In this thesis, a distributed deadlock detection algorithm is proposed. Checking a cycle in a graph, called an graph, is used to detect a deadlock state. The inter-communication scheme of the algorithm generates and propagates messages in order to update the RTR graphs at other sites. The reaching message is a fixed-size message containing a transaction node, a resource node and a timestamp. Timestamps are also attached to the graph edges in order to avoid false deadlocks. A deadlock recovery approach is also proposed to break deadlock after it is detected. A minimum cost policy and a polling synchronization scheme are used in the algorithm in order to break the detected deadlock state with a minimum communication cost.
A message generation scheme based on transaction ordering has been applied to the proposed deadlock detection algorithm to reduce the number of reaching messages transmitted and increase the efficiency of the deadlock detection. For a deadlock state with n transactions involved, this algorithm needs half the number of reaching messages of the original algorithm in the worst case.
The proposed algorithm has been shown to be correct and more efficient compared to previously proposed algorithms. It has been shown that the reaching message generation scheme of the algorithm will ensure the detection of all possible deadlocks, and the comparison of timestamps in graph edges and messages will prevent false deadlocks.
A simulator in PATH PASCAL has been written during the design of the algorithm for testing correctness and improving performance. Four network sites with I/O channels to the virtual network model have been simulated.
Cited by 28
Ainul Azila Che Fauzi, Wan Fariza Wan Abdul Rahman, Auni Fauzi et al. · 2021
One of the mechanisms for managing data is replication since it improves data access and reliability. However, the amount of various data grows rapidly since technology is widely available at a low-cost. Problem arises when the transactions only work with a part of the database, not as a whole.This paper will discuss about a technique called database fragmentation. Fragmentation in distributed database is very useful in terms of usage, reliability and efficiency. Handling fragmented database replication becomes a challenging issue to administrators since the distributed database is scattered into split replica partitions or fragments. We address how to build a reliable system by using a distributed database fragmentation algorithm. The result shows that managing database replication with fragmentation will help a transaction to work with the specific part of the database rather than the entire database.
Cited by 2
Wen-Te K. Lin, P. A. Bernstein, Nathan Goodman et al. · 1983
Abstract : This is the third of three volumes of the final technical report for the project Distributed Database Control and Allocation. This volume attempts to provide a handbook of information about a number of important concurrency control algorithms which can be used in the design of a distributed data base management system.
Cited by 0
Shou‐Hsuan Stephen Huang · NASA STI Repository (National Aeronautics and Space Administration) · 1986
The purpose of the ORACLE interface is to enable the DAVID program to submit queries and transactions to databases running under the ORACLE DBMS. The interface package is made up of several modules. The progress of these modules is described below. The two approaches used in implementing the interface are also discussed. Detailed discussion of the design of the templates is shown and concluding remarks are presented.
Cited by 0Open access
Yuri Breitbart, Peter L. Olson, Glenn R. Thompson · 1986
This paper describes the approach to database integration in a heterogeneous distributed database environment utilized by the Amoco Distributed Database System (ADDS). We start with the definition of the extended relational data model that is used by ADDS for database integration. We demonstrate various aspects of resolving possible data conflicts occurring in the database integration process. The ADDS query and data definition languages are defined and their expressive power is discussed. We conclude with presentation of a query conversion algorithm to convert a user data request into a set of queries against supported physical databases.
Cited by 140
William Perrizo · 2007
In recent years research in the area of distributed transaction management has been growing rapidly. While designing concurrency control components for such systems, the most common techniques have involved locking and timestamping and variations of these. In spite of their heavy use in the designing of distributed systems, each of the above techniques has its own specific disadvantages and overhead. Our primary goal is to describe an approach that has the advantages of each of these techniques and none of their disadvantages. In this paper, we describe the Distributed Window Request Order Linked List method and show how this technique embodies most of the advantages of the standard techniques yet at the same time does not introduce serious difficulties or extra overhead of its own. We include an experimental comparison to compare transaction response time for this new method to those of locking and timpstamping methods. Keywords: distributed, database, concurrency, ROLL. SECTION 1. In...
Cited by 0
David M. Choy, Patricia G. Selinger · 2002
To support a distributed, heterogeneous computing environment, an inter-system catalog protocol is needed so that remote resources can be located, used, and maintained with little human intervention. This paper describes a scalable catalog framework, which is an extension of previous work in a distributed relational DBMS research prototype called R*. This work builds on the R* concepts to accommodate heterogeneity, to handle partitioned and replicated data, to support non-DBMS resource managers, and to enhance catalog access performance and system extensibility.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 6
Shannon Miller · Defense Technical Information Center (DTIC) · 1992
This paper describes techniques for assessing the performance of Distributed DataBase Manager (DDBN) systems. Both qualitative and quantitative methods of assessment are addressed. The desirability of collecting data from a test-bed system for use in the evaluation is highlighted. Finally, a functional requirement for a Distributed DataBase Management Evaluation Software (DBMES) package to be developed for the Distributed Processing Test-bed System (DPTBS) is presented.
Cited by 0
M. TAMER ÖZSU, Patrick Valduriez · ACM Computing Surveys · 1996
article Free AccessDistributed and parallel database systems Authors: M. Tamer Özsu Department of Computing Science, University of Alberta, Edmonton, Canada Department of Computing Science, University of Alberta, Edmonton, CanadaView Profile , Patrick Valduriez INRIA, Rocquencourt, Le Chesnay Cedex, France INRIA, Rocquencourt, Le Chesnay Cedex, FranceView Profile Authors Info & Claims ACM Computing SurveysVolume 28Issue 1March 1996 pp 125–128https://doi.org/10.1145/234313.234368Published:01 March 1996Publication History 61citation4,639DownloadsMetricsTotal Citations61Total Downloads4,639Last 12 Months812Last 6 weeks78 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cited by 437Open access
Elizabeth Fong, Bruce K Rosen · 1988
Distributed Database Management Systems are exciting and potentially very powerful.However, distributed database management systems often have created increased complexity of database management and controls without providing the expected benefit to the organization's operations.Distributed database management systems may not be desirable for every organization.Their benefits can be realized only with careful planning, and evaluation of alternative strategies.This guide provides an organization's decision makers the appropriate information to make good decisions in evaluating distributed database management technology for their individual environments.Also, this guide aids in planning for an orderly migration path into a distributed database environment.
Cited by 4
Yuxing Chen, Anqun Pan, Hailin Lei et al. · Proceedings of the VLDB Endowment · 2024
Distributed databases have become indispensable in contemporary computing and data processing, owing to their pivotal role in ensuring high availability and scalability. They effectively cater to the requirements of data management and high-concurrency access. However, developing a distributed database system that is well-suited for diverse application scenarios, particularly for large-scale applications, presents several challenges. These challenges include ensuring data consistency and achieving high levels of performance. This paper presents TDSQL, a distributed database system that prioritizes core design principles of distributed systems, including high availability, strong consistency, and scalability. In particular, TDSQL has achieved high performance through over a decade of practical experience and optimization in various modules, such as the kernel, synchronous replication, and transaction processing, in large-scale application scenarios. By conducting the TPC-C benchmark test, TDSQL demonstrated outstanding performance, achieving a throughput of 814 million tpmC across 1650 database nodes, with a jitter rate of less than 0.2%. This jitter rate is an order of magnitude lower than the standard required, showcasing the system's stability and reliability. During the 8-hour TPC-C standard stress test, TDSQL successfully completed over 860 billion transactions and processed 40 trillion order details, with zero forced rollbacks and zero data inconsistency.
Cited by 10
Paul Brown · Elsevier eBooks · 2001
Cited by 2
Zakaria Suliman Zubi · 2009
This paper will examine the underlying features of the distributed database architecture. Learning the task of distributed database management system will lead us to a successful design. The design will improve scalability, accessibility and flexibility while accessing various types of data. Developing a successful distributed database system requires to address the importance of security issues that may arise and possibly compromise the access control and the integrity of the system. We propose some solutions for some security aspects such as multilevel access control, confidentiality, reliability, integrity and recovery that pertain to a distributed database system.
Cited by 14
Martin Hoppen, Michael Schluse, Jurgen Rosmann et al. · Proceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC) · 2012
Distributed 3D simulations are used in various fields of application like geo information systems (GIS), space robotics or industrial automation. We present a new database-driven approach that combines 3D real-time simulation techniques with object-oriented data management. It consists of simulation clients that replicate from a central database object data as well as the data schema itself. The central database stores static and dynamic parts of a simulation model, distributes changes caused by the simulation, and logs the simulation run. Compared to standard decentralized methods this approach has several advantages like persistence for state and course of time, object identification, standardized interfaces for simulation, modeling and evaluation, as well as a consistent data schema and world model for the overall system, which at the same time serves as a means for communication.
Cited by 14
Bent, Graham, Dantressangle, Patrick, Vyvyan, David et al. · 2008
Cited by 21Open access