Figure 5 - uploaded by Ghislain Fourny
Content may be subject to copyright.
Source publication
As storage-main memory as well as disk-becomes cheaper, the amount of available information is increasing and it is a challenge to organize it. Our broader aim is to provide a unified framework for efficiently versioning and querying data, documents, as well as any kind of semi-structured information between data and documents, which can be stored...
Contexts in source publication
Context 1
... local PUL is kept normalized when aggregating or accumulating update primitives, as defined in the next sections. Also, there are backpointers from the nodes of the local trees in the store (read by the XQuery program) to their copy in the local PUL whenever there is one (i.e., whenever they were added by the program), in order to know where they came from (see Figure 5). These backpointers are followed when the PUL to be applied is copied to a new PUL which is to be composed with the local PUL (see Section 6). ...
Context 2
... backpointers are followed when the PUL to be applied is copied to a new PUL which is to be composed with the local PUL (see Section 6). From now on, as on Figure 5, we take the convention that the nodes encircled in black are copies which belong to contents of the local PUL or to the contents of the ...
Similar publications
It is very important to access a rich music dataset that is useful in a wide variety of applications. Currently, available datasets are mostly focused on storing vocal or instrumental recording data and ignoring the requirement of its visual representation and retrieval. This paper attempts to build an XML-based public dataset, called SANGEET, that...
A formal algebra is essential for applying standard database-style query optimization to XML queries. We develop such algebra for manipulating fuzzy spatiotemporal XML data. We also introduce several formal characterizations of fuzzy spatiotemporal algebraic equivalences, and study how XQuery expressions can be transformed into algebraic expression...
Music is a temporal organization of sounds, and we can therefore assume that any music representation has a structure that reflects some conceptual principles. This structure is hardly explicitly accessible in many encodings, such as, for instance, audio files. However, it appears much more clearly in the language of music notation.
We propose to u...
Current industrial automation systems integrate structural information and component configuration data within the code of their programmable logic controllers.
This prevents the demanded flexibility and adaptability of Industrie 4.0 systems.
The asset administration shell provides a defined mechanism for finding, accessing and interpreting standar...
The cityEHR is an example of an open source EHR system which stores clinical data as collections of XML documents. The records gathered in routine clinical care are a rich source of longitudinal data for use in clinical studies. We describe how the standard language XQuery can be used to identify cohorts of patients, matching specified criteria. We...
Citations
... The work described in [Fou+10] consideres a number of interesting and promising approaches for XML versioning which add a versioning model to a database and extend the XPath data model (XDM) to address temporal aspects. Unfortunately, the work seems to be only theoretical, since at the time of writing no implementation was available that proves the concept and we have not seen any updates publicly available from 2010. ...
... There have been efforts to extend the XPath query language to make it time-aware [9]. In this work we choose to work with a temporal logic to talk about different instants of the evolution of a document. ...
We consider a sequence t1,...,tk of XML documents that is produced by a sequence of local edit operations. To describe properties of such a sequence, we use a temporal logic. The logic can navigate both in time and in the document, e.g. a formula can say that every node with label a eventually gets a descendant with label b. For every fixed formula, we provide an evaluation algorithm that works in time O(k ⋅ log(n)), where k is the number of edit operations and n is the maximal size of document that is produced. In the algorithm, we represent formulas of the logic by a kind of automaton, which works on sequences of documents. The algorithm works on XML documents of bounded depth.
... In case of big documents, it is more convenient to exchange deltas (i.e., the updates -expressed as PULs-that the documents have undergone ) rather than the documents themselves. A similar operation is needed in document versioning and temporal XML [8, 10, 11], where we may want to get rid of some intermediate document versions (expressed as deltas over an original version) and only keep the most relevant ones. In the context of the cloud [20] , finally, updates travel on the network , and arrive at the node holding the document they refer to, where they are collected, and only subsequently actually applied. ...
... Since it is intended to be applied in a document update framework, the labeling scheme used to represent these relationships must accommodate updates. The only approach to dynamic reasoning on XML updates we are aware of is [11], and it does not cope with these issues, since the proposed PUL composition operator composes the effects of a sequence of locally executed PULs. The specific PUL operations we consider are: PUL reduction, integration and aggregation. ...
... Moreover, deltas can be deduced by comparing different versions, and most research effort has been devoted to develop efficient algorithms for obtaining compact deltas. Our approach is instead closer to [11], addressing PUL composition for modeling the changes made by an XQuery Scripting Extension [21] program as a single PUL rather than as a sequence of PULs. Composition allows to summarize the effect of several, possibly interdependent, PULs as a single (local) PUL. ...
In many emerging XML application contexts and distributed execution environments (like disconnected and cloud computing, collaborative editing and document versioning) the server that determines the updates to be performed on a document, by evaluating an XQuery Update expression, is not always the same that actually makes such updates -represented as Pending Update Lists (PULs)-effective. The process of generating the PUL is thus decoupled from that of making its effect persistent on the document. The PUL executor needs to manage several PULs, that, depending on the application context, are to be executed as sequential or parallel update requests, possibly relying on application-specific policies. This requires some capabilities of dynamic reasoning on updates. In the paper, we state the most relevant properties to reason on, develop the corresponding algorithms and present a PUL handling system, providing an experimental evaluation of this system.
In a dynamic and heterogeneous world as the Web, the need often arises to update XML data, as well as their structures, to adhere to new domain requirements. Updates may break compliance of data to schemas, and updates at schema level may in addition require to adapt associated documents to the new schema. Moreover, emerging application contexts in which updates come from different sources, such as collaborative editing, versioning, cloud computing, and disconnected execution, are more and more relevant. The main goals of this thesis are: (i) to support data and schema updates as an integrated process, investigating the mutual implications of updating either data or schema on the other, (ii) to develop a flexible framework for dynamically reasoning on XML updates, applicable in different contexts and (iii) to study provenance in the context of our XML update framework, introducing the possibility of storing and querying each individual update information to trace the data lineage.
XML underlies the same constant modification scenarios like any other resource especially in flexible environments like the WWW. Therefor intelligent handlings of versioned XML are mandatory. Due to the structural nature of XML, the efficient storage of changes in the data and therefor in the tree needs new paradigms regarding efficient storage and effective retrieval operations. We present a node granular XML versioning approach which relies on the independence of the storage and the versioning system. Different layers which have the ability to satisfy specific aspects of a node-granular versioning storage guarantee this independence. Results prove that our architecture offers efficient handling of consecutive changes within all modification scenarios while not restricting XML regarding its usage. Hence, our prototype system handles even huge XML instances while ensuring equal access to each revision of the data.
