Distributed Database Research Papers - Academia.edu (original) (raw)

A distributed database is structured from global relations, fragmentation and data allocation. A global relation can be divided into fragments and each fragment may itself contain a relation. The fragmentation describes how each fragment of the distributed database is derived from the global relations. The data allocation allows the allocation of discrete sets of fragments to the sites of the computer network supporting the distributed database. The objective of the present work is to develop a strategy for distributed database design that is simple and useful to achieve the objectives of data fragmentation, allocation, and replication. It has been designed to fragment and allocate data in a distributed relational database system using different types of computers on a network.

- by
- •
- Computer Science, Distributed Database

We present a bayesian framework for XML document retrieval. This framework allows us to consider content only. We perform the retrieval task using inference in our network. Our model can adapt to a specific corpus through parameter learning and uses a grammar to speed up the retrieval process in big or distributed databases. We also experimented list filtering to avoid element overlap in the retrieved element list.

The object-oriented paradigm has several features that facilitate the integration of heterogeneous data management systems. One of the main problems in the integration is to provide users with the same data model and language to access very different systems. This problem exists in all kinds of distributed heterogeneous data management systems, independently from their integration architecture (like classical distributed databases, federated databases, multidatabases). This paper shows that the use of an object-oriented data model for building a "uniform" view of several databases can greatly simplify this task, and actually extends the scope of integration towards two directions. The first concerns the integration of data management systems to which traditional integration techniques, based on mappings among data models, cannot be applied. The second direction moves the goal of integration to re-using not only data but to re-using data and application software using these data. In the paper we also briefly discuss some requirements for an object-oriented integrated platform.

- by G. Pelagatti
- •
- Distributed Computing, Distributed Database, Distributed System, Distributed Systems

A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in a communication efficient manner. Specifically, we assume that each node holds a time varying input vector, and we are interested in determining, at any given time, whether the value of an arbitrary function on the average of these vectors crosses a predetermined threshold.

- by Assaf Schuster
- •
- Distributed Database, Distributed System, Algorithm Design, Data Models
- by John Drennan
- •
- Engineering, Distributed Database, Fuel Cells, Image Analysis

The algebra of qualified relations proposed by Ceri and Pelagatti supports pruning of distributed database queries, minimizing the number of sites involved in evaluation. Domain interval typing in the framework of formal type inference subsumes this approach, pruning not only unsatisfiable subqueries involving fragmentation predicates, but also unsatisfiable subqueries mentioning any relation attribute

- by David Eichmann
- •
- Algebra, Computer Science, Distributed Database, Information Retrieval

Oracle XE 10g (Express Edition) is an Oracle edition which purposed to the requirement of the data management for small enterprise to the middle enterprise which freeware licence. Unfortunately, Oracle XE 10g database capacity limited 4 GB. One of the methods in a distributed database system is heterogenous distributed database systems use partialy connected network topology to solve the problem of the capacity limit at Oracle XE 10g. To increase the data storage capacity, the oracle XE database connected to the MySQL database with the help of the simulation database ODBC link academic information system Keyword : database, distributed database, heterogenous distributed database system, academic information system. A. PENDAHULUAN Oracle XE 10g (Express Edition) adalah edisi Oracle yang ditujukan untuk keperluan pengelolaan data pada instansi atau perusahan kecil sampai menengah yang berlisensi freeware / gratis. Para pemakai Oracle XE 10g dapat menggunakannya tidak hanya untuk percobaan, tapi juga dapat digunakan untuk pengembangan dan deployment sistem. Oracle XE dapat dikatakan sebagai sebuah produk database server portabel yang menyediakan teknologi inti database server yang diambil dari inti (kernel) dan digunakan dalam produk Oracle versi Professional ataupun Enterprise. Oracle XE 10g ini memiliki keterbatasan yaitu kapasitas penyimpanan data hanya sebesar 4 GB. Keterbatasan penyimpanan data pada Oracle XE 10g ini dapat ditingkatkan dengan cara diterapkannya sistem basis data terditribusi, dimana penyimpanan data tidak hanya pada satu database, tetapi memiliki lebih dari satu database. Terdapat dua macam metode dalam database terdistribusi, yaitu: homogenous distributed database system dan heterogenous distributed database system. Homogenous distributed database system adalah suatu sistem yang menjalankan tipe DBMS yang sejenis di setiap unit distribusi data. Misal: MySQL didistribusikan dengan MySQL, Oracle dengan Oracle. Sedangkan heterogenous distributed database system adalah suatu sistem yang menjalankan tipe DBMS yang berbeda di setiap unit distribusi datanya, baik secara relational DBMS ataupun non relational DBMS. Misalkan di suatu unit memakai DBMS Oracle, dan di unit lain memakai DBMS MYSQL, dimana kedua DBMS ini saling bisa berkomunikasi. Melihat kemampuan Sistem Basis Data Terdistribusi ini, maka keterbatasan kapasitas pada Oracle XE dapat ditingkatkan dengan cara menambahkan DBMS lain untuk meningkatkan kapasitas Oracle XE 10g dengan mempergunakan metode heterogenous distributed database system. B. TINJAUAN PUSTAKA Distributed Database (DDB)

- by M Didik R Wahyudi
- •
- Distributed Database

The deduction capabilities for existing distributed relational databases are discussed. The propagation SQL-based systems are considered, and alternative strategies for providing inferencing and declarative reasoning capabilities on heterogeneous databases are presented. It is concluded that there is a trend towards distributed computational environments which primarily utilize heterogeneous SQL-based database management systems. Hence, it becomes increasingly important to integrate the accesses to these heterogeneous commercial databases through programming techniques which allow the specification of multiple persistent objects in the same program without worrying where the individual objects are stored, or on what platform, or through which commercial database management system. It also becomes important to support declarative reasoning database languages on these heterogeneous distributed databases.<<ETX>>

The Distributed Computing Software project at Oxford University is using formal specification techniques to explore the design of services in a distributed operating system. Our goal is to construct and publish the specification of a loosely-coupled distributed operating system consisting of a number of autonomous services. Some design principles have been proposed from consideration of conventional business practice. Several services have already been designed and implemented according to these principles.

- by Jonathan Bowen
- •
- Computer Science, Distributed Computing, Distributed Database, Memory Management

Data store is the keystone component of any e-service system, which backs up its primary functionality and enables knowledge mining. Its features determine performance and API architecture for an entire system. Thus, directly impacts user experience through efficiency and application code complexity. Paper presents novel data store architecture, and positions its concept on the landscape of state-of-the-art solutions and relevant theory. In particular, it defines data availability problem, gives an overview of widely spread solutions, defines consistency relaxation problem, and elaborates on its implications on data store architecture. Paper is concluded by stating necessary future developments and resulting research targets.

- by Bolatzhan Kumalakov and +1
- •
- Distributed Database

Load balancing functionalities are crucial for best Grid performance and utilization. Accordingly,this paper presents a new meta-scheduling method called TunSys. It is inspired from the natural phenomenon of heat propagation and thermal equilibrium. TunSys is based on a Grid polyhedron model with a spherical like structure used to ensure load balancing through a local neighborhood propagation strategy. Furthermore, experimental results compared to FCFS, DGA and HGA show encouraging results in terms of system performance and scalability and in terms of load balancing efficiency.

- by Hanêne Ben-Abdallah
- •
- Computer Science, Algorithms, Distributed Computing, Distributed Database

This paper discusses the requirements for developing Mobile Model-based Bridge Lifecycle Management Systems (MMBLMSs). These new systems should link all the information about the lifecycle stages of a bridge (e.g., construction, inspection and maintenance) to a 4D model of the bridge incorporating different scales of space and time in order to record events throughout the lifecycle with suitable levels of details. In addition, MMBLMSs should support distributed databases and mobile location-based computing by providing user interfaces that could be used on thin clients, such as PDAs and tablet PCs, equipped with wireless communications and tracking devices, such as a GPS receivers. A prototype system developed in Java language is used to demonstrate the feasibility of the proposed methodology for realizing these systems.

- by Elaheh Mozaffari
- •
- Management, Civil Engineering, Computer Science, Distributed Database

Web applications built using Java technologies usually access relational databases via JDBC API. This requires a database system specific JDBC driver to be installed on the application side. On the other hand, a paradigm shift is taking place in web application architectures. Future web applications will be built around Service-Oriented Architectures (SOA) where applications will be assembled using remote &amp;quot;web

La empresa McDonald's es una de las mas conocidas a nivel mundial. Creo que todos sin diferencia de edades, razas o status reconocen el famoso restaurante de comida rápida. Lo que no todos conocemos es cómo llegó a convertirse en lo que... more

- by Evelyn P
- •
- Information Systems, Distributed Computing, Distributed Database, Distributed System

Site initialization is the problem of integrating a new site actions must be able to access data at the new site in the same into a running distributed database system (DDBS). Site recovery is the way as they access data at all other sites. The main problem is problem of integrating an old site into a DDBS when the site recovers to bring the database at the new site up-to-date relative to the from failure. Site backup is the problem ofcreatinga static backup copy rest of the system. The problem is caused by replicated data: of a database for archival or query purposes. We present an algorithm that solves the site initialization problem. By modifying the algorithm if the new site stores data Xand there are copies of X elsewhere slightly, we get solutions to the other two problems as well.

- by Nathan Goodman
- •
- Information Systems, Distributed Database, Database Systems, Algorithm

The Oracle is one of the most widely used products in the world for data storage. This article defines concepts and features exhibits of distributed database using the Oracle architecture.

- by José Torquato
- •
- Distributed Database, Data storage

Efficient methods of processing unanticipated queries are a crucial prerequisite for the success of generalized database management systems. A wide variety of approaches to improve the performance of query evaluation algorithms have been... more

- by Nisar Ahmed
- •
- Computer Science, Algorithms, Distributed Database, Query Optimization

In this paper, we present a performance comparison of database replication techniques based on total order broadcast. While the performance of total order broadcast-based replication techniques has been studied in previous papers, this paper presents many new contributions. First, it compares with each other techniques that were presented and evaluated separately, usually by comparing them to a classical replication scheme like distributed locking. Second, the evaluation is done using a finer network model than previous studies. Third, the paper compares techniques that offer the same consistency criterion (one-copy serializability) in the same environment using the same settings. The paper shows that, while networking performance has little influence in a LAN setting, the cost of synchronizing replicas is quite high. Because of this, total order broadcast-based techniques are very promising as they minimize synchronization between replicas.

- by Matthias Wiesmann
- •
- Distributed Database, Performance, Group communication, Synchronization

This paper describes a scalable architecture for Web servers designed to cope with the ongoing increase of the Internet requirements. In the paper, first the drawbacks of the traditional Web server architecture are discussed, and the need for an innovative solution is described. The proposed design addresses two of the parameters that can dramatically impact the performance of Web servers: (1) the need for a powerful data management system to cope with the increase in the complexity of users' requests; and (2) an efficient caching mechanism to reduce the amount of redundant traffic. In this direction, a scalable solution based on distributed database technology to replace the file system is described, and performance test results of the system are provided. This architecture is further extended by a collaborative caching system that builds up an adaptive hierarchy of caches for Web servers, which allows them to keep up with the changes in the traffic generated by the applications they are running. Finally, some improvements to the proposed architecture are addressed.

Digital world is growing very fast and become more complex in the volume (terabyte to petabyte), variety (structured and un-structured and hybrid), velocity (high speed in growth) in nature. This refers to as 'Big Data' that is a global phenomenon. This is typically considered to be a data collection that has grown so large it can't be effectively managed or exploited using conventional data management tools: e.g., classic relational database management systems (RDBMS) or conventional search engines. To handle this problem, traditional RDBMS are complemented by specifically designed a rich set of alternative DBMS; such as-NoSQL, NewSQL and Search-based systems. This paper motivation is to provide-classification, characteristics and evaluation of NoSQL databases in Big Data Analytics. This report is intended to help users, especially to the organizations to obtain an independent understanding of the strengths and weaknesses of various NoSQL database approaches to supporting applications that process huge volumes of data.

- by Dr. Syed Akhter Hossain
- •
- Computer Science, Software Engineering, Distributed Database, Data Mining

Distributed database system technology is one of the major developments in information technology area. It will continue to have a very significant impact on data processing in the upcoming years because distributed database systems have many potential advantages over centralized systems for geographically distributed organizations. The continuing interest in distributed database systems in the research community and the marketplace and the introduction of many commercial products indicate that distributed database systems will play a more important role in data processing and eventually will replace centralized systems as the major database technology in the future. The availability of high speed communication networks and, especially, the phenomenal popularity of the Internet and the intranets will undoubtedly speed up the transition process. Some challenging problems must be solved before the full potential benefits of distributed database technology can be realized. Among them is query processing (including query optimization), one of the most important issues in distributed database system design. The query optimization problem in large-scale distributed databases is NP-hard in nature and difficult to solve. In this study, the query optimization problem is reduced to a join ordering problem similar to a variant of traveling salesman problem. We explored several heuristics and a genetic algorithm for solving the join ordering problem. Some computational experiments on these algorithms were conducted and solution qualities compared. The computation experiments show that heuristics and genetic algorithms are viable methods for solving query optimization problem in large scale distributed database systems. 262 issues related to the problem, to model the problem, taking into consideration the most important factors, to propose some solution methods for these models, and, finally, to conduct computational experiments and compare the results to determine the effectiveness and efficiency of the solution techniques (algorithms). We believe that the development of the comprehensive models for the query optimization in large-scale systems, as well as finding effective and/or efficient solution techniques to solve the problems that have been identified are important and will contribute to the use of and research on distributed database technology.

- by nisar Ahmed
- •
- Distributed Database, Information Technology, Genetic Algorithm, Query Optimization

A federated database system (FDBS) is a collection of cooperating database systems that are autonomous and possibly heterogeneous. In this paper, we define a reference architecture for distributed database management systems from system and schema viewpoints and show how various FDBS architectures can be developed. We then define a methodology for developing one of the popular architectures of an FDBS. Finally, we discuss critical issues related to developing and operating an FDBS.

Simple example for Distributed database

- by krunal randive
- •
- Distributed Database

General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal Take down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

- by Mike P Papazoglou
- •
- Information Systems, Computer Science, Distributed Database, Distributed System

The present work extends a performance metrics method for the treatability of some classes of problems in manufacturing automation that can be represented as a system-of- systems controlled by a cyber-physical infrastructure. With the use of proper distributed and recursive computing approaches, the complexity of the control of cyber-physical systems can be attacked through a unified and human-centered simple framework that complies with the forthcoming pervasive computing challenges posed by the smart manufacturing scenarios. The aim of this work is to provide the proof of concept of an effective methodology that relies on the decomposition of a production goal into a hierarchical self-similar structure of subgoals for the steering of the system towards improved effectiveness. An implementation of the technique is proposed by
means of multi-actor and multi-database paradigms. The simulation of an implementation and an experimental deployment on low cost embedded device is provided.

- by Andrea Bonci and +2
- •
- Distributed Database, Embedded Systems, Cyber-Physical Systems, Performance metrics

Abstract–In Cellular networks, number of users increase in an exponential manner. As a result of this exponential growth of users, overloading of the system takes place. Besides this, unacceptable delays and high computational cost create a strong prerequisite for efficient location management techniques. Motivated by this fact, a novel user profile based (UPB) scheme is proposed in this paper to track the location of the mobile users.

Distributed database systems (DDBS) pose different problems when accessing distributed and replicated databases. Particularly, access control and transaction management in DDBS require different mechanism to monitor data retrieval and update to databases. Current trends in multi-tier client/server networks make DDBS an appropriated solution to provide access to and control over localized databases. Oracle, as a leading Database Management System (DBMS) vendor employs the two-phase commit technique to maintain consistent state for the database. The objective of this paper is to explain transaction management in DDBS and how Oracle implements this technique. An example is given to demonstrate the step involved in executing the two-phase commit. By using this feature of Oracle, organizations will benefit from the use of DDBS to successfully manage the enterprise data resource.

- by Ghazi Alkhatib
- •
- Distributed Database, Design, Database Systems, Local Area Networks

The recent advance in cloud computing and distributed web applications has created the need to store large amount of data in distributed databases that provide high availability and scalability. In recent years, a growing number of companies have adopted various types of non-relational databases, commonly referred to as NoSQL databases, and as the applications they serve emerge, they gain extensive market interest. These new database systems are not relational by definition and therefore they do not support full SQL functionality. Moreover, as opposed to relational databases they trade consistency and security for performance and scalability. As increasingly sensitive data is being stored in NoSQL databases, security issues become growing concerns.

- by Nurit GalOz
- •
- Relational Database, Distributed Database, Database Security, Distributed Databases

The fragment allocation design is an essential issue that improves the performance of the applications processing in the Distributed Database systems (DDBs). The database queries access the applications on the distributed database sites and should be performed effectively. Therefore, the fragments that accessed by queries are needed to be allocated to the DDBs sites so as to reduce the communication cost during the applications execution and handle their operational processing.

- by Muthu Ramachandran
- •
- Distributed Database

Distributed data - data, processed by a system, can be distributed among several computers, but it is accessible from any of them. A distributed database design problem is presented that involves the development of a global model, a fragmentation, and a data allocation. The student is given a conceptual entity-relationship model for the database and a description of the transactions and a generic network environment. A stepwise solution approach to this problem is shown, based on mean value assumptions about workload and service. A management system of a distributed database (SGBDD) is a software system that enables management and distributing BDD transparent to the user. A SGBDD consists of a single database which is decomposed into fragments, poassibly some fragments are multiplied, and each fragment or copy kept on one or more sites under the control of a local DBMS. Each site is capable of processing user queries in the local system, independently of the rest of the network, or ...

- by Burlacu Andreea
- •
- Computer Science, Distributed Database, Design, Knowledge Management

Distributed database (DDB) is one of the emerging fields of technology and market research. This article addresses different architectures of distributed databases, distributed database management systems (DDBMS), data dependency techniques, the importance and drawbacks of the DDB. The problem areas mentioned in the paper are extremely useful when implementing distributed databases to ensure easy management of competence, impasse, protection and privacy. In this paper we will also research distributed database design for integrating the business environment in a distributed database.

- by Asagba Prince
- •
- Computer Science, Distributed Database, Information Technology, Technology

Modern health care institutions are often multi-site organisations that implement heterogeneous information management systems interacting with distributed databases. Advances in treatment modality/technology and rapidly changing information technology create increasing demand for changes/redevelopment of many health information applications. These features spawn the need for solutions to (a) guarantee data exchange across different types of applications and database management systems, and (b) reduce the costs of systems development and modification. This paper explores the concept of 'middleware services' as a solution to achieve these goals. It reports on the successful application of a component-based 3-tier system architecture to develop a computerised clinical pathways management system. The implementation experience confirms a number of significant benefits of the 3-tier structure including, reusability, flexibility, significant reduction in costs and efforts of systems development, and provision of easy, open migration pathway for future change of technology and system redevelopment.

- by Stephen Chu
- •
- Engineering, Distributed Database, Information Technology, Medical Informatics
- by Arvola Chan
- •
- Distributed Database

In this paper we survey, consolidate, and present the state of the art in distributed database concurrency control. The heart of our analysts is a decomposition of the concurrency control problem into two major subproblems: read-write and write-write synchronization. We describe a series of synchromzation techniques for solving each subproblem and show how to combine these techniques into algorithms for solving the entire concurrency control problem. Such algorithms are called "concurrency control methods." We describe 48 principal methods, including all practical algorithms that have appeared m the literature plus several new ones. We concentrate on the structure and correctness of concurrency control algorithms. Issues of performance are given only secondary treatment.

Concurrency control is one of the essential tasks of any database management system. It is impracticable to maintain the integrity of the database system in a concurrent environment without concurrency control techniques. This study discusses distributed transactions, ACID properties, and states of transactions, distributed concurrency control and various concurrency control techniques for a distributed database. It also examines the challenges associated with distributed transactions and concurrency control, and highlights the benefits of distributed concurrency control techniques in a distributed environment.

Retailing represents the culmination of the marketing process, the contact point between consumers and manufacturer products, marketing communications and customer service. This paper reviews the research on retail marketing that has appeared in the academic literature in the last several years. The review will address the revolutionary changes occurring in retailing today brought on by the availability of purchase transaction databases and new fomls of marketing communications. The author suggests a reorientation of the role of retailers away from the prevailing focus on distribution toward an emphasis on integrated communications and the management of customer relationships. Research on many aspects of both store and nonstore retailing are discussed in terms of this orientation. © 1997 Elsevier Science B.V.

- by Gladis Glad
- •
- Marketing, Distributed Database, Retailing

Digital world is growing very fast and become more complex in the volume (terabyte to petabyte), variety (structured and un-structured and hybrid), velocity (high speed in growth) in nature. This refers to as 'Big Data' that is a global phenomenon. This is typically considered to be a data collection that has grown so large it can't be effectively managed or exploited using conventional data management tools: e.g., classic relational database management systems (RDBMS) or conventional search engines. Computational and storage requirements of applications such as for Big Data Analytics, Business Intelligence and social networking over peta-byte datasets have pushed SQL-like centralized databases to their limits. To handle these problems, traditional RDBMS are complemented by specifically designed a rich set of alternative DBMS. This led to the development of horizontally scalable, distributed non-relational data stores, called No-SQL databases. This paper motivation is to provide -classification, characteristics, and evaluation of NoSQL databases for Big Data. This report is intended to help users, especially to the organizations to obtain an independent understanding of the strengths and weaknesses of various NoSQL database approaches to supporting applications that process huge volumes of data.

- by A B M Moniruzzaman
- •
- Computer Science, Software Engineering, Distributed Database, Data Mining

Databases are replicated to improve performance and availability. The notion of correctness that has commonly been adopted for concurrent access by transactions to shared, possibly replicated, data is serializability. However, serializability may be impractical in high-performance applications since it imposes too stringent a restriction on concurrency. When serializability is relaxed, the integrity constraints describing the data may be violated. By allowing bounded violations of the integrity constraints, however, we are able to increase the concurrency of transactions that execute in a replicated environment. In this article, we introduce the notion of an N-ignorant transaction, which is a transaction that may be ignorant of the results of at most N prior transactions, which is a transaction that may be ignorant of the results of at most N prior transactions. A system in which all transactions are N-ignorant can have an N + 1-fold increase in concurrency over serializable systems...

- by Arthur Bernstein
- •
- Information Systems, Computer Science, Distributed Database, Accessibility

The design and implementation of a reliable group communication mechanism is presented. The mechanism guarantees a form of atomicity in that messages are received by all operational members of the group or by none of them. In addition, the order of messages is the same at each of the recipients. The message ordering property can be used to simplify distributed database and distributed processing algorithms. The proposed mechanism can survive despite process, host and communication failures. Survivability is essential in fault-tolerant applications.

- by IJCSMC Journal
- •
- Computer Science, Distributed Database, Information Technology, Technology
- by A. Kadvan
- •
- Programming Languages, Distributed Database, Nutrition and Dietetics, Documentation

Current distributed, heterogeneous database management systems (DBMSs) address the issue of distributed transaction management (DTM) in two different ways: some systems rely solely on unmodified local transaction managers (LTMs), thereby helping preserve local DBMS autonomy, but limit functionality (e.g. allow only unsynchronized retrievals, preclude distributed updates, etc.); others maintain full functionality but require the (re)design of the LTMs to enforce homogeneous DTM across all heterogeneous DBMSs, thereby giving up most of the local DBMS autonomy.

- by Radu Popescu-zeletin
- •
- Information Systems, Distributed Database, Information Retrieval, Autonomy

This article show different mobile database security threats that may be occurs for mobile database in the real world and gives possible solution to eliminate them. Mobile database is a specialized class of distributed systems. There are security challenges due to the distributed nature of the mobile database application and the hardware constraints of mobile devices. In this document, we will deals with the subject of security in four fields. These four areas include: Security of mobile device, security of operating system on mobile device, security of mobile database and security of mobile network. We identify a set of security vulnerabilities on mobile database and try to apply appropriate technique to decrease side affect for mobile database security. Important security issues for mobile device, mobile operating system and mobile network that maybe affect on mobile database security are discussed along with possible solution. Finally, for more security, this paper offers a comprehensive solution that may be applied to distributed database.

The allocation of data to nodes in a computer communications network is a critical issue in distributed database design, specially in wide area network where optimizing the distributed queries is the main objective. Numerous models of data allocation have been presented so far no optimal or universally accepted algorithm exists yet, and very few algorithms have been implemented to date (Rob and Cornonel, 1993). In this paper a method to construct a model of data allocation for distributed database system has been proposed. The adopted method for the construction of the data allocation model leads to an efficient model of its kind. The proposed model not only solves distributed database design problem, but also solves distributed database maintenance problem by covering initial allocation and post allocation of the data. The efficiency of proposed model has been proved by comparing proposed model with other relevant models.

- by Nadeem Daudpota
- •
- Distributed Database, Database Design, Wide Area Network, Numerical Model

The need for large-scale data sharing between autonomous and possibly heterogeneous decentralized systems on the Web gave rise to the concept of P2P database systems. Decentralized databases are, however, not new. Whereas a definition for a P2P database system can be readily provided, a comparison with the more established decentralized models, commonly referred to as distributed, federated and multidatabases, is more likely to provide a better insight to this new P2P data management technology. Thus, in the paper, by distinguishing between db-centric and P2P-centric features, we examine features common to these database systems as well as other ad-hoc features that solely characterize P2P databases. We also provide a non-exhaustive taxonomy of the most prominent research efforts toward the realization of full-fledged P2P databases.

- by A. Bonifati and +1
- •
- Distributed Database, Data Management, Data Sharing, Peer to Peer