DSpace

King Saud University Repository >
King Saud University >
COLLEGES >
Science Colleges >
College of Computer and Information Sciences >
College of Computer and Information Sciences >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/15535

Title: Querying and Restructuring XML Data by Graphical Query Language
Authors: Dr. Mourad Ykhlef
Keywords: XML, G-XML, Graphical query, Annotated XML, Matching algorithm.
Issue Date: 2010
Publisher: International Journal of Web Information Systems, Emerald Group Publishing, Bingley, UK , Volume 6
Abstract: Purpose- The rapid development of XML from a mere data exchange format to a universal syntax for encoding domain specific information increases the need of new query languages specifically visualized to address the characteristics of XML. Such languages should be able not only to extract information from XML documents, but also to apply powerful restructuring operators, based on a well-defined semantics. Moreover, XML queries should be natural to write and understand, as also end users are expected to access the large XML information bases supporting their businesses. In this article we propose a new graphical query language GQLX for querying and restructuring XML data. Design/methodology/approach – The methodology emphasizes on GQLX’s development which is base of G-XML data model syntax to express a wide variety of XML queries, ranging from simple selection, to expressive data transformations involving grouping, aggregation and sorting. GQLX has an operational semantics based on the annotated XML, which serves to express queries and data trees in form of XML. Also, we present in this article an algorithm to achieve the matching between data and query trees after translating them into annotated XML. Findings- Developed and demonstrated were: a G-XML syntax; annotated XML for the semantic operations and a matching algorithm. Research limitations/implications – The future research work on our language is that expanding it to include recursion and nested queries. Practical implications – The algorithms/approaches proposed can be implemented to enhance the performance of our XML query language. Originality/value – The proposed work integrates various novel techniques for XML query syntax/semantic into a single language with a suitable matching algorithm.
URI: http://hdl.handle.net/123456789/15535
Appears in Collections:College of Computer and Information Sciences

Files in This Item:

File Description SizeFormat
Mourad Ykhlef-journal-4.docx16.32 kBMicrosoft Word XMLView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

DSpace Software Copyright © 2002-2007 MIT and Hewlett-Packard - Feedback