Samini Subramaniam

s-XML: An efficient mapping scheme to bridge XML and relational database

XML has recently emerged as the leading medium for data storage and data transfer over the World Wide Web due to its adaptable structure and flexibility in defining the tags. Many organizations had adopted XML as the principal facet in their online business applications. On the other hand, relational database is still widely used as the back-end database in most organizations. The diversity of these models need to be taken into account to ensure transparent and seamless integration. In this paper, we propose s-XML, an effective mapping scheme to bridge XML and relational database. Experimental results indicate that (1) s-XML is robust in terms of database storage and data loading; (2) s-XML processes query efficiently for complex chain and twig queries; and (3) s-XML is able to support large and skew-structured dataset as compared to relational DTD, Attribute and Edge approaches.

ReLab: A subtree based labeling scheme for efficient XML query processing

XML has become the de facto standard in the real world application over the WWW. Thus, data or query processing is critical to ensure speed response time to cater user queries. Response time is often influenced by the complexity of labeling scheme which is not only used for unique identification of XML nodes, but for structural relationship purpose as well. The labeling scheme adopted is vital to ensure query processing is done flawlessly and promptly. In this paper, we introduce ReLab, a subtree based labeling scheme which generates labels using depth-first traversal. Our experimental evaluation indicated that ReLab outperformed Dietz and region numbering schemes in terms of time taken to generate labels for each XML nodes.

Mapping and Labeling XML Data for Dynamic Update

Expeditious growth of XML as a data exchange medium over the web has inspired many researchers to propose efficient and effective mapping and labeling schemes for proficient XML processing. The most crucial aspect that an approach needs to cater is the support for dynamic update. In this paper, we scrutinize and study the existing approaches in terms of the table schema, complexity and support for dynamic update. In addition, we suggest a mapping approach to map XML data into relational database, s-XML based on the persistent labeling scheme.

ME labeling: A robust hybrid scheme for dynamic update in XML databases

Rapid development of XML technology over the World Wide Web has motivated the need for query optimization especially in a dynamic environment. As such, a good XML labeling scheme to ensure fast query processing is crucial. Although many labeling schemes were proposed in the past, only few support structural relationship efficiently. Therefore, in this paper, we propose a novel XML labeling scheme that helps quick determination of structural relationship among XML nodes and supports dynamic updates without relabeling nodes in case of update occurrences.

QTwig: A Structural Join Algorithm for Efficient Query Retrieval Based on Region-Based Labeling

Dependability on XML has increased tremendously over the years. As such the need for efficient query processing technique is certainly important. Despite the fact that these techniques are able to process queries with various edge combinations, they still suffer from processing overheads by buffering large amount of intermediate results particularly for parent–child (P–C) edges. Therefore, in this paper, we propose architecture named ReLaQ, which comprises of two components, ReLab+ (node annotator) and QTwig (query processor) for efficient XML query processing. QTwig improves retrieval time by incorporating a pruning technique that avoids accessing irrelevant data during query processing. Experimental results indicated that ReLaQ superseded TwigStack for both path and twig queries using both regular- and skewed-structured datasets. In addition, this is also proven by means of correctness analysis of ReLaQ.

s-XML: An efficient mapping scheme for storing XML data in a relational database

The exploration on XML mapping to relational database system has become one of the most important focus in present days due to the role of XML as the channel to transport data over the world wide web. The mapping schemes have effects towards the efficiency of XML processing in terms of database scalability, storage pace into database systems and types of information stored in the database. In this paper, we scrutinize the performance study of s-XML, an efficient XML mapping technique compared to some existing approaches. Experimental results indicate that s-XML performed better in terms of document storage compared to the existing approaches such as Edge and Attribute.

Mapping Relational Databases to Ontology Representation: A Review

Towards the recent years, huge amount of information are continuously growing and produced at a very fast pace. Nevertheless, most of it is published in formats that are not suitable to be process by analytic tools directly. In addition, most of these data sources are heterogeneous, thus, making it difficult task for data integration, and subsequently for data exchange. The aim of this paper is outline the steps to transform relational databases to ontology representation. We also review some of the recent mapping tools on the theoretical aspect of how each method works, focusing on discussing the benefits and drawbacks of these approaches. In addition, we also highlight the issues with the current tools, and subsequently outline the requirements of the mapping tools.

Prefix-based Labeling Annotation for Effective XML Fragmentation.

XML is gradually employed as a standard of data exchange in web environment since its inception in the 90s until present. It serves as a data exchange between systems and other applications. Meanwhile the data volume has grown substantially in the web and thus effective methods of storing and retrieving these data is essential. One recommended way is physically or virtually fragments the large chunk of data and distributes the fragments into different nodes. Fragmentation design of XML document contains of two parts: fragmentation operation and fragmentation method. The three fragmentation operations are Horizontal, Vertical and Hybrid. It determines how the XML should be fragmented. This paper aims to give an overview on the fragmentation design consideration and subsequently, propose a fragmentation technique using number addressing.