We describe the 2016 ICDT Test of Time Award which is awarded to Chandra Chekuri and Anand Rajaraman for their 1997 ICDT paper on "Conjunctive Query Containment Revisited"

Afrati, Foto N.

David, Claire

Gottlob, Georg

Dagstuhl Research Online Publication Server

The ICDT 2016 Test of Time AwardAnnouncementFoto N. Afrati1, Claire David2, and Georg Gottlob31 National Technical Universtity of Athens, Athens, Greeceafrati@softlab.ece.ntua.gr2 Université Paris-Est Marne-la-Vallée, Marne-la-Vallée, FranceClaire.David@u-pem.fr3 University of Oxford, Oxford, UKgeorg.gottlob@cs.ox.ac.ukAbstractWe describe the 2016 ICDT Test of Time Award which is awarded to Chandra Chekuri andAnand Rajaraman for their 1997 ICDT paper on “Conjunctive Query Containment Revisited”.1998 ACM Subject Classification H.2.3 [Database Management] LanguagesKeywords and phrases conjunctive query, treewidth, NP-hardness, rewritingDigital Object Identifier 10.4230/LIPIcs.ICDT.2016.11 The ICDT 2016 Test of Time AwardIn 2013, the International Conference on Database Theory (ICDT) began awarding the ICDTTest of Time (ToT) Award, with the goal of recognizing one paper, or a small number ofpapers, presented at earlier ICDT conferences that have best met the “test of time”. In2016, the award recognizes a paper selected from the proceedings of the ICDT 1995 & 1997conferences, that has had the highest impact in terms of research, methodology, conceptualcontribution, or transfer to practice over the past decade. The award was presented duringthe EDBT/ICDT 2016 Joint Conference, March 15–18, 2016 in Bordeaux, France.The 2016 Test of Time Award Committee, consisting of Foto N. Afrati, Claire David,and Georg Gottlob (chair), has chosen the following contribution for the 2016 ICDT Test ofTime Award:1Conjunctive Query Containment Revisitedby Chandra Chekuri and Anand Rajaraman6th International Conference on Database Theory (ICDT 1997)The paper is available here: http://dx.doi.org/10.1007/3-540-62222-5_36.2 ContributionThis landmark paper made highly significant contributions to the problems of conjunctivequery containment and optimization. While it was known that these NP-hard problemsare tractable in case of acyclic queries, Chekuri and Rajaraman observed that the most1 Full citation is given in [1].© Foto N. Afrati, Claire David, and Georg Gottlob;licensed under Creative Commons License CC-BY19th International Conference on Database Theory (ICDT 2016).Editors: Wim Martens and Thomas Zeume; Article No. 1; pp. 1:1–1:2Leibniz International Proceedings in InformaticsSchloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany1:2 The ICDT 2016 Test of Time Award Announcementcommonly encountered queries, while not necessarily acyclic, are in some sense nearly acyclicand still lend themselves to polynomial-time containment and minimization algorithms. Tomake this precise, they introduced the concept of query width, which is based on the notionof query decomposition combining treewidth-like decomposition techniques with set coveringmethods. In particular, the class of acyclic queries coincides with the class of queries havingquery width 1. They showed that the problems of query-containment and query minimizationare tractable for classes of queries whose query width is bounded by some constant k in casea query decomposition of width ≤ k is given.The paper contains a number of further important results on (i) the relationship betweenthe query width of a query and the treewidth of its incidence graph, (ii) the hardness ofapproximating query minimization, and (iii) rewriting and answering queries of boundedquery width in presence of views.This highly cited paper, whose full version has appeared in Theoretical Computer Sci-ence [2], had a major impact on subsequent work in Database Theory and Artificial Intelligence(in particular, constraint satisfaction). Its pioneering use of hypergraph-based rather thangraph-based decomposition techniques marked the beginning of a still ongoing series of invest-igations that have led to the definition of further, successively more general decompositiontechniques, rooted in the very idea of query decomposition.Foto N. Afrati Claire David Georg GottlobThe ICDT Test of Time Award Committee for 2016References1 Chandra Chekuri and Anand Rajaraman. Conjunctive query containment revisited. InProc. of the 6th International Conference on Database Theory (ICDT’97), Delphi, Greece,January 8–10, 1997, volume 1186 of Lecture Notes in Computer Science, pages 56–70.Springer, 1997. doi:10.1007/3-540-62222-5_36.2 Chandra Chekuri and Anand Rajaraman. Conjunctive query containment revisited. Theor.Comput. Sci., 239(2):211–229, 2000. doi:10.1016/S0304-3975(99)00220-0.

The ICDT 2016 Test of Time Award Announcement

http://drops.dagstuhl.de/opus/volltexte/2016/5793/pdf/23.pdf

The ICDT 2016 Test of Time Award Announcement

Abstract

Similar works

Full text

Available Versions

Dagstuhl Research Online Publication Server