A Dynamic Object Fragmentation and Replication Algorithm In Distributed Database Systems

Sleit, Azzam; Almobaideen, Wesam; Al-Areqi, Samih; Yahya, Abdulaziz

doi:10.3844/ajassp.2007.613.618

Cited by 19 publications

(13 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Failures during a transaction (whether network partitions or site failures) can be tolerated as long as [3]the sites available at commit contain a majority of replicas of all the objects written to and during reads, a majority of replicas are read to find the version numbers. If these requirements are violated, the transaction must be aborted.…”

Section: Introductionmentioning

confidence: 99%

Steps to System Reconfiguration in a Distributed Database System: A Fault-tolerant Approach

Ita¹,

O²,

Igiri³

2014

IOSRJCE

View full text Add to dashboard Cite

Abstract:In this paper, we examine steps to system reconfiguration in a Distributed Database using some fault tolerance scheme for a distributed database system that is compatible with respect to system failure i.e. Normal transaction processing is carried out assuming that no failure will occur, but if failure is suspected at some stage or site then a system reconfiguration is undertaken. The reconfiguration and system transaction are guaranteed as long as there exist a majority of working sites belonging to the same database

show abstract

Section: Introductionmentioning

confidence: 99%

Steps to System Reconfiguration in a Distributed Database System: A Fault-tolerant Approach

Ita¹,

O²,

Igiri³

2014

IOSRJCE

View full text Add to dashboard Cite

show abstract

“…Therefore, it makes modeling the HTML structure into a DOM tree becoming an essential aspect. For that purpose, the need of an artificial intelligence is required in the formulation of its algorithm (Dehuri et al, 2006;Mamat et al, 2006;Sleit et al, 2007).…”

Section: Introductionmentioning

confidence: 99%

Proposing the new Algorithm and Technique Development for Integrating Web Table Extraction and Building a Mashup

Gultom

Sari²,

Budiardjo³

2011

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement: Nowadays, various types of data in web table can be easily extracted from the Internet, although not all of web tables are relevant to the users. As we may know, most web pages are in unstructured HTML format, making web table extraction process very time consuming and costly. HTML format only focuses on the presentation, not based on the database system. Therefore, users need a tool in dealing with that process. Approach: This research proposed an approach for implementing web table extraction and making a Mashup from HTML web pages using Xtractorz application. It is also discussed on how to collaborate and integrate a web table extraction process in the stage of building a Mashup, i.e., Data Retrieval, Data Source Modeling, Data Cleaning/ Filtering, Data Integration and Data Visualization. The main issue lies in stage of data modeling creation, in which Xtractorz must be able to automatically render Document Object Model (DOM) tree in accordance to HTML tag or code of the web page from which the table is extracted. To overcome that, the Xtractorz is equipped with algorithm and rules so it can enable to specifically analyze the HTML tags and to extract the data into a new table format. The algorithm is created by using recursive technique within a user-friendly GUI of Xtractorz. Results: The approach was evaluated by conducting experiment using Xtractorz and other similar applications, such as RoboMaker and Karma. The result of experiment showed that Xtractorz is more efficient in completing the experiment tasks, since Xtractorz has fewer steps to complete the whole tasks. Conclusion: Xtractorz can give a positive contribution in terms of algorithm technique and a new approach method to web table extraction process and making a Mashup, where the core algorithm can extracts web data tables using recursive technique while rendering the DOM tree model automatically.

show abstract

“…Due to the complexity of this problem, more heuristic algorithms were proposed (for example [1,3,4,7,9,10,11]). We describe a new and much simpler algorithm which offers an approximate solution for the proposed problem.…”

Section: Redistribution Of the Fragmentsmentioning

confidence: 99%

“…An optimal allocation of the fragments in the nodes of the network is necessary for the request evaluation time to be minimum. In [1,3,4,7,9,10,11] are mentioned other solutions for solving the allocation problem. Because of the complexity of this problem (NP-complete problem) more heuristic algorithms were proposed, algorithms with a lower complexity that provide only an approximate solution.…”

Section: Introductionmentioning

confidence: 99%

Redistributing Fragments into a Distributed Database

Ţâmbulea

Horvat-Petrescu

2008

INT J COMPUT COMMUN

View full text Add to dashboard Cite

A distributed system database performance is strongly related to the fragment allocation in the nodes of the network. An heuristic algorithm for redistributing the fragments is proposed. The algorithm uses the statistical information relative to the requests send to a distributed database. This algorithm minimizes the size of the data transferred for solving a request. Assuming that a distribution of the fragments in the nodes of a network is known, the algorithm generates a plan to transfer data fragments, plan that will be used to evaluate a request.

show abstract

A Dynamic Object Fragmentation and Replication Algorithm In Distributed Database Systems

Cited by 19 publications

References 14 publications

Steps to System Reconfiguration in a Distributed Database System: A Fault-tolerant Approach

Steps to System Reconfiguration in a Distributed Database System: A Fault-tolerant Approach

Proposing the new Algorithm and Technique Development for Integrating Web Table Extraction and Building a Mashup

Redistributing Fragments into a Distributed Database

Contact Info

Product

Resources

About