A rule-based object/task modelling approach
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Nested relation based database knowledge representation
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Comparing Hybrid Peer-to-Peer Systems
Proceedings of the 27th International Conference on Very Large Data Bases
CPM Revisited - An Architecture Comparison
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
From Database Programming to Business Process Programming
DBLP-5 Proceedings of the Fifth International Workshop on Database Programming Languages
Inter-Enterprise Collaborative Business Process Management
Proceedings of the 17th International Conference on Data Engineering
The Piazza peer data management project
ACM SIGMOD Record
Scientific data management in the coming decade
ACM SIGMOD Record
Pig latin: a not-so-foreign language for data processing
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Building a scalable web query system
DNIS'07 Proceedings of the 5th international conference on Databases in networked information systems
Data-Continuous SQL Process Model
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Hi-index | 0.00 |
A technical trend in supporting data intensive applications is to push-down them to database engines by wrapping computations with User Defined Functions (UDFs) callable from the SQL interface. For seamlessly integrating applications into SQL queries, we introduce a special kind of UDFs with both input and output as relations, or row sets, called Relation Valued Functions (RVFs). As a single SQL statement has limited expressive power on complex data flows and control flows, we propose the notion of Correlated Query Process(CQP), for specifying an application at the process level, by several queries and RVFs with interleaved steps.We further extend this notion to Collaborative CQP with multiple participating parties which have correlated but separate goals. A truly P2P execution model is proposed, under which the logical execution of a collaborative CQP consists of a set of individual peer CQP executions run by the participating parties. These peer executions are based on the same CQP template; but each peer represents a designated role, it actively processes the steps belong to that role, and skip the steps not belonging to that role. They synchronize peer CQP executions by passing the query return messages. This collaborative process execution model represents a shift from coordinator based distributed query processing to truly P2P collaboration.This work represents an initial step to the synthesis of relational operation, UDF and business process. We further envisage that the proposed P2P CQP execution model will have impact not only on inter-enterprise collaboration but also on the cooperation of multiple share-nothing data servers.