Christoph Koch
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Christoph Koch has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Dan Olteanu
Computing Laboratory Oxford University Oxford OX1 3QD UK
4 shared publications - Lyublena Antova
Alon Halevy Google Inc. Universiteit van Amsterdam Cornell University Google Inc
3 shared publications - Alan Demers
Cornell University
2 shared publications - Gavin Bierman
Microsoft Research, Cambridge, United Kingdom
1 shared publication - Johannes Gehrke
Cornell University
1 shared publication - Lucja Kot
Cornell University Ithaca 14853 NY
1 shared publication
Latest Publications
- 7 December 2018
- Published by Springer Nature
- p. 2142-2145
Logical Foundations of Web Data Extraction
- 7 December 2018
- Published by Springer Nature
- p. 2680-2684
Parameterized Complexity of Queries
- 31 December 2016
- Published by Springer Nature
- p. 1-4
Logical Foundations of Web Data Extraction
- 1 January 2016
- Published by Springer Nature
- p. 1-5
Parameterized Complexity of Queries
- 1 January 2016
- Published by Springer Nature
- p. 1-4
XML Stream Processing
- 15 July 2009
- Published by Springer Nature in The VLDB Journal
- Vol. 18 (5) , 1021-1040
${10^{(10^{6})}}$ worlds and beyond: efficient representation and processing of incomplete information- 15 July 2009
- Published by Springer Nature in The VLDB Journal
- Vol. 18 (5) , 1021-1040
${10^{(10^{6})}}$ worlds and beyond: efficient representation and processing of incomplete information- Open Access
Cooperative Update Exchange in the Youtopia System
Youtopia is a platform for collaborative management and integration of relational data. At the heart of Youtopia is an update exchange abstraction: changes to the data propagate through the system to satisfy user-specified mappings. We present a novel change propagation model that combines a deterministic chase with human intervention. The process is fundamentally cooperative and gives users significant control over how mappings are repaired. An additional advantage of our model is that mapping cycles can be permitted without compromising correctness. We investigate potential harmful interference between updates in our model; we introduce two appropriate notions of serializability that avoid such interference if enforced. The first is very general and related to classical final-state serializability; the second is more restrictive but highly practical and related to conflict-serializability. We present an algorithm to enforce the latter notion. Our algorithm is an optimistic one, and as such may sometimes require updates to be aborted. We develop techniques for reducing the number of aborts and we test these experimentally.
Open AccessCooperative Update Exchange in the Youtopia System
Youtopia is a platform for collaborative management and integration of relational data. At the heart of Youtopia is an update exchange abstraction: changes to the data propagate through the system to satisfy user-specified mappings. We present a novel change propagation model that combines a deterministic chase with human intervention. The process is fundamentally cooperative and gives users significant control over how mappings are repaired. An additional advantage of our model is that mapping cycles can be permitted without compromising correctness. We investigate potential harmful interference between updates in our model; we introduce two appropriate notions of serializability that avoid such interference if enforced. The first is very general and related to classical final-state serializability; the second is more restrictive but highly practical and related to conflict-serializability. We present an algorithm to enforce the latter notion. Our algorithm is an optimistic one, and as such may sometimes require updates to be aborted. We develop techniques for reducing the number of aborts and we test these experimentally.
- Open Access
- 24 March 2009
- Published by Association for Computing Machinery (ACM)
- p. 120-131
Rule-based multi-query optimization
Data stream management systems usually have to process many long-running queries that are active at the same time. Multiple queries can be evaluated more efficiently together than independently, because it is often possible to share state and computation. Motivated by this observation, various Multi-Query Optimization (MQO) techniques have been proposed. However, these approaches suffer from two limitations. First, they focus on very specialized workloads. Second, integrating MQO techniques for CQL-style stream engines and those for event pattern detection engines is even harder, as the processing models of these two types of stream engines are radically different. In this paper, we propose a rule-based MQO framework. This framework incorporates a set of new abstractions, extending their counterparts, physical operators, transformation rules, and streams, in a traditional RDBMS or stream processing system. Within this framework, we can integrate new and existing MQO techniques through the use of transformation rules. This allows us to build an expressive and scalable stream system. Just as relational optimizers are crucial for the success of RDBMSes, a powerful multi-query optimizer is needed for data stream processing. This work lays the foundation for such a multi-query optimizer, creating opportunities for future research. We experimentally demonstrate the efficacy of our approach.
- 24 March 2009
- Published by Association for Computing Machinery (ACM)
- p. 120-131
Open AccessRule-based multi-query optimization
Data stream management systems usually have to process many long-running queries that are active at the same time. Multiple queries can be evaluated more efficiently together than independently, because it is often possible to share state and computation. Motivated by this observation, various Multi-Query Optimization (MQO) techniques have been proposed. However, these approaches suffer from two limitations. First, they focus on very specialized workloads. Second, integrating MQO techniques for CQL-style stream engines and those for event pattern detection engines is even harder, as the processing models of these two types of stream engines are radically different. In this paper, we propose a rule-based MQO framework. This framework incorporates a set of new abstractions, extending their counterparts, physical operators, transformation rules, and streams, in a traditional RDBMS or stream processing system. Within this framework, we can integrate new and existing MQO techniques through the use of transformation rules. This allows us to build an expressive and scalable stream system. Just as relational optimizers are crucial for the success of RDBMSes, a powerful multi-query optimizer is needed for data stream processing. This work lays the foundation for such a multi-query optimizer, creating opportunities for future research. We experimentally demonstrate the efficacy of our approach.
- Open Access
- 23 March 2009
- Published by Association for Computing Machinery (ACM)
- p. 127-140
A compositional query algebra for second-order logic and uncertain databases
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. This paper shows that world-set algebra captures exactly second-order logic over finite structures, or equivalently, the polynomial hierarchy. The proofs also imply that worldset algebra is closed under composition, a previously open problem.
- 23 March 2009
- Published by Association for Computing Machinery (ACM)
- p. 127-140
Open AccessA compositional query algebra for second-order logic and uncertain databases
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. This paper shows that world-set algebra captures exactly second-order logic over finite structures, or equivalently, the polynomial hierarchy. The proofs also imply that worldset algebra is closed under composition, a previously open problem.