Abstract: Materialized views can bring important performance benefits when querying XML documents. In the presence of XML document changes, materialized views need to be updated to faithfully reflect the changed document. In this work, we present an algebraic approach for propagating source updates to XML materialized views expressed in a powerful XML tree pattern formalism. Our approach differs from the state-of-the-art in the area in two important ways. First, it relies on set-oriented, algebraic operations, to be contrasted with node-based previous approaches. Second, it exploits state-of-the-art features of XML stores and XML query evaluation engines, notably XML structural identifiers and associated structural join algorithms. We present algorithms for determining how updates should be propagated to views, and highlight the benefits of our approach over existing algorithms through a series of experiments.

Abstract: In this paper, we propose an energy and latency efficient XML dissemination scheme for the mobile computing. We define a novel unit structure called G-node for streaming XML data in the wireless environment. It exploits the benefits of the structure indexing and attribute summarization that can integrate relevant XML elements into a group. It provides a way for selective access of their attribute values and text content. We also propose a lightweight and effective encoding scheme, called Lineage Encoding, to support evaluation of predicates and twig pattern queries over the stream. The Lineage Encoding scheme represents the parent-child relationships among XML elements as a sequence of bit-strings, called Lineage Code(V, H), and provides basic operators and functions for effective twig pattern query processing at mobile clients. Extensive experiments using real and synthetic data sets demonstrate our scheme outperforms conventional wireless XML broadcasting methods for simple path queries as well as complex twig pattern queries with predicate conditions.

Abstract: Since the beginning of the Semantic Web initiative, significant efforts have been invested in finding efficient ways to publish, store, and query metadata on the Web. RDF and SPARQL have become the standard data model and query language, respectively, to describe resources on the Web. Large amounts of RDF data are now available either as stand-alone datasets or as metadata over semi-structured (typically XML) documents. The ability to apply RDF annotations over XML data emphasizes the need to represent and query data and metadata simultaneously. We propose XR, a novel hybrid data model capturing the structural aspects of XML data and the semantics of RDF, also enabling us to reason about XML data. Our model is general enough to describe pure XML or RDF datasets, as well as RDF-annotated XML data, where any XML node can act as a resource. This data model comes with the XRQ query language that combines features of both XQuery and SPARQL. To demonstrate the feasibility of this hybrid XML-RDF data management setting, and to validate its interest, we have developed an XR platform on top of well-known data management systems for XML and RDF. In particular, the platform features several XRQ query processing algorithms, whose performance is experimentally compared.

Abstract: Existing XML keyword search approaches can be categorized into tree-based search and graph-based search. Both of them are structure-based search because they mainly rely on the exploration of the structural features of document. Those structure-based approaches cannot fully exploit hidden semantics in XML document. This causes serious problems in processing some class of keyword queries. In this paper, we thoroughly point out mismatches between answers returned by structure-based search and the expectations of common users. Through detailed analysis of these mismatches, we show the importance of semantics in XML keyword search and propose a semantics-based approach to process XML keyword queries. Particularly, we propose to use Object Relationship OR graph, which fully captures semantics of object, relationship and attribute, to represent XML document and we develop algorithms based on the OR graph to return more comprehensive answers. Experimental results show that our proposed semantics-based approach can resolve the problems of the structure-based search, and significantly improve both the effectiveness and efficiency.

Abstract: A great deal of research into the learning of schemas from XML data has been conducted in recent years to enable the automatic discovery of XML schemas from XML documents when no schema or only a low-quality one is available. Unfortunately, and in strong contrast to, for instance, the relational model, the automatic discovery of even the simplest of XML constraints, namely XML keys, has been left largely unexplored in this context. A major obstacle here is the unavailability of a theory on reasoning about XML keys in the presence of XML schemas, which is needed to validate the quality of candidate keys. The present article embarks on a fundamental study of such a theory and classifies the complexity of several crucial properties concerning XML keys in the presence of an XSD, like, for instance, testing for consistency, boundedness, satisfiability, universality, and equivalence. Of independent interest, novel results are obtained related to cardinality estimation of XPath result sets. A mining algorithm is then developed within the framework of levelwise search. The algorithm leverages known discovery algorithms for functional dependencies in the relational model, but incorporates the properties mentioned before to assess and refine the quality of derived keys. An experimental study on an extensive body of real-world XML data evaluating the effectiveness of the proposed algorithm is provided.

Abstract: The combination of multiple clusterings for partitioning XML documents is proposed as a promising method, aimed to decompose the inherently difficult problem of catching structural and content relationships within an XML corpus into a number of simpler subproblems. To verify the validity of such an intuition, a new technique for partitioning XML documents is presented, in which conventional clustering techniques operating on flattened representations of individual aspects of the XML documents (that also include some rare patterns) are used to partition the available XML corpus. The effectiveness of the devised technique is revealed by a comparative empirical evaluation on benchmark XML corpora.

Abstract: XML data flow has reached beyond the world of computer science and has spread to other areas such as data communication, e-commerce and instant messaging. Therefore, manipulating this data by non-expert programmers is becoming imperative and has emerged two alternatives. On one hand, Mashups have emerged a few years ago, providing users with visual tools for web data manipulation but not necessarily XML specific. Mashups have been leaning towards functional composition but no formal definitions have yet been defined. On the other hand, visual languages for XML have been emerging since the standardization of XML, and mostly relying on querying XML data for extraction or structure transformations. These languages are mainly based on existing textual XML languages, they have limited expressiveness and do not provide non-expert programmers with means to manipulate XML data. In this paper, we define a generic visual language called XCDL based on Colored Petri Nets allowing non-expert programmers to compose manipulation operations. The XML manipulations range from simple data selection/projection to data modification (insertion, removal, obfuscation, etc.). The language is oriented to deal with XML data (XML documents and fragments), providing users with means to compose XML oriented operations. The language core syntax is presented here along with an implemented prototype based on it.

Abstract: XML has become the standard for publishing and exchanging data on the Web. Since most of the business data nowadays are stored in structured databases including relational and object-oriented databases (OODB), it is of significance to automate the transformation process and generate the XML data containing information from existing databases. At the same time, information imprecision and uncertainty exist in many practical applications, and for this reason, fuzzy data modeling has been extensively investigated in various data models. As such, there is an increasing need to effectively publish fuzzy structured data as fuzzy XML documents for Web-based applications. In this paper, we take a significant step in a fundamental consolidation of fuzzy XML. In particular, we are interested in finding an XML schema that best describes the existing fuzzy object-oriented schema. To accomplish this, we first offer mapping formalisms to capture the semantics of fuzzy XML Schema and fuzzy object-oriented schema. To allow for better and platform independent sharing of data stored in an object-oriented format, we investigate the formal transformation from fuzzy OODB to fuzzy XML and develop a set of rules to assist in the transformation process.

Abstract: Information imprecision and uncertainty exist in many real-world applications and for this reason fuzzy data management has been extensively investigated in various database management systems. Currently, introducing native support for XML data in relational database management systems (RDBMs) has attracted considerable interest with a view to leveraging the powerful and reliable data management services provided by RDBMs. Although there is a rich literature on XML-to-relational storage, none of the existing solutions satisfactorily addresses the problem of storing fuzzy XML data in RDBMs. In this paper, we study the methodology of storing and querying fuzzy XML data in relational databases. In particular, we present an edge-based approach to shred fuzzy XML data into relational data. The unique feature of our approach is that no schema information is required for our data storage. On this basis, we present a generic approach to translate path expression queries into SQL for processing XML queries.

Abstract: This work aims at treating the inference problem in XML documents that are assumed to represent potentially incomplete information. The inference problem consists in providing a control mechanism for enforcing inference-usability confinement of XML documents. More formally, an inference-proof view of an XML document is required to be both indistinguishable from the actual XML document to the clients under their inference capabilities, and to neither contain nor imply any confidential information. We present an algorithm for generating an inference-proof view by weakening the actual XML document, i.e., eliminating confidential information and other information that could be used to infer confidential information. In order to avoid inferences based on the schema of the XML documents, the DTD of the actual XML document is modified according to the weakening operations as well, such that the modified DTD conforms with the generated inference-proof view.

Abstract: It is known that the exchange of information between web applications is done by means of the SOAP protocol. Securing this protocol is obviously a vital issue for any computer network. However, when it comes to cloud computing systems, the sensitivity of this issue rises, as the clients of system, release their data to the cloud. XML signature is employed to secure SOAP messages. However, there are also some weak points that have been identified, named as XML signature wrapping attacks, which have been categorized into four major groups; Simple Ancestry Context Attack, Optional element context attacks, Sibling Value Context Attack, Sibling Order Context. In this paper, two existing methods, for referencing the signed part of SOAP Message, named as ID referencing and XPath method, are analyzed and examined. In addition, a new method is proposed and tested, to secure the SOAP message. In the new method, the XML any signature wrapping attack is prevented by employing the concept of XML digital signature on the SOAP message. The results of conducted experiments show that the proposed method is approximately three times faster than the XPath method and even a little faster than ID.

Abstract: The XML stream filtering applications are gaining popularity in recent years. These Applications require a filtering system that queries on a continuous stream of XML documents and delivers matched content accordingly. A PFilter algorithm has been proposed recently by authors. It has been found to be more effective on a large number of XML streaming documents. The algorithm is used for extracting the information of user's interest in information systems. The present paper proposes an XML stream filtering system architecture based on PFilter algorithm. [10] The algorithm converts the XPath query expressions for the queries into sequences of nodes. The system provides efficient and fast search in the streaming XML document. Experimental results are given for the performance of the filtering system for thousands of queries on streaming XML documents. Performance versus depth of queries and probability of occurrence of XPath operators demonstrates that the proposed system performs better compared to earlier state-of-the-art YFilter system. The proposed system can be used in applications requiring data dissemination based on user interest.

Abstract: Purpose – Office documents are widely used in our daily activities, so the number of them has been increasing. A demand for sophisticated search for office documents becomes more important. The recent file format of office documents is based on a package of multiple XML files. These XML files include not only body text but also page structure data and style data. The purpose of this paper is to utilize them to find similar office documents.Design/methodology/approach – The authors propose SOS, a similarity search method based on structures and styles of office documents. SOS needs to compute similarity values between multiple pairs of XML files included in the office documents. We also propose LAX+, which is an algorithm to calculate a similarity value for a pair of XML files, by extending existing XML leaf node clustering algorithm.Findings – SOS and LAX+ are evaluated by using three types of office documents (docx, xlsx and pptx) in our experiments. The results of LAX+ and SOS are better than ones of th...

Abstract: XML is ubiquitously used as an information exchange platform for web-based applications in healthcare, life sciences, and many other domains. Proliferating XML data are now managed through latest native XML database technologies. XML data sources conforming to common XML schemas could be shared and integrated with syntactic interoperability. Semantic interoperability can be achieved through semantic annotations of data models using common data elements linked to concepts from ontologies. In this paper, we present a framework and software system to support the development of semantic interoperable XML based data sources that can be shared through a Grid infrastructure. We also present our work on supporting semantic validated XML data through semantic annotations for XML Schema, semantic validation and semantic authoring of XML data. We demonstrate the use of the system for a biomedical database of medical image annotations and markups.

Abstract: "An Introduction to XML Query Processing and Keyword Search" systematically and comprehensively covers the latest advances in XML data searching. It presents an extensive overview of the current query processing and keyword search techniques on XML data, including XML labeling schemes, indexing, processing on order and un-order XML tree patterns, XML query optimization, results estimation, and XML keyword searches, which are elaborated in separate chapters. Graduate students and researchers in the field of XML data searching will find this book an invaluable resource. Prof. Jiaheng Lu is an associate professor at Renmin University of Chinas School of Information.

Abstract: The availability of vast amounts of heterogeneous XML web data motivates finding efficient methods to search, integrate, query, and present this data. The structure of XML documents is useful for achieving these tasks; however, not every XML document on the web includes a schema. We discuss challenges and accomplishments in the area of generation and integration of XML schemas. We propose and implement a framework for efficient schema extraction and integration from heterogeneous XML document collections collected from the web. Our approach introduces the Schema Extended Context Free Grammar SECFG to model XML schemas, including detection of attributes, data types, and element occurrences. Unlike other implementations, our approach supports the generation of XML schemas in any XML schema language, e.g., DTDs or XSD. We compare our approach with other proposed approaches and conclude that we offer the same or better functionality more efficiently and with greater flexibility.

Abstract: Grammar-based XML compression reduces the volume of big XML data collections, but fast updates of compressed data may become a bottleneck. An open question still was, given an XPath Query and an update operation, how to efficiently compute the update positions within a grammar representing a compressed XML file. In this paper, we propose an automaton-based solution, which computes these positions, combines them in a so-called Update DAG, supports parallel updates, and uses dynamic programming to avoid an implicit decompression of the grammar. As a result, our solution updates compressed XML even faster than MXQuery and Qizx update uncompressed XML.

Abstract: The eXtensible Mark-up Language rapidly has become a very powerful standard for the data exchange. Labeling schemes have been introduced to optimize data retrieval and query processing on XML database documents. This is done by providing labels that hold information about XML tree nodes. In this paper we introduce a novel labeling scheme XDAS whose labeling technique is inspired by IP addressing and subnetting technique used in computer networks. This technique is used when dividing a network into several sub-networks. Each sub-network is assigned a subnet mask that helps in identifying the parent network. So, this labeling scheme treats XML documents as a network with sub-networks and assigns labels for XML tree nodes using the masking technique. Experimental results show that XDAS, when compared to Dewey and Range labeling schemes, provides an efficient label size, disk space required to store labels and matching time required to identify relationships between nodes.

Abstract: Reverse Engineering (RE) is a method to extract requirement information application from XML at higher level of abstraction. At present, reverse engineering of XML focus on transformation XML to conceptual model, which is UML. The transformation result is presented in variety of diagrams. The transformation result is beneficial for developer and designer tracking changes in analysis phase. However, it does not show changes from the requirements view. Therefore, this paper shows the framework of reverse engineering from XML to UML for generating software requirement specification. In this work, the related work of reverse engineering XML is clear but none are extending to requirements level. This paper also proposes research method to extend transformation XML to SRS.

Abstract: The Extensible Markup Language (XML) has been acknowledging as the defacto standard for data exchange over the web and data representation. But on the other hand its main drawback that of being huge in size. The huge document size means that the amount of information has to be stored, transmitted, and queried is often larger than that of other data formats. Several XML compression techniques have been introduced to deal with these problems. In this paper, we present an experimental study of available XML compression techniques and we provide guidelines for users for making an effective decision towards selecting the most suitable XML compression tool according their needs.

Abstract: XML has become a defacto standard for data representation and exchange, XML data processing becomes more and more important for server workloads like web servers and database servers. One of the most time consuming part is XML document parsing. Parsing is a core operation performed before an XML document can be navigated, queried, or manipulated. Recently, high performance XML parsing has become a topic of considerable interest In this paper, we are presenting a performance study of XML data parsing by evaluating these parsers using time as a parameter. The proposed design uses four different data structures linked list, stack, array queue. All these data structures are linear in nature. We evaluate the data parsing behaviour and study architectural characteristics. The proposed design analyses the performance of XML parsing techniques using various data structures. Based on observed analysis and graphical results it shows that the data structure based parser is efficient than SAX & DOM parsers..

Abstract: Our compression technique is an abstraction of Packed Encoding Rules and has been implemented by the Packed objects structured data compression tool. Rather than trying to support a complex standard we instead describe a very simple technique which allows us to implement a very light-weight encoder capable of compressing structured data represented in XML. We call this work Integer Encoding Rules (IER). The technique is based on a simple mapping of data values belonging to a set of data types to a series of integer values. The data values come from XML data and the data types come from XML Schema.

Abstract: The functional need of executing transaction on Electronic Commerce has made security a necessary built-in feature. Also, placing the E-Commerce portal in cloud through cloud computing technologies has undoubtedly increased the security challenges. Thus necessitate a design of secured authentication framework to be employed by the web-based E-Commerce portals. Existing works on XML-based authentication and comparison with non-XML signature-based security mechanism showed the strength in employing XML digital signature approach in authenticating Business to Consumer E-Commerce. Also the review revealed the limitations in the previously applied XML signature and its application approach. Therefore, this paper aims to design a novel algorithmic security framework for authentication using XML digital signature in conjunction with PKI standard using elliptic curve in B2C cloud-based E-Commerce portal. The novel algorithmic framework will be validated through simulation with C++ as the programming language using Microsoft Windows Environment. The outcome of this research will be an improved authentication mechanism for XML digital signature.

Abstract: Ensuring the security of electronic data has morphed into one of the most important requirements in domains such as health care, where the eXtensible Markup Language (XML) has been leveraged via standards such as the Health Level 7’s Clinical Document Architecture and the Continuity of Care Record. These standards dictate a need for approaches to secure XML schemas and documents. In this paper, we present a secure information engineering method that is capable of generating eXtensible Access Control Markup Language (XACML) enforcement policies, defined in a role-based access control model (RBAC), that target XML schemas and their instances, allowing instances to be customized for users depending on their roles. To achieve this goal, we extend the Unified Modeling Language (UML) with two new diagrams: the XML Schema Class Diagram, which defines the structure of an XML document in UML style; and, the XML Role-Slice Diagram, which defines roles and associated privileges at a granular access control level. We utilize a personal health assistant mobile application for medication and chronic disease management to demonstrate the enforcement component of our work.

Abstract: Currently in the application level of Internet of Things (IoT), relevant data format standards are very complicated and every relational subject goes his own way. To solve this problem, this paper, from the view of XML and G/S model, started with the relationship among Internet, Semantic Web and IoT and then put forward the way of building the IoT data format standardization system. The IoT data format standardization should be based on XML for syntax and on G/S model. Data Exchange Standards System of the IoT should adopt XML as its grammar format. Finally, the system (base on MSML) with a specific application is illustrated.

Abstract: The increased deployment of the XML-based standard for representation and exchange in multi-disciplinary domains has enforced the need for a more effective way to deal with XML query processing. Since very limited attention has been given to the semantic nature of the XML data being processed, this paper focuses on a technique for XML query optimization, called Object-based Twig Query (OTQ), to utilize the semantic structure of the data being queried to process twig queries. A twig query, which is a type of query with multiple branches, requires complex processing due to the joins between multiple paths. Outperforms object-based data partitioning, which aims at leveraging the notion of frequently-accessed data subsets and putting these subsets together into adjacent partitions. It evaluates branched queries through two essential components: (i) OTQ indexing, which uses an object-based connection to construct its indices i.e. Schema index and Data index, and (ii) OTQ processing to produce the final results in optimal time. At the end of this paper, a set of experimental results for the proposed approach on arange of real and synthetic XML data, as well as a comparative study of a similar work in the area, is presented to demonstrate the effectiveness of OTQ optimization.