The ORCHESTRA Collaborative Data Sharing System

Ives, Zachary G.; Green, Todd; Karvounarakis, Grigoris; Taylor, Nicholas E.; Tannen, Val; Talukdar, Partha; Jacob, Marie; Pereira, Fernando

doi:10.1145/1462571.1462577

Cited by 73 publications

(52 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Active XML [3] provides distributed datadriven workflows manipulating XML data. A collaborative system for distributed data sharing geared towards life sciences applications is provided by the Orchestra project [18,23].…”

Section: Related Workmentioning

confidence: 99%

Explanations and Transparency in Collaborative Workflows

Abiteboul

Bourhis

Vianu

2018

Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

View full text Add to dashboard Cite

We pursue an investigation of data-driven collaborative workflows. In the model, peers can access and update local data, causing side-e↵ects on other peers' data. In this paper, we study means of explaining to a peer her local view of a global run, both at runtime and statically. We consider the notion of "scenario for a given peer" that is a subrun observationally equivalent to the original run for that peer. Because such a scenario can sometimes di↵er significantly from what happens in the actual run, thus providing a misleading explanation, we introduce and study a faithfulness requirement that ensures closer adherence to the global run. We show that there is a unique minimal faithful scenario, that explains what is happening in the global run by extracting only the portion relevant to the peer.With regard to static explanations, we consider the problem of synthesizing, for each peer, a "view program" whose runs generate exactly the peer's observations of the global runs. Assuming some conditions desirable in their own right, namely transparency and boundedness, we show that such a view program exists and can be synthesized. As an added benefit, the view program rules provide provenance information for the updates observed by the peer.

show abstract

Section: Related Workmentioning

confidence: 99%

Explanations and Transparency in Collaborative Workflows

Abiteboul

Bourhis

Vianu

2018

Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

View full text Add to dashboard Cite

show abstract

“…The purpose of this sample scenario is to address similar semantic interoperability problems encountered in real settings and applications of web services (e.g., [23,41]) or among different business entities. We consider a system of distributed service repositories where service providers register their service interfaces.…”

Section: The Running Examplementioning

confidence: 99%

On the emergence of semantic agreement among rational agents

Vakili

Papaioannou

Aberer

2015

WEB

View full text Add to dashboard Cite

Abstract. Today's complex online applications often require the interaction of multiple (web) services that belong to potentially different business entities. Interoperability is a core element of such an environment, yet not a straightforward one due to the lack of common data semantics. The problem is often approached by means of standardization procedures in a top-down manner with limited adoption in practice. (De facto) standards for semantic interoperability most commonly emerge in a bottom-up approach, i.e., involving the interaction and information exchange among self-interested industrial agents. In this paper, we argue that the emergence of semantic interoperability can be seen as an economic process among rational agents and, although interoperability can be mutually beneficial for the involved parties, it may also be costly and might fail to emerge. As a sample scenario, we consider the emergence of semantic interoperability among rational web service agents in service-oriented architectures (SOAs), and we analyze their individual economic incentives with respect to utility, risk and cost. We model this process as a positive-sum game and study its equilibrium and evolutionary dynamics. According to our analysis, which is also experimentally verified, certain conditions on the communication cost, the cost of technological adaptation, the expected mutual benefit from interoperability, as well as the expected loss from isolation, drive the process.

show abstract

“…Matches are chosen based on their utility with respect to a query workload that is provided in advance. ORCHESTRA [62,36], a collaborative data sharing system, covering the three phases initialization, usage and improvement, uses a generic graph structure to store the schemas and matches between schema elements, which are derived semi-automatically and annotated with costs representing the bias of the system against using the matches. Mappings in the form of query templates are derived from keyword queries posed by the user and matched against the schemas and matches.…”

Section: Dataspace Management Systemsmentioning

confidence: 99%

A Functional Model for Dataspace Management Systems

Hedeler

Fernandes

Belhajjame

et al. 2013

Advanced Query Processing

View full text Add to dashboard Cite

Dataspace management systems (DSMSs) hold the promise of pay-asyou-go data integration. We describe a comprehensive model of DSMS functionality using an algebraic style. We begin by characterizing a dataspace life cycle and highlighting opportunities for both automation and user-driven improvement techniques. Building on the observation that many of the techniques developed in model management are of use in data integration contexts as well, we briefly introduce the model management area and explain how previous work on both data integration and model management needs extending if the full dataspace life cycle is to be supported. We show that many model management operators already enable important functionality (e.g., the merging of schemas, the composition of mappings, etc.) and formulate these capabilities in an algebraic structure, thereby giving rise to the notion of the core functionality of a DSMS as a many-sorted algebra. Given this view, we show how core tasks in the dataspace life cycle can be enacted by means of algebraic programs. An extended case study illustrates how such algebraic programs capture a challenging, practical scenario.

show abstract

The ORCHESTRA Collaborative Data Sharing System

Cited by 73 publications

References 44 publications

Explanations and Transparency in Collaborative Workflows

Explanations and Transparency in Collaborative Workflows

On the emergence of semantic agreement among rational agents

A Functional Model for Dataspace Management Systems

Contact Info

Product

Resources

About