Titlebook: On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE; OTM Confederated Int Robert Meersman,Zahir Tari Conference procee

novelty

Alopecia-Areata

推测

A Flexible and Composite Schema Matching Algorithmdirect element correspondences and indirect element correspondences. Our algorithm sufficiently exploits semantic, structure and instance information of two schemas. It has advantages of various kinds of algorithms and hence a learning methodism.

转换

无政府主义者

The Notion of Business Process Revisitederefore gets a lot of attention. Consequently, there is a variety of definitions as well as a variety in preciseness of definition. The research reported in this paper aims at clarifying the different understandings and unifying them in a common conceptual framework. Three fundamental questions conc

intrigue

Disjoint and Overlapping Process Changes: Challenges, Solutions, Applicationsrocess type level and their propagation to a collection of related process instances. So far these two kinds of (dynamic) process changes have been mainly considered in an isolated fashion. Especially for long-running processes, however, it must be possible to adequately handle the interplay between

Migratory

Untangling Unstructured Cyclic Flows – A Solution Based on Continuationscations that support structured cycles only. Our solution is based on a continuation semantics, which we developed for the graphical representation of a process model. By using a rule-based transformation method originally developed in compiler theory, we can untangle the unstructured flow while sol

Malcontent

constellation

Concurrent Undo Operations in Collaborative Environments Using Operational Transformation 22] proposed to serialize concurrent operations and achieve copies convergence of replicated objects are based on the use of .. In this context, giving the user the ability to undo an operation has been recognized as a difficult problem [1, 2, 3, 12, 14, 20, 21]. The few general propositions to sol

gerontocracy

Refresco: Improving Query Performance Through Freshness Control in a Database Clusteroit user requirements on replica freshness. Assuming mono-master lazy replication, we propose a freshness model to help specifying the required freshness level for queries. We propose an algorithm to optimize the routing of queries on slave nodes based on the freshness requirements. Our approach use