scispace - formally typeset
Search or ask a question
Author

Samini Subramaniam

Bio: Samini Subramaniam is an academic researcher from Multimedia University. The author has contributed to research in topics: XML & XML database. The author has an hindex of 5, co-authored 24 publications receiving 74 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: Experimental results indicate that s-XML is robust in terms of database storage and data loading, and is able to support large and skew-structured dataset as compared to relational DTD, Attribute and Edge approaches.
Abstract: 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.

17 citations

Proceedings ArticleDOI
01 Nov 2014
TL;DR: ReLab, a subtree based labeling scheme which generates labels using depth-first traversal is introduced, and it is indicated that ReLab outperformed Dietz and region numbering schemes in terms of time taken to generate labels for each XML nodes.
Abstract: 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.

12 citations

Journal ArticleDOI
TL;DR: This paper proposes s-XML by adopting the Persistent Labeling scheme as the annotation scheme to ensure seamless integration with relational database and able to support updates without the need to re-construct the existing labels.
Abstract: XML has emerged as the leading medium for data transfer over the World Wide Web. At the present days, relational database is still widely used as the back-end database in most organizations. Since there is mismatch in these two structures, an effective mapping scheme is definitely essential that provides seamless integration with relational databases. On the other hand, an immutable labeling scheme is certainly significant to dentify the XML nodes uniquely as well as supports dynamic update without having the existing labels to be re-labeled when there is an occurance of dynamic update. As such, in this paper, we propose s-XML by adopting the Persistent Labeling scheme as the annotation scheme to ensure seamless integration with relational database and able to support updates without the need to re-construct the existing labels. We conduct experiments to show that s-XML performs better in terms of mapping the XML nodes to relational databases, query retrieval and dynamic update compared to the existing approaches. DOI: http://dx.doi.org/10.11591/ijece.v2i2.215 Full Text: PDF

11 citations

Proceedings ArticleDOI
01 Nov 2014
TL;DR: A novel XML labeling scheme is proposed that helps quick determination of structural relationship among XML nodes and supports dynamic updates without relabeling nodes in case of update occurrences.
Abstract: 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

11 citations

Journal ArticleDOI
TL;DR: Experimental results indicated that ReLaQ superseded TwigStack for both path and twig queries using both regular- and skewed-structured datasets, and this is also proven by means of correctness analysis of ReLaZ.
Abstract: 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.

6 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: This paper proposes a novel labeling scheme that not only completely avoids re-labeling but also improves the performance of determining the structural relationships when XML documents are frequently updated at arbitrary positions.
Abstract: Nowadays several labeling schemes are proposed to facilitate XML query processing, in which structural relationships among nodes could be quickly determined without accessing original XML documents. However, previous node indexing often encounters some troublesome problems when updates take place, such as a large amount of labels requiring re-labeling, huge space requirements for the updated labels, and inefficient determination of structural relationships. In this paper, we propose a novel labeling scheme that not only completely avoids re-labeling but also improves the performance of determining the structural relationships when XML documents are frequently updated at arbitrary positions. The fundamental difference between our scheme and previous ones is that, the gain in update performance of our labeling scheme does not come at the expense of the label size and the query performance. In particular, instead of completely assigning new labels for inserted nodes, the deleted labels are reused in our labeling scheme for encoding newly inserted nodes, which could effectively lower the label size. Moreover, we formally analyze the effectiveness of our proposed labeling scheme. Finally, we complement our analysis with experimental results on a range of real XML data.

22 citations

Journal ArticleDOI
TL;DR: This paper is a summary of literature review on models and prototypes on schema matching within the last 25 years to describe the progress of and research opportunities on a new models, methods, and/or prototypes.
Abstract: Schema matching is critical problem within many applications to integration of data/information, to achieve interoperability, and other cases caused by schematic heterogeneity. Schema matching evolved from manual way on a specific domain, leading to a new models and methods that are semi-automatic and more general, so it is able to effectively direct the user within generate a mapping among elements of two the schema or ontologies better. This paper is a summary of literature review on models and prototypes on schema matching within the last 25 years to describe the progress of and research chalenge and opportunities on a new models, methods, and/or prototypes.

22 citations

Journal ArticleDOI
TL;DR: This model is based on a set of comparison criteria based on the Intrinsic durability, industrialized solution, technical adaptability, strategy, technical architecture and Speed criteria, and results show that the values of these criteria allow developers to easily and properly choose the framwork that best meets their needs.
Abstract: The use of a framework is often essential for medium and large scale developments, but is also of interest for small developments. PHP has evolved as the scripting language the most chosen by developers, which has generated an explosion of PHP frameworks. There is a big debate about what the best PHP frameworks are, because the simple fact is that not all frameworks are built for everyone. Indeed, not all frameworks meet the same needs, and several frameworks can be used together in certain situations. Choosing the right framework, however, can sometimes be difficult. In order to make the selection process easier, we propose a pragmatic and complete model to compare and evaluate the main PHP frameworks. This model is based on a set of comparison criteria based on the Intrinsic durability, industrialized solution, technical adaptability, strategy, technical architecture and Speed criteria. Results show that the values of these criteria allow developers to easily and properly choose the framwork that best meets their needs

22 citations

Journal ArticleDOI
TL;DR: The proposed approach uses the change history to drastically reduce the time required for reconciling mappings among ontologies, as shown in the results.
Abstract: Mappings are established among ontologies for resolving the terminological and conceptual incompatibilities among information networks and information systems. Accommodating new knowledge in domain ontology causes the ontology to change from one consistent state to another. This consequently makes existing mappings among ontologies unreliable and stale due to the changes in resources. Mapping evolution eliminates discrepancies in the existing mappings. The proposed approach offers the benefits of re-establishing mappings among the updated ontologies in less time than is required with existing systems. It only considers the changed resources and eliminates staleness from the mappings. This approach uses the change history to drastically reduce the time required for reconciling mappings among ontologies, as shown in the results.

21 citations