Search

Content Extraction Signatures (CES) enable selective disclosure of verifiable content, provide privacy for blinded content, and enable the signer to specify the content the document owner is allowed to extract or blind. Combined, these properties give what we call CES functionality. In this paper we describe our work in developing custom transform algorithms to expand the functionality of an XML Signature to include CES functionality in XML Signature Core Validation.We also describe a custom revocation mechanism and our implementation for non-XML content where the custom transforms are dynamically loaded demonstrating that custom signing and verification is not constrained to a 'closed system'. Through the use of dynamic loading we show that a verifier can still verify an XML Signature-compliant signature even though a custom signature was produced.

Finding the required information in the vast area of web has been increasingly difficult in recent days since the web is overloaded with enormous content in the form of text, images, audio and video. Search engines help in this context to some extent but there are difficulties with them also. This paper proposes a framework in XML for the web pages in results of the search engines which helps in information filtering and search engine optimization.

TCP and UDP communication protocols are the most widely used transport methods for carrying out XML data messages between different services. XML data security is always a big concern especially when using internet cloud. Common XML encryption techniques encrypt part of private sections of the XML file as an entire block of text and apply these techniques directly on them. Man-in-the-Middle and Cryptanalysts can generate statistical information, tap, sniff, hack, inject and abuse XML data messages. The purpose of this study is to introduce architecture of new approach of exchanging XML data files between different Services in order to minimize the risk of any alteration, data loss, data abuse, data misuse of XML critical business data information during transmission; by implementing a vertical partitioning on XML files. Another aim is to create a virtual environment within internet cloud prior to data transmission in order to utilise the communication method and rise up the transmission performance along with resources utilisation and spreads the partitioned XML file (shredded) through several paths within multi agents that form a multipath virtual network. Virtualisation in cloud network infrastructure to take advantage of its scalability, operational efficiency, and control of data flow are considered in this architecture. A customized UDP Protocol in addition to a pack of modules in RIDX adds a reliable (Lossless) and Multicast data transmission to all nodes in a virtual cloud network. A comparative study has been made to measure the performance of the Real-time Interactive Data Exchange system (RIDX) using RIDX UDP protocol against standard TCP protocol. Starting from 4 nodes up to 10 nodes in the domain, the results showed an enhanced performance using RIDX architecture over the standard TCP protocol.

Many organizations today store their critical business information permanently in XML format. XML data can be managed using: XML-Enabled Database (XED) systems which convert and store XML files in traditional database systems; Native XML Database (NXD) systems which store XML data natively using three main storage technologies – text-based, model-based, and schema-based techniques; and Hybrid Database systems which are comprised of both XML-Enabled and Native XML database systems. NXDs are faster than other database technologies because there is no need to convert the format of the data prior to storage. No performance evaluation has been carried out to compare all three storage strategies, hence, this paper reports on the first attempt to evaluate all three storage strategies by using open source products to measure the response time taken for each of the database basic tasks such as database creation, dataset insertion, and data manipulation. The results of the evaluation show that the schema-based storage strategy: performs 3.5 times faster than the other two storage techniques in data insertion; shows very good performance in query processing on small and large datasets; performs 10.33 times faster than text-based, and 7.5 times faster than model-based storage techniques in query processing of large datasets.

Summary Domain-Specific Languages (DSLs) allow for the building of applications that ease the labour of both software engineers and domain experts thanks to the level of abstraction they provide. In cases where the domain is restricted to Client-Side Web Applications (CSWA), XML-based languages, frameworks and widgets are commonly combined in order to provide fast, robust and flexible solutions. This article presents an approach designed to create XML-based DSL solutions for CSWA that includes an evaluation engine, a programming model and a lightweight development environment. The approach is able to evaluate multiple XML-based DSL programs simultaneously to provide solutions to those Domain Specific Problems for CSWAs. To better demonstrate the capabilities and potential of this novel approach, we will employ a couple of case studies, namely Anisha and FeedPsi .

While the migration from DTD to XML Schema was driven by a need for increased expressivity and flexibility, the latter was also significantly more complex to use and understand. Whereas DTDs are characterized by their simplicity, XML Schema Documents are notoriously difficult. In this article, we introduce the XML specification language BonXai, which incorporates many features of XML Schema but is arguably almost as easy to use as DTDs. In brief, the latter is achieved by sacrificing the explicit use of types in favor of simple patterns expressing contexts for elements. The goal of BonXai is not to replace XML Schema but rather to provide a simpler alternative for users who want to go beyond the expressiveness and features of DTD but do not need the explicit use of types. Furthermore, XML Schema processing tools can be used as a back-end for BonXai, since BonXai can be automatically converted into XML Schema. A particularly strong point of BonXai is its solid foundation rooted in a decade of theoretical work around pattern-based schemas. We present a formal model for a core fragment of BonXai and the translation algorithms to and from a core fragment of XML Schema. We prove that BonXai and XML Schema can be converted back-and-forth on the level of tree languages and we formally study the size trade-offs between the two languages. We acknowledge the financial support of grant number MA 4938/2-1 from the Deutsche Forschungsgemeinschaft (Emmy Noether Nachwuchsgruppe). We further acknowledge the financial support of the Future and Emerging Technologies (FET) programme within the Seventh Framework Programme for Research of the European Commission, under the FET-Open grant agreement FOX, number FP7-ICT-233599.

Evaluation of keyword queries over XML documents is one of the most fundamental tasks for XML data management. Previous methods have focused on the processing of deterministic XML data. However, uncertain data are inherent in practical applications, and how to support efficient keyword search over fuzzy XML data remains at large an open problem. In this paper, we tackle the problem of efficiently producing SLCA (smallest lowest common ancestor) results for keyword queries in fuzzy XML documents. We propose an efficient approach that can find all SLCA results for a given keyword query over fuzzy XML data. In particular, we introduce an effective method to transform a simple keyword query into a segmented keyword query that captures the original query requirements and conforms to the underlying fuzzy XML data. The proposed approach could help us eliminate irrelevant SLCA results and speed up the query processing. The final experiments show the effectiveness and efficiency of our proposed approach in generating SLCA results.

Document matching has become a crucial task for data integration. A considerable amount of algorithms for comparing XML documents have been proposed in the literature. Yet, the existing approaches fall short in ability to identify structural similarities of fuzzy XML documents. To fill this gap, in this paper, we provide an integrated comparison approach to cope with structural similarities of the fuzzy XML documents. Firstly, we propose a new fuzzy XML document tree model to represent fuzzy XML document. Secondly, we offer element/attribute features similarity measure approach to identify matching nodes. Thirdly, we present an effective algorithm based on the tree edit distance to detect the structural similarities between fuzzy XML document trees represented with the proposed model. Finally, the experimental results demonstrate that our approach can efficiently perform structural similarity measure of the fuzzy XML documents.

Dealing with heterogeneous data underlying fuzzy XML databases is challenging for any task of document management and knowledge discovery, since the structural heterogeneity and uncertainty of the large number of XML data sources make it difficult to effectively answer the structured query, especially the tree-pattern query. To address this issue, we propose a novel framework for managing fuzzy XML queries in a heterogeneous environment in this paper. In particular, we devise a holistic algorithm for matching tree-patterns over heterogeneous fuzzy XML data. Our approach adopts a compact stack technique and generates the matches by one scan on the relevant data associated with the tree-pattern, which eliminates re-scanning unnecessary portions of XML documents and redundant intermediate results. Finally, a comprehensive experimental evaluation conducted on real and synthetic data sets is carried out to show the significance of our approach as a solution for querying heterogeneous data in fuzzy XML documents.

Existing work of XML keyword search focus on how to find relevant and meaningful data fragments for a query, assuming each keyword is intended as part of it. However, in XML keyword search, user queries usually contain irrelevant or mismatched terms, typos etc, which may easily lead to empty or meaningless results. In this paper, we introduce the problem of content-aware XML keyword query refinement, where the search engine should judiciously decide whether a user query Q needs to be refined during the processing of Q, and find a list of promising refined query candidates which guarantee to have meaningful matching results over the XML data, without any user interaction or a second try. To achieve this goal, we build a novel content-aware XML keyword query refinement framework consisting of two core parts: (1) we build a query ranking model to evaluate the quality of a refined query RQ, which captures the morphological/semantical similarity between Q and RQ and the dependency of keywords of RQ over the XML data; (2) we integrate the exploration of RQ candidates and the generation of their matching results as a single problem, which is fulfilled within a one-time scan of the related keyword inverted lists optimally. Finally, an extensive empirical study verifies the efficiency and effectiveness of our framework.

A new structure for streaming the XML data is proposed which guarantees confidentiality of the XML data over the wireless stream.An access mechanism is proposed to efficiently process XML queries over the encrypted XML stream. Recently, the use of XML for data broadcasting in mobile wireless networks has gained many attentions. One of the most essential requirements for such networks is data confidentiality. In order to secure XML data broadcast in mobile wireless networks, mobile clients should obey a set of access authorizations specified on the original XML document. In such environments, mobile clients can only access authorized parts of encrypted XML stream based on their access authorizations. Several indexing methods have been proposed in order to have selective access to XML data over the XML stream. However, these indexing methods cannot be used for encrypted XML data. In this paper, we define a new structure for XML stream which supports data confidentiality of XML data over the wireless broadcast channel. We also define an access mechanism for our proposed structure to efficiently process XML queries over the encrypted XML stream. The experimental results demonstrate that the use of our proposed structure and access mechanism for XML data broadcast efficiently disseminates XML data in mobile wireless networks.

Since XML has become a standard for information exchange over the Internet, more and more data are represented as XML. XML keyword search has been attracted a lot of interests because it provides a simple and user-friendly interface to query XML documents. This paper provides a survey on keyword search over XML document. We mainly focus on the topics of defining semantics for XML keyword search and the corresponding algorithms to find answers based on these semantics. We classify existing works for XML keyword search into three main types, which are tree-based approaches, graph-based approaches and semantics-based approaches. For each type of approaches, we further classify works into sub-classes and especially we summarize, make comparison and point out the relationships among sub-classes. In addition, for each type of approach, we point out the common problems they suffer

The eXtensible Markup Language (XML) has been widely adopted in many financial institutions in their daily transactions. This adoption was due to the flexible nature of XML providing a common syntax for systems messaging in general and in financial messaging in specific. Excessive use of XML in financial transactions messaging created an aligned interest in security protocols integrated into XML solutions in order to protect exchanged XML messages in an efficient yet powerful mechanism. However, financial institutions (i.e. banks) perform large volume of transactions on daily basis which require securing XML messages on large scale. Securing large volume of messages will result performance and resource issues. Therefore, an approach is needed to secure specified portions of an XML document, syntax and processing rules for representing secured parts. In this research we have developed a smart approach for securing financial XML transactions using effective and intelligent fuzzy classification techniques. Our approach defines the process of classifying XML content using a set of fuzzy variables. Upon fuzzy classification phase, a unique value is assigned to a defined attribute named “Importance Level”. Assigned value indicates the data sensitivity for each XML tag. The research also defines the process of securing classified financial XML message content by performing element-wise XML encryption on selected parts defined in fuzzy classification phase. Element-wise encryption is performed using symmetric encryption using AES algorithm with different key sizes. Key size of 128-bit is being used on tags classified with “Medium” importance level; a key size of 256-bit is being used on tags classified with “High” importance level. An implementation has been performed on a real-life environment using online banking system in Jordan Ahli Bank one of the leading banks in Jordan to demonstrate its flexibility, feasibility, and efficiency. Our experimental results of the system verified tangible enhancements in encryption efficiency, processing-time reduction, and resulting XML message sizes. Finally, our proposed system was designed, developed, and evaluated using a live data extracted from an internet banking service in one of the leading banks in Jordan. The results obtained from our experiments are promising, showing that our model can provide an effective yet resilient support for financial systems to secure exchanged financial XML messages.

With the increasing of data at an incredible rate, the development of cloud computing technologies is of critical importance to the advances of researches. MapReduce is a widely adopted computing framework for data-intensive applications running on clusters. Traditional parallel XML parsing and indexing approaches are inadequate for processing large-scale XML datasets on clusters and; therefore, we propose an approach to exploit data parallelisms in XML processing using MapReduce in Hadoop. Our solution seamlessly integrates data storage, labeling, indexing, and parallel queries to process a massive amount of XML data. Specifically, we introduce an SDN labeling algorithm and a distributed hierarchical index using DHTs. More importantly, we design an advanced two phase MapReduce solution that is able to efficiently address the issues of labeling, indexing, and query processing on big XML data. The first MapReduce phase applies filtering, labeling, index building techniques, in which each DataNode performs elements labeling using a map function and a reduce function to merge and build indexes. In the second phase, local XML queries in multiple partitions are performed in parallel using index-table-enabled B-SLCA. Our experimental results show the efficiency and effectiveness of our proposed parallel XML data approach using MapReduce Framework.

The paper studies the rewriting mechanisms for intensional documents in the Active XML framework, abstracted in the form of active context-free games. The safe rewriting problem studied in this paper is to decide whether the first player, Juliet, has a winning strategy for a given game and (nested) word; this corresponds to a successful rewriting strategy for a given intensional document. The paper examines several extensions to active context-free games. The primary extension allows more expressive schemas (namely XML schemas and regular nested word languages) for both target and replacement languages and has the effect that games are played on nested words instead of (flat) words as in previous studies. Other extensions consider validation of input parameters of web services, and an alternative semantics based on insertion of service call results. In general, the complexity of the safe rewriting problem is highly intractable (doubly exponential time), but the paper identifies interesting tractable cases., To be published in ICDT 2015

The study is based on XISS(XML Indexing and Storage System) of Dietz’s Numbering Schema to determine the ancestor-descendant relationship. According to the results of research, this paper proposes an improved method of node encoding, realizes its indexing structure, and discusses its query path. Finally, the paper analyzes the property of this improved method.

Keyword search is a user-friendly approach that enables inexperienced users to easily retrieve information from XML data with no specific knowledge of complex structured query language. Since an XML document can have a large size and contain a lot of information, an XML keyword search result should be a fragment of an XML document dynamically constructed at query time, which is achievable due to the structuredness of XML. Processing keyword searches on XML has several challenges, e.g., what are the elements in the XML document that are relevant to the query? How to generate the results efficiently and rank the results meaningfully? How to present the results to the user in a way such that the user can quickly find the desired information? In this survey, the authors review the papers in the literature that attempted to address these problems. The authors divide the existing approaches into several classes based on the problem they tackled, and perform a comprehensive analysis of these works.

Since the last two decades, XML has gained momentum as the standard for web information management and complex data representation. Also, collaboratively built semi-structured information resources, such as Wikipedia, have become prevalent on the Web and can be inherently encoded in XML. Yet most methods for processing XML and semi-structured information handle mainly the syntactic properties of the data, while ignoring the semantics involved. To devise more intelligent applications, one needs to augment syntactic features with machine-readable semantic meaning. This can be achieved through the computational identification of the meaning of data in context, also known as (a.k.a.) automated semantic analysis and disambiguation, which is nowadays one of the main challenges at the core of the Semantic Web. This survey paper provides a concise and comprehensive review of the methods related to XML-based semi-structured semantic analysis and disambiguation. It is made of four logical parts. First, we briefly cover traditional word sense disambiguation methods for processing flat textual data. Second, we describe and categorize disambiguation techniques developed and extended to handle semi-structured and XML data. Third, we describe current and potential application scenarios that can benefit from XML semantic analysis, including: data clustering and semantic-aware indexing, data integration and selective dissemination, semantic-aware and temporal querying, web and mobile services matching and composition, blog and social semantic network analysis, and ontology learning. Fourth, we describe and discuss ongoing challenges and future directions, including: the quantification of semantic ambiguity, expanding XML disambiguation context, combining structure and content, using collaborative/social information sources, integrating explicit and implicit semantic analysis, emphasizing user involvement, and reducing computational complexity.

With the new era of big data and the proliferation of XML documents for representing and exchanging data over the web, selectivity estimation of XML query patterns has become a crucial component of database optimizers. It helps the optimizer choose the best possible plan for query evaluation. Existing selectivity estimators for XML queries can only support basic Query Tree Patterns (QTPs) with logical AND operator. In this paper, we propose a novel approach, called XQuest, for selectivity estimation that supports extended QTPs that may contain logical operators or wildcards. This approach is based on a modified implementation of prime number labeling to construct a structural summary model of the XML data. Subsequently, a simulator of an XML query evaluator runs on the resulting model from the previous stage and aggregates the estimate for each target QTP. We conducted several experiments to study the performance of the proposed approach on three XML benchmark datasets; in terms of synopsis generation time, storage requirements, and estimation accuracy. The results show that the proposed approach can have more accurate estimates with low memory and time requirements. For example, when compared to a Sampling algorithm with the same allocated memory budget, the error rate of the proposed approach never reached 5% whereas it reached 98.5% for the Sampling algorithm.

The gap between storing data in relational databases and transferring data in form of XML has been closed e.g. by SQL/XML queries that generate XML data out of relational data sources. However, only few relational database systems support the evaluation of SQL/XML queries. And even in those systems supporting SQL/XML, the evaluation of such queries is quite slow compared to the evaluation of SQL queries. In this paper, we present S2CX, an approach that allows to efficiently evaluate SQL/XML queries on any relational database system, no matter whether it supports SQL/XML or not. As a result to an SQL/XML query, S2CX supports different output formats ranging from plain XML to different compressed XML representations including a succinct encoding of XML data, schema-aware compressed XML to grammar compressed XML. In many cases, S2CX produces compressed XML as a result to an SQL/XML query even faster than the evaluation of SQL/XML queries into non-compressed XML as provided by Oracle 11 g and by DB2. Furthermore, our approach to query evaluation scales better, i.e., the larger the dataset, the faster is our approach compared to SQL/XML query evaluation in Oracle 11 g and in DB2.

Evaluation methodologies are under development at BWX Technologies (BWXT) to support licensure of the BWXT small modular reactor. In these evaluation methodologies, RELAP5-3D is being used as the c...

A structured XML has been widely used to present services on various Web-services. The XML is also used for digital documents and digital signatures and for the representation of multimedia files in email systems. The XML document should be firstly parsed to access elements in the XML. The parsing is the most compute-instensive task in the use of XML documents. Most of the previous work has focused on hardware based XML parsers in order to improve parsing performance, while a little work has studied parsing techniques. We present the high performance parsing technique which can be used all of XML parsers and design hardware based XML parser using an FPGA. The proposed parsing technique uses element analyzers instead of the state machine and performs multibyte-based element matching. As a result, our parsing technique can reduce the number of clock cycles per byte(CPB) and does not need to require any preprocessing, such as loading XML data into memory. Compared to other parsers, our parser acheives 1.33~1.82 times improvement in the system performance. Therefore, the proposed parsing technique can process XML documents in real time and is suitable for applying to all of XML parsers.

JDBC, Java Database Connectivity, is a well-known and mature technology for a Java based client to connect to a relational database on a server, execute SQL commands, and process results of queries that reside on the server. Likewise, there are a few technologies such as XQJ, IBM Cognos to support such connectivity to XML. But these technologies require the whole document to be stored in memory before it can be processed. As a result, such technologies cannot handle large XML documents. Canonical Storage for XML (abbreviated CanStoreX and also Csx), is a suite of technologies that are under varying stages of development at our lab. CsxPagination paginates an XML document of any size and stores it in ready to consume pages that are loaded into main memory as needed. CsxDOM, is a Javabased DOM API for processing XML documents and CsxXQuery, built on the top of CsxDOM is for query of XML documents. Under the research reported here, we have developed CsxJBCX, Csx Java Based Connectivity for XML, built on the top of CanStoreX, CsxDOM, and CsxXQuery. It provides API to allow a client to access the XML on a server, submit an XQuery query for execution on the server, and use CsxDOM from the client to process the result residing on the server. We have also done some testing of JBCX on CyDIW (Cyclone Database Implementation Workbench) – a command-based software development environment in our lab.

In this paper, the authors present an approach to efficiently compress XML OLAP cubes. They propose a multidimensional snowflake schema of the cube as the basic physical configuration. The cube is then composed of one XML fact document and as many XML documents as the dimension hierarchy members. The basic configuration is reorganized into two ways by adding data redundancy on purpose in order to achieve a better compression ratio on the one hand and to improve query response time on the other hand. In the second configuration, all the documents of the cube are merged into one single XML document. In the third configuration, each reference between the fact and the dimensions or between the members of a dimension hierarchy is replaced by the whole XML referenced fragments. To the three physical configurations of the cube, the authors apply a new compression technique named XCC. They demonstrate the efficiency of the third configuration before and after compression and they also show the efficiency of their compression technique when applied to XML OLAP cubes.

A significant amount of data on the Web is in the XML format or may easily be converted to XML or to its variations. XML is still the most appropriate language for data interchange and serialization. In this paper, a new framework which can integrate any heterogeneous XML data sources is presented. Each data source is translated into semantically meaningful regular expressions without changing original data source. Proposed framework has two major phases for data preparation. In the first phase, each data source is processed to obtain regular expressions which accommodate with the design choices that made in target by utilizing known global semantic vocabulary as an input. The second phase combines these regular expressions to get a global schema by preserving the original source data. A regular expression generator tool which produces regular expressions by regarding vocabulary and an integrator tool box which integrates and processes regular expressions, are also introduced.

Recently, the sizes of XML documents have rapidly been increasing. Distributed XML is a novel form of XML document, in which an XML document is partitioned into fragments and managed separately in plural sites. Distributed XML documents can often be managed more easily than a single large document, due to geographical and/or administrative factors. In this paper, we propose a method for performing XSLT transformation efficiently for distributed XML documents. We assume that the expressive power of XSLT is restricted to an extended version of unranked top-down tree transducer. Our basic strategy is to transform all the XML fragments in parallel. We implemented our method in Ruby and made evaluation experiments. This result suggests that our method is more efficient than a centralized approach.

The verbose nature of XML has been mulled over again and again and many compression techniques for XML data have been excogitated over the years. Some of the techniques incorporate support for querying the XML database in its compressed format while others have to be decompressed before they can be queried. XML compression in which querying is directly supported instantaneously with no compromise over time is forced to compromise over space. In this paper, we propose the compressor, QRFXFreeze, which not only reduces the space of storage but also supports efficient querying. The compressor does this without decompressing the compressed XML file. The compressor supports all kinds of XML documents along with insert, update, and delete operations. The forte of QRFXFreeze is that the textual data are semantically compressed and are indexed to reduce the querying time. Experimental results show that the proposed compressor performs much better than other well-known compressors.

Nowadays exchanging data in XML format become more popular and have widespread application because of simple maintenance and transferring nature of XML documents. So, accelerating search within such a document ensures search engine’s efficiency. In this paper, we propose a technique for detecting the similarity in the structure of XML documents; in the following, we would cluster this document with Delaunay Triangulation method. The technique is based on the idea of representing the structure of an XML document as a time series in which each occurrence of a tag corresponds to a given impulse. So we could use Discrete Fourier Transform as a simple method to analyze these signals in frequency domain and make similarity matrices through a kind of distance measurement, in order to group them into clusters. We exploited Delaunay Triangulation as a clustering method to cluster the d-dimension points of XML documents. The results show a significant efficiency and accuracy in front of common methods.

Data modelling is not only important to visualise the structural schema of data, but also to show the intended integrity constraints. In this paper, we propose a modelling approach called XML Static Dynamic Modelling (XSDyM). While a text-based schema definition is often the most common method used to describe XML, graphical modelling is more accepted as it is capable of visualising the schema definition more effectively for the reader. Conveying the dynamic constraints on XML graphical model requires a special treatment as the constraints basically comprehend the state transitions. It is important for an XML modelling to keep the basis as precise as possible to satisfy the nature of XML and at the same time be able to represent the constraints in an effective way. Using the XML tree-based modelling as the basis of the work, we proposed our own approach to convey the state transitions of the constraints, where it is inspired from the well-known state diagram and adopt some useful features of ORM modelling. We evaluate the correctness of our proposed modelling using a model which involves the checking of model transformations between the modelling and the equivalent XML schema languages.

Searching large XML repositories is a challenging research problem. The application of clustering on a large repository before performing a search enhances the search process significantly. Clustering reduces a search space into smaller XML collections that can be better searched. In this work, we present an enhanced XML clustering by structure method. Also, we introduce a new representation of XML structure that keeps all characteristics of XML structure without summarization. Then, we perform a benchmark comparison between the search results of our improved method to SAXON and Qizx XML XQuery processors. The comparison focuses on search processing time and accuracy of the results using different sizes of datasets for both homogeneous and heterogeneous XML documents. The attained results show better accuracy at the same level of performance.

We present an automata-based method for the static analysis of user-defined XML document adaptations, expressed as sequences of update primitives of XQuery Update. The key feature of the method is the use of an automatic inference algorithm for extracting the type, expressed as a Hedge Automaton, of a sequence of document updates. The type is computed starting from the original schema S and from rewriting rules that formally define the operational semantics of a sequence of document updates. Type inclusion can then be used as a conformance test w.r.t. the type extracted from the target schema S ' .

XML data broadcast is an efficient way to disseminate XML data to a large number of mobile clients in mobile wireless networks. Recently, several indexing methods have been proposed to improve the performance of XML query processing in terms of access time and tuning time over XML streams. However, existing indexing methods cannot process twig pattern XML queries. In this paper, we propose a novel structure for streaming XML data called PS+Pre/Post by integrating the path summary technique and the pre/post labeling scheme. Our proposed XML stream structure exploits the benefits of the path summary technique and the pre/post labeling scheme to efficiently process different types of XML queries over the broadcast stream. Experimental results show that our proposed XML stream structure improves the performance of access time and tuning time in processing different types of XML queries.

With the rapid development of internet and information technology, XML has become the important standard for information exchange and denotation 011 the internet, thus that how to manage the XML document in an efficient, systematic and scientific way has become a great challenge in the field of databaseXML regarded as data interchange’s foundation has a lot of advantages，but regard it as the datum store way it has many disadvantages such as no efficient data structure and indexing structure，poor query ability．This paper recommend a new technology for the storage and management of XML dam，including the work that design of data schema，design the interface and implement it with．NET．Direct against the problem that what past XML file is stored and inquired，this paper have introduced the data schema in RDBMS the XML file emphatically, and introduced functions，the inquiry and statistics based on this data schema

XML has become the standard document representation for many popular tools in various domains. When multiple authors collaborate to produce a document, they must be able to work in parallel and periodically merge their efforts into a single work. While there exist a small number of three-way XML merging tools, their performance could be improved in several areas. We present a three-way XML merge algorithm that is faster, uses less memory and is more precise than previous algorithms. It uses a specialized versioning tree data structure that supports node identity and change detection. The algorithm applies the traditional three-way merge found in GNU diff3 to the children of changed nodes. The editing operations it supports are addition, deletion, update, and move. The algorithm is evaluated by comparing its performance to that of the previous algorithms, using synthetically generated XML documents of a range of sizes and modified by varying numbers of random editing operations. The prototype merge tool used in these tests also includes a simple graphical interface for visualizing and resolving conflicts.

This paper introduces , an XML format developed to serialise the object model defined by the ISO Syntactic Annotation Framework SynAF. Based on widespread best practices we adapt a popular XML format for syntactic annotation, TigerXML, with additional features to support a variety of syntactic phenomena including constituent and dependency structures, binding, and different node types such as compounds or empty elements. We also define interfaces to other formats and standards including the Morpho-syntactic Annotation Framework MAF and the ISOCat Data Category Registry. Finally a case study of the German Treebank TueBa-D/Z is presented, showcasing the handling of constituent structures, topological fields and coreference annotation in tandem.

The article analyzed the shortage of P_schema, and brought forward an improved method P_schema++,.Nesting structure.multi_citing element, alternative element was picked up to format a new type, and then to a relation table. P_Schema++ provided a method for storage of Complex XML document in RDB.

Data exchange can make different information systems of enterprises realize data interaction. The objective establishing it is to keep information sharing and synchronization in enterprises, which can effectively use resources, improve the performance of the system and speeds up information circulation. Data exchange model is the core of realizing data exchange and it has a set of completed data storage and access mechanism. The paper verifies the mapping of relational schema and XML schema, the conversion of database and XML data, and XML document schema, and the paper constructs XSLT documents among different XML schemas, and explains and implements the algorithms of the conversion among different XML documents.

In real-world Web applications, information is often vague or ambiguous. Fuzzy XML databases have been proposed to manage data exchanges among different imprecise and uncertain XML documents. However, data collected from different data sources referring to the same real-world object may conflict. It is the task of the data management system to resolve the conflicts and integrate the data without any interference from a user. In order to integrate data from multiple autonomous fuzzy XML databases, an integration of fuzzy XML data has to be performed. In this paper, we take a first step in a fundamental consolidation of the fuzzy XML data model. In particular, we investigate the integration technique, which is designed to integrate fuzzy XML data collected from different data sources. We develop a basic framework for detecting conflicts and overlaps in fuzzy XML documents. In addition, we propose an approach for reconciling the fuzzy XML data collected from different data sources.

Wireless data broadcast is an efficient way of delivering data of common interest to a large population of mobile devices within a proximate area, such as smart cities, battle fields, etc. In this work, we focus ourselves on studying the data placement problem of periodic XML data broadcast in mobile and wireless environments. This is an important issue, particularly when XML becomes prevalent in today’s ubiquitous and mobile computing devices and applications. Taking advantage of the structured characteristics of XML data, effective broadcast programs can be generated based on the XML data on the server only. An XML data broadcast system is developed and a theoretical analysis on the XML data placement on a wireless channel is also presented, which forms the basis of the novel data placement algorithm in this work. The proposed algorithm is validated through a set of experiments. The results show that the proposed algorithm can effectively place XML data on air and significantly improve the overall access efficiency.

Frameworks are popularly used to reduce implementation complexity and improve productivity. Unfortunately, most frameworks are quite complex and not well documented. Hence, correctly and effectively programming with Framework is still a great challenge. One of the significant obstacles for us to smoothly use Framework is the complicated attribute value configuration of XML files. To overcome these difficulties, we present XMLValue to automatically recommend XML attribute values using association rules and NLP techniques. Experimental results show that our tool is efficient and effective for mining reusable configuration snippets, and has significantly shorten development time for framework based programming, and is general enough to support a variety of frameworks, and has real time performance for code assistance.

Printing good-sized complicated practical report forms is one puzzle in application system with B/S architecture. In order to solve this problem, performing data exchange using XML to come true printing is explored. Windows Form in the framework of .NET is embedded in FrontPage. By self-programming, XML document is analyzed and client-side printing is controlled. Fundamental technique on implementing printing application system report forms with B/S architecture based on XML document is introduced in detail.

Nowadays, the performance and security are always hot research topics in different data fusion systems. In this paper, a more efficient and secure heterogeneous data fusion system has been proposed and implemented. Firstly, based on the global data pattern, which is referred to the concept of view in database, the heterogeneous data is transformed into Extensible Markup Language(XML) documents which are regarded as intermediate data conversion format. Secondly, these XML documents are organized as binary trees and stored in trifurcate chain-table, combined with the XML document tree node encoding. Then the appropriate node attributes are selected as index entries with the security level information, all of these makes up the innovative and dynamic index file with security labels, which is the basis of data querying, fusing and showing. Finally, the system is verified by experiments, and results show that the system can feasibly fuse the heterogeneous data correctly and guarantee the safety of the system.

XML is a standard format for data exchange overinternet. Also huge amount of information is tagged and storedin XML format. Processing XML data has its difficulties due tothe schema centric and semi-structured nature of the majorportion of existing XML data. The data embeded tree stucturemakes it more complicated to process. XML processing usingRDBMS systems and Native XML databases like BaseX, eXist-DBhas its own limitations. Native XML databases are not suitablefor distributed processing. So they just have to bound withsingle systems resources, which are not enough for big dataprocessing. Graph databases and Graph database technologies areemmerging in the recent past. They are also suitable to process bigdata due to the extension of parallel processing features in graphdata processors. Modeling XML data as a graph and processingit with graph processors are benaficial in many contests. In thispaper the graph modleing, storage and processing possibilities ofXML data are analysed. The major graph database Neo4j andthe GraphX graph processor extension embeded with ApacheSpark distributed in-memory processing system are utilized forquerying XML data.

International audience; Information retrieval encounters a migration from the traditional paradigm (returning an ordered list of responses) to the aggregate search paradigm (grouping the most comprehensive and relevant answers into one final aggregated document). Nowadays extensible markup language (XML) is an important standard of information exchange and representation. Usually the tree representation of documents and queries is used to process them. It allows to consider the XML documents retrieval as a tree matching problem between the document trees and the query tree. Several paradigms for retrieving XML documents have been proposed in the literature but only a few of them try to aggregate a set of XML documents in order to provide more significant answers for a given query. In this paper, we propose and evaluate an aggregated search method to obtain the most accurate and richest answers in XML fragment search. Our search method is based on the Top-k Approximate Subtree Matching (TASM) algorithm and a new similarity function is proposed to improve the returned fragments. Then an aggregation process is presented to generate a single aggregate response containing the most relevant, exhaustive and non-redundant information given by the fragments. The method is evaluated on two real world datasets. Experimentations show that it generates good results in terms of relevance and quality.

Keyword search in XML has gained popularity as it enables users to easily access XML data without the need of learning query languages and studying complex data schemas. In XML keyword search, query semantics is based on the concept of Lowest Common Ancestor (LCA), e.g., SLCA and ELCA. However, LCA-based search methods depend heavily on hierarchical structures of XML data, which may result in meaningless answers. To obtain desired answers, a successful system should be able to (i) match a semantic entity for each keyword, (ii) discover the relationships of the matched entities, (iii) support efficient query processing, (iv) release users from having the knowledge of the XML content, and (v) visualize the search results. None of the existing XML keyword search systems completely meet the above requirements. In this paper, we design a system called SpiderXto completely solves the above challenges. We propose a query semantics Entity-Relationship Graph (ERG), which adopts the RDF subject-predicate-object semantics to capture the information of search entities along with associated attributes and the relationships between entities. SpiderX proposes a novel index structure, which has small space cost by combining the optimizations of column databases and the data compression schemes. In addition, SpiderX processes queries in a bottom-up way to achieve high performance, which is about 100X faster than the state-of-the-art algorithms. To demonstrate the high performance of SpiderX, we implement an online demo for SpiderX, which operating on three real-life datasets. The demo also provides (1) query auto-completion to guide users to formulate queries; and (2) visualization panel to display the query answers, which interacts with users by providing zoom-in and zoom-out exploration features. Demo link: http://chunbinlin.com/spiderx.

To study the generation method of customized PDF document in Publishing on demand (POD) system with one source data. First, based on the study of the requirements of source data description in POD system, the publishing data description with XML is proposed; then, the customized content and layout are described using XSL-FO; Finally, the XML source data is converted to customized PDF document using XSL-FO in FOP transformation engine, which is open source. The automatic generation method of customized PDF document based XML source data is proposed. The customized PDF documents are successfully generated using FOP in a experimental. The experimental result shows that the generation method of customized PDF document based XSL-FO is available.