A comparative evaluation of XML repositories

Download

119501.pdf

Date

2002

Author

Ünal, Özgül

Metadata

Show full item record

Item Usage Stats

194
views

0
downloads

Recently XML has established itself as the standard for representing data in scientific and business applications. Starting out as a standard data exchange format over the web, it has become instrumental in all kinds of applications. Almost all standardization efforts on the web today are based on XML. As a consequence, the amount of XML data being stored and processed is large and will be increasing at a very rapid rate. This has caused XML data management to become a focus of research efforts in the database community and several different approaches to storing and querying XML documents have been proposed and implemented both by the research community and the industry. inIn this thesis, a survey of different approaches in storing and/or retrieving XML documents is provided. We have evaluated one mapping technique for relational database systems, and two native XML databases using a benchmark within the scope of this thesis. A number of results obtained from these experiments and a summary of the advantages and disadvantages of the approaches is presented. Moreover, we provide detailed information about Document Type Definition (DTD) and XML Schema and explain the strengths and limitations of them. We also look at different XML query languages and explain the advantages and disadvantages of XQuery and XPath.

Subject Keywords

Relational database management systems, Object oriented database systems, Native XML databases, XQueiy, XPath, DTD, XML schema

URI

https://hdl.handle.net/11511/13227

Collections

Graduate School of Informatics, Thesis

Suggestions

OpenMETU
Core

A new hybrid multi-relational data mining technique Toprak, Seda Dağlar; Toroslu, İ. Hakkı; Department of Computer Engineering (2005) Multi-relational learning has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. As patterns involve multiple relations, the search space of possible hypotheses becomes intractably complex. Many relational knowledge discovery systems have been developed employing various search strategies, search heuristics and pattern language limitations in order to cope with the complexity of hypothesis space. In this w...
An attempt to classify Turkish district data : K-Means and Self-Organizing Map (SOM) algorithms Aksoy, Ece; Işık, Oğuz; Department of Geodetic and Geographical Information Technologies (2004) There is no universally applicable clustering technique in discovering the variety of structures display in data sets. Also, a single algorithm or approach is not adequate to solve every clustering problem. There are many methods available, the criteria used differ and hence different classifications may be obtained for the same data. While larger and larger amounts of data are collected and stored in databases, there is increasing the need for efficient and effective analysis methods. Grouping or classific...
Efficient computation of strong partial transitive-closures Toroslu, İsmail Hakkı (null; 1993-01-01) The development of efficient algorithms to process the different forms of the transitive-closure (TC) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present a new algorithm suitable for processing one of these forms, the so called strong partially-instantiated, in which one of the query's argument is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values form both of the q...
The strong partial transitive-closure problem: Algorithms and performance evaluation Toroslu, İsmail Hakkı (1996-08-01) The development of efficient algorithms to process the different forms of transitive-closure (To) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, the so called strong partially instantiated transitive closure, in which one of the query's arguments is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values...
Using fuzzy Petri nets for static analysis of rule-bases Bostan-Korpeoglu, B; Yazıcı, Adnan (2004-01-01) We use a Fuzzy Petri Net (FPN) structure to represent knowledge and model the behavior in our intelligent object-oriented database environment, which integrates fuzzy, active and deductive rules with database objects. However, the behavior of a system can be unpredictable due to the rules triggering or untriggering each other (non-termination). Intermediate and final database states may also differ according to the order of rule executions (non-confluence). In order to foresee and solve problematic behavior...

Citation Formats

Ö. Ünal, “A comparative evaluation of XML repositories,” M.S. - Master of Science, Middle East Technical University, 2002.