SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Introduction to the theory of nested transactions
Theoretical Computer Science - First International Conference on Database Theory, Rome, September 1986
Data Engineering
Concurrent programming in ERLANG (2nd ed.)
Concurrent programming in ERLANG (2nd ed.)
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Concurrent programming in ML
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Active Database Systems: Triggers and Rules for Advanced Database Processing
Active Database Systems: Triggers and Rules for Advanced Database Processing
Coordinating Business Transactions on the Web
IEEE Internet Computing
Advanced Transaction Models in Workflow Contexts
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Failure Handling and Coordinated Execution of Concurrent Workflows
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Split-Transactions for Open-Ended Activities
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Cooperative Transaction Hierarchies: A Transaction Model to Support Design Applications
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Constraint Processing
Mobility and social networking: a data management perspective
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Many data-driven social and Web applications involve collaboration and coordination. The vision of Declarative Data-Driven Coordination (D3C), proposed in Kot et al. [2010], is to support coordination in the spirit of data management: to make it data-centric and to specify it using convenient declarative languages. This article introduces entangled queries, a language that extends SQL by constraints that allow for the coordinated choice of result tuples across queries originating from different users or applications. It is nontrivial to define a declarative coordination formalism without arriving at the general (NP-complete) Constraint Satisfaction Problem from AI. In this article, we propose an efficiently enforceable syntactic safety condition that we argue is at the sweet spot where interesting declarative power meets applicability in large-scale data management systems and applications. The key computational problem of D3C is to match entangled queries to achieve coordination. We present an efficient matching algorithm which statically analyzes query workloads and merges coordinating entangled queries into compound SQL queries. These can be sent to a standard database system and return only coordinated results. We present the overall architecture of an implemented system that contains our evaluation algorithm. We also describe a proof-of-concept Facebook application we have built on top of this system to allow friends to coordinate flight plans. Finally, we evaluate the performance of the matching algorithm experimentally on realistic coordination workloads.