Provenance in the context of workflows, both for the data they derive and for their specification, is an essential component to allow for result reproducibility, sharing, and knowledge re-use in the scientific community. Several workshops have been held on the topic, and it has been the focus of many research projects and prototype systems. This tutorial provides an overview of research issues in provenance for scientific workflows, with a focus on recent literature and technology in this area. It is aimed at a general database research audience and at people who work with scientific data and workflows. We will (1) provide a general overview of scientific workflows, (2) describe research on provenance for scientific workflows and show in detail how provenance is supported in existing systems; (3) discuss emerging applications that are enabled by provenance; and (4) outline open problems and new directions for database-related research.

/pdf/provenance-and-scientific-workflows-challenges-and-27dsk8tmf9.pdf

Provenance and scientific workflows: challenges and opportunities

The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The author not only provides a thorough description of the theory, but also details its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory.

/pdf/graph-structure-and-monadic-second-order-logic-a-language-zne8xgxf5p.pdf

Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach

Purpose – In the last two decades, a proliferation of business process management (BPM) modeling languages, standards and software systems has given rise to much confusion and obstacles to adoption. Since new BPM languages and notation terminologies were not well defined, duplicate features are common. This paper seeks to make sense of the myriad BPM standards, organising them in a classification framework, and to identify key industry trends.Design/methodology/approach – An extensive literature review is conducted and relevant BPM notations, languages and standards are referenced against the proposed BPM Standards Classification Framework, which lists each standard's distinct features, strengths and weaknesses.Findings – The paper is unaware of any classification of BPM languages. An attempt is made to classify BPM languages, standards and notations into four main groups: execution, interchange, graphical, and diagnosis standards. At the present time, there is a lack of established diagnosis standards. I...

Business process management (BPM) standards: a survey

Web services are a consolidated reality of the modern Web with tremendous, increasing impact on everyday computing tasks. They turned the Web into the largest, most accepted, and most vivid distributed computing platform ever. Yet, the use and integration of Web services into composite services or applications, which is a highly sensible and conceptually non-trivial task, is still not unleashing its full magnitude of power. A consolidated analysis framework that advances the fundamental understanding of Web service composition building blocks in terms of concepts, models, languages, productivity support techniques, and tools is required. This framework is necessary to enable effective exploration, understanding, assessing, comparing, and selecting service composition models, languages, techniques, platforms, and tools. This article establishes such a framework and reviews the state of the art in service composition from an unprecedented, holistic perspective.

/pdf/web-service-composition-a-survey-of-techniques-and-tools-53vztcent0.pdf

Web Service Composition: A Survey of Techniques and Tools

Many advanced data management operations (e.g., incremental maintenance, trust assessment, debugging schema mappings, keyword search over databases, or query answering in probabilistic databases), involve computations that look at how a tuple was produced, e.g., to determine its score or existence. This requires answers to queries such as, "Is this data derivable from trusted tuples?"; "What tuples are derived from this relation?"; or "What score should this answer receive, given initial scores of the base tuples?". Such questions can be answered by consulting the provenance of query results. In recent years there has been significant progress on formal models for provenance. However, the issues of provenance storage, maintenance, and querying have not yet been addressed in an application-independent way. In this paper, we adopt the most general formalism for tuple-based provenance, semiring provenance. We develop a query language for provenance, which can express all of the aforementioned types of queries, as well as many more; we propose storage, processing and indexing schemes for data provenance in support of these queries; and we experimentally validate the feasibility of provenance querying and the benefits of our indexing techniques across a variety of application classes and queries.

/pdf/querying-data-provenance-4h2w9eadk6.pdf

Querying data provenance

We present in this paper BP-QL, a novel query language for querying business processes. The BP-QL language is based on an intuitive model of business processes, an abstraction of the emerging BPEL (Business Process Execution Language) standard. It allows users to query business processes visually, in a manner very analogous to how such processes are typically specified, and can be employed in a distributed setting, where process components may be provided by distinct providers(peers).We describe here the query language as well as its underlying formal model. We consider the properties of the various language components and explain how they influenced the language design. In particular we distinguish features that can be efficiently supported, and those that incur a prohibitively high cost, or cannot be computed at all. We also present our implementation which complies with real life standards for business process specifications, XML, and Web services, and is used in the BP-QL system.

/pdf/querying-business-processes-4husumaa2r.pdf

Querying business processes

A business process consists of a group of business activities undertaken by one or more organizations in pursuit of some particular goal. It usually depends upon various business functions for support, e.g. personnel, accounting, inventory, and interacts with other business processes/activities carried by the same or other organizations. Consequently, the software implementing a business processes typically operates in a cross-organization, distributed environment.

Querying business processes with BP-QL

https://www.vldb.org/conf/2005/papers/p1255-beeri.pdf

Simon Kamenkovich

Papers

Querying business processes

Querying business processes with BP-QL

Querying business processes with BP-QL