XML Update Research Articles

HTA63 Implementation and Application of the Physician Information System (Arztinformationssystem, AIS) in Germany

Since July 2020, detailed information on German benefit assessments of medicinal products provided by the physician information system (Arztinformationssystem, AIS) must be included in practice management softwares. For this purpose, the G-BA publishes a machine-readable version of the decisions available as a regularly updated XML file twice a month. The objective of this analysis was to present the content of the XML file and possible applications of this data for the AIS and other purposes.

An efficient prefix based labelling scheme for dynamic update of XML documents

The increasing volume of XML documents and the real-world requirement to support the updations has motivated the research community to develop dynamic labelling schemes. Each of the dynamic labelling schemes proposed till date differs in characteristics and has its own advantages and limitations. They may differ in terms of the query supported, their update performance, label size, etc. In this paper, a new prefix based labelling scheme is proposed which is compact, dynamic. And it also facilitates the computation of structural relationships which is the core part of query processing. The proposed scheme can handle both static as well as dynamic XML documents. The experimentation is conducted to evaluate the performance of storage requirement, structural relationship computation and update processing. The result is compared with some of the existing labelling mechanisms.

Constraining new physics from Higgs measurements with Lilith: update to LHC Run 2 results

Lilith is a public Python library for constraining new physics from Higgs signal strength measurements. We here present version 2.0 of Lilith together with an updated XML database which includes the current ATLAS and CMS Run 2 Higgs results for 36 fb^{-1}−1. Both the code and the database were extended from the ordinary Gaussian approximation employed in Lilith-1.1 to using variable Gaussian and Poisson likelihoods. Moreover, Lilith can now make use of correlation matrices of arbitrary dimension. We provide detailed validations of the implemented experimental results as well as a status of global fits for reduced Higgs couplings, Two-Higgs-doublet models of Type I and Type II, and invisible Higgs decays. Lilith-2.0 is available on GitHub and ready to be used to constrain a wide class of new physics scenarios.

TempoX: A disciplined approach for data management in multi-temporal and multi-schema-version XML databases

Although multi-temporal XML databases supporting schema versioning are used in several domains, like e-commerce, e-health, and e-government, existing database management systems and XML tools do not provide any support for managing (inserting, updating, and deleting) temporal XML data or temporal XML schema versioning. Besides, whereas much research work has focused in the last decade on schema versioning in temporal XML databases, any attention has been devoted to manipulating data in such databases. To fill this theoretical and practical gap, we propose in this paper a generic approach, named TempoX (Temporal XML), for data manipulation in multi-temporal and multi-schema-version XML databases. Indeed, we (i) define a new multi-temporal XML data model supporting temporal schema versioning, named TempoXDM (Temporal XML Data Model), (ii) introduce the principles on which our approach is based, and (iii) provide the specifications of the basic data manipulation operations: “insert”, “replace”, “evolve”, and “delete”. Moreover, to show the feasibility of TempoX, we use it to propose a temporal XML update language, named TempoXUF (Temporal XQuery Update Facility), as an extension of the W3C XQuery Update Facility language to temporal and versioning aspects. Furthermore, to validate our language proposal, we develop a system prototype, named TempoXUF-Manager, that supports TempoXUF.

Using Wikibase as a Platform to Develop a Semantic TDWG Standard

In the ABCD 3.0 Project the ABCD (Access to Biological Collection Data) Standard (Access to Biological Collections Data task group 2007) was transformed from a classic XML Schema into an OWL (Web Ontology Language) ontology (along side an updated semantic-aware XML version). While it was initially planned to use the established TDWG Terms wiki as the editing and development platform for the ABCD ontology, the rise of Wikidata and its underlying platform Wikibase have caused us to reconsider this decision and switch to a Wikibase installation instead. This proved to be a crucial decision, as Wikibase turned out to be a well-suited platform to collaboratively import, develop and export this complex semantic standard. This experience is potentially of interest to maintainers of other Biodiversity Information Standards (TDWG) standards and the Technical Architecture Group. In this presentation we will explain our technical setup and how we used Wikibase, alongside its related tools, to model the ABCD Ontology. We will introduce the tools we used for importing existing concepts from the previous ABCD versions, running maintenance queries (e.g. for checking the ontology for consistency or missing information about concepts), and exporting the ontology into the OWL/XML format. Finally we will discuss the lessons we learned and how our setup can be improved for future uses.

A new effective method for labeling dynamic XML data

Query processing based on labeling dynamic XML documents has gained more attention in the past several years. An efficient labeling scheme should provide small size labels keeping the simplicity of the exploited algorithm in order to avoid complex computations as well as retaining the readability of structural relationships between nodes. Moreover, for dynamic XML data, relabeling the nodes in XML updates should be avoided. However, the existing schemes lack the capability of supporting all of these requirements. In this paper, we propose a new labeling scheme which assigns variable-length labels to nodes in dynamic XML documents. Our method employs the FibLSS encoding scheme that exploits the properties of the Fibonacci sequence to provide variable-length node labels of appropriate size. In XML updating process, we add a new section only in the new node’s label without relabeling the existing nodes while keeping the order of nodes as well as preserving the structural relationships. Our labeling method is scalable as it is not subject to overflow, and as the number of nodes to be labeled increases exponentially, the size of labels grows linearly, which makes it suitable for big datasets. It also has the best performance in computational processing costs compared to existing approaches. The results of the experiments confirm the advantages of our proposed method in comparison to state-of-the-art techniques.

CBSL − A Compressed Binary String Labeling Scheme for Dynamic Update of XML Documents

The growing volume of XML documents over the Web has increased the need for an efficient mechanism to facilitate query processing. Many labeling schemes have been introduced to optimize data retrieval and query processing on XML database documents. As it is known, labels hold information about XML tree nodes such as their position, their relationship with other nodes and their order, which helps in query processing. Most of the existing labeling schemes support query processing over static XML documents. However, they need to re-label during dynamic update. In this paper a compressed binary string labeling scheme is proposed which supports dynamic update of XML documents without re-labeling existing nodes. Analytical results show that the proposed labeling scheme takes less label size in comparison with other labeling schemes. Also, an experiment has been conducted to evaluate the label generation time as well as update processing.

Efficient XML query and update processing using a novel prime-based middle fraction labeling scheme

XML data can be represented by a tree or graph and the query processing for XML data requires the structural information among nodes. Designing an efficient labeling scheme for the nodes of Order-Sensitive XML trees is one of the important methods to obtain the excellent management of XML data. Previous labeling schemes such as region and prefix often sacrifice updating performance and suffer increasing labeling space when inserting new nodes. To overcome these limitations, in this paper we propose a new labeling idea of separating structure from order. According to the proposed idea, a novel Prime-based Middle Fraction Labeling Scheme (PMFLS) is designed accordingly, in which a series of algorithms are proposed to obtain the structural relationships among nodes and to support updates. PMFLS combines the advantages of both prefix and region schemes in which the structural information and sequential information are separately expressed. PMFLS also supports Order-Sensitive updates without relabeling or recalculation, and its labeling space is stable. Experiments and analysis on several benchmarks are conducted and the results show that PMFLS is efficient in handling updates and also significantly improves the performance of the query processing with good scalability.

Fraction and Prefix Encoding Scheme of Supporting Updating Data Efficiently

At present, more and more data are expressed in the form of XML format, and how to manage these data effi- ciently becomes an important issue. In order to update and query XML data efficiently, we proposed a new encoding scheme called MPES (modify prefix encoding scheme). MPES makes full good use of the advantages of fraction encod- ing and prefix encoding and it supports updating data efficiently. Furthermore, MPES also supports the representation of sibling relationship, parent-children relationship and ancestor-descendant relationship between any two nodes. The exper- imental results show that, compared with fraction encoding scheme, MPES improves the updating efficiency of XML da- ta. As compared with prefix encoding scheme, MPES improved the querying efficiency of XML data.

Storing and Updating XML Data Tree based on Linked Lists

XML has become the de facto standard for data exchange and transformation on the World Wide Web and is widely used in many applications of various fields, so it is urgent to develop some efficient methods to manage, store, query, and update XML data. There are two main methods to do this: the first method is a native approach which uses native XML databases to store XML data, and the second method use other mature commercial databases approaches to store and manage XML data considering the advantages of mature technologies of the commercial databases, especially use relational databases to store, query, and update XML data. For relational databases approach, although it can take advantage of mature technologies of relational databases, it needs to map XML data to relational data. In this paper, we research the problem of how to store XML data so that storing and updating of original XML data can be efficient than relational approach. We proposed a method to store XML data into linked lists with inverted index, in which the relationships between nodes of XML data tree are preserved by the links in linked lists. Inverted index are created for linked lists for efficiently querying and updating XML data tree. Two kinds of updates are considered including inserting a new node in or deleted an existed old node from XML data tree. Theoretical analysis of our algorithms shows that the methods proposed in the paper are efficient.

A Dynamic Labeling Scheme Based on Logical Operators: A Support for Order-Sensitive XML Updates

Abstract Dynamic XML labeling schemes have demonstrated important usages in XML Database Management Systems. Several researches have been conducted to provide dynamic labeling schemes that can efficiently process queries with less label size and space overhead in addition to the capability of processing order-sensitive updates effectively and efficiently (i.e., without re-labeling). In this paper, we introduce a dynamic labeling scheme as an enhancement to our previous static one, XDAS. Dynamic XDAS is developed as a hybrid labeling scheme that combines the original XDAS with another labeling scheme called IBSL. Dynamic XDAS conveys all characteristics of the original XDAS in addition to the efficient treatment with update processes with no re-labeling, which is adapted from IBSL. Like the original XDAS, our experiments show that dynamic XDAS still can identify the A-D, P-C and sibling relationships using logical operators with efficient label size and storage space. Moreover, dynamic XDAS is capable for processing node/subtree updates efficiently with completely avoiding re-labeling or re-calculations, just like IBSL.

An expressive bidirectional transformation language for XQuery view update

This paper presents an expressive bidirectional XML transformation language and uses it to address the problem of updating XML data through materialized XQuery views. The transformations of this bidirectional language can be executed in two directions: in the forward direction, they generate materialized views from XML source, while in the backward direction, they update the source by reflecting back the updates on views. When XQuery is interpreted with this bidirectional language, it can query XML in its forward execution, and update XML source after its backward execution. We propose the extended round-tripping property for characterizing the good behavior of bidirectional transformations. This property is more flexible for an expressive bidirectional transformation language. The difficulties of updating view insertions are analyzed with detailed examples, and the type information is novelly used to guide backward transformation when views include insertions. A type system with recursive regular expression types for XML is designed for this bidirectional language. Well-typed programs preserve the source type after backward executions. A prototype of our approach is implemented and tested on a number of XQuery use cases.

A performance evaluation of a new bitmap-based XML processing approach over RDBMS

This paper presents a comprehensive performance analysis of PACD; a novel bitmap-based XML processing approach introduced earlier to resolve several performance issues identified in existing XML database technology. The study evaluated three performance aspects of XML database techniques including query processing, XML updates and scalability. Each of these aspects has been tested using various measures and compared with some representative alternative approaches. Despite its narrow domain for the order-access queries and its high cost in terms of the number IO-read operations, PACD almost performed well in terms of query processing, resource consumption during XML updates and has shown acceptable scalability over a variety of XML database categories.

Controlling Label Size Increment of Efficient XML Encoding and Labeling Scheme in Dynamic XML Update

Problem statement: In order to facilitate XML query processing, labeling schemes are used to determine the structural relationships between XML nodes. However, labeling schemes have to reliable the existing nodes or recalculate the label values when a new node is inserted into the XML document during XML update process. EXEL as a labeling scheme is able to remove relabeling for existing nodes during XML update process. Also, it is able to compute the structural relationship between nodes effectively. However, for the case of skewed insertions where nodes are always inserted at a fixed place, the label size of EXEL scheme increases very fast. Approach: This study discussed how to control the increment of label size for the EXEL scheme. In addition, EXEL does not consider the process of deleting labels. We also study how to reuse the deleted labels for future label insertions. Results: We proposed an algorithm which is able to control the label size increment. Conclusion: It required less storage size to store the inserted binary bit string and thus can improve query performance.

Controlling Label Size Increment of Efficient XML Encoding and Labeling Scheme in Dynamic XML Update

Problem statement: In order to facilitate XML query processing, labeling schemes are used to determine the structural relationships between XML nodes. However, labeling schemes have to reliable the existing nodes or recalculate the label values when a new node is inserted into the XML document during XML update process. EXEL as a labeling scheme is able to remove relabeling for existing nodes during XML update process. Also, it is able to compute the structural relationship between nodes effectively. However, for the case of skewed insertions where nodes are always inserted at a fixed place, the label size of EXEL scheme increases very fast. Approach: This study discussed how to control the increment of label size for the EXEL scheme. In addition, EXEL does not consider the process of deleting labels. We also study how to reuse the deleted labels for future label insertions. Results: We proposed an algorithm which is able to control the label size increment. Conclusion: It required less storage size to store the inserted binary bit string and thus can improve query performance.

XML update control method based on security update views

In order to facilitate users to update XML documents,while ensuring security,the paper proposed an update control method for XML based on the security update views. To generate a security update view,the annotations of updating constrains were added to Document Type Definition (DTD) elements of a security view,such as Insert,Delete and Replace,to instruct the updating process. In this way,different security update views were provided to different users for their updating operations. For an update query Q on the security update view,this method provided an algorithm to check the authorization of Q and another algorithm to rewrite it to an equivalent operation over the original XML document. The method can deal with updating operations on XML effectively. At the same time,it provides a user with the security update view,which is visible to him only and avoids information leakage.

Parallelizing XML data-streaming workflows via MapReduce

In prior work it has been shown that the design of scientific workflows can benefit from a collection-oriented modeling paradigm which views scientific workflows as pipelines of XML stream processors. In this paper, we present approaches for exploiting data parallelism in XML processing pipelines through novel compilation strategies to the MapReduce framework. Pipelines in our approach consist of sequences of processing steps that receive XML-structured data and produce, often through calls to “black-box” (scientific) functions, modified (i.e., updated) XML structures. Our main contributions are (i) the development of a set of strategies for compiling scientific workflows, modeled as XML processing pipelines, into parallel MapReduce networks, and (ii) a discussion of their advantages and trade-offs, based on a thorough experimental evaluation of the various translation strategies. Our evaluation uses the Hadoop MapReduce system as an implementation platform. Our results show that execution times of XML workflow pipelines can be significantly reduced using our compilation strategies. These efficiency gains, together with the benefits of MapReduce (e.g., fault tolerance) make our approach ideal for executing large-scale, compute-intensive XML-based scientific workflows.

Schema-based independence analysis for XML updates

Query-update independence analysis is the problem of determining whether an update affects the results of a query. Query-update independence is useful for avoiding recomputation of materialized views and may have applications to access control and concurrency control. This paper develops static analysis techniques for query-update independence problems involving core XQuery queries and updates with a snapshot semantics (based on the W3C XQuery Update Facility proposal). Our approach takes advantage of schema information, in contrast to previous work on this problem. We formalize our approach, sketch a proof of correctness, and report on the performance and accuracy of our implementation.

SQL 호스트에서 동적 번호 부여 방식의 성능 평가

XML 일부분의 변경이 가능한 동적 XML 환경에서 XML의 검색과 변경 기능을 효율적으로 지원하기 위한 방법으로 XML 동적번호 부여 방식에 대한 연구가 활발히 진행되고 있다. 동적 번호 부여 방식은 ORDPATH, DLN과 같이 노드 번호를 부여할 때 인접 노드의 번호에 의존적인 방식과, PSN과 같이 인접한 노드의 번호에 독립적인 노드 번호를 사용하는 2가지의 방식이 있다. 본 논문은 앞의 2가지 동적 번호 부여 방식을 SQL 환경에서 비교하기 위한 환경을 구축하고, W3C XQuery의 변경 형식을 사용하여 그 성능을 비교한다. There has been many active researches on dynamic XML numbering scheme for efficient retrievals and updates of XML. There are two major approaches for dynamic numbering schemes. One approach is dependant on adjacent node numbers when they assign new number for newly inserted node. While the other approach is independent on adjacent node numbers. In this paper we explain the table schema and procedures for our experiments on an SQL host to compare the performance of the two approaches and shows W3C XQuery performance results of the two approaches on the SQL host.

Updates, Schema Updates and Validation of XML Documents - Using Abstract State Machines with Automata-Defined States

Updates, Schema Updates and Validation of XML Documents - Using Abstract State Machines with Automata-Defined States