International Conference on Database Theory

International Conference on Database Theory
Name	International Conference on Database Theory
Abbreviation	ICDT
Discipline	Database theory
Established	1993
Frequency	Annual
Publisher	Various academic publishers

International Conference on Database Theory is an annual academic conference focusing on Database theory and theoretical aspects of Computer science. Founded in 1993, the conference brings together researchers from institutions such as Stanford University, Massachusetts Institute of Technology, University of Oxford, University of Cambridge, École Polytechnique Fédérale de Lausanne and companies like Google, Microsoft and IBM. Speakers and attendees often include contributors connected to events like the Symposium on Principles of Database Systems, ACM SIGMOD Conference, European Symposium on Algorithms, International Conference on Very Large Data Bases and awards such as the Gödel Prize and Turing Award.

History

The conference originated as a successor to initiatives involving researchers from Paris, Jerusalem, Madrid and Zurich and quickly attracted participation from groups at Bell Labs, Bellcore and Hewlett-Packard. Early editions featured program committee members from University of California, Berkeley, Cornell University, Princeton University, Carnegie Mellon University and University of Tokyo. Over time ICDT moved locations across Europe and the Middle East, appearing in cities like Athens, Kraków, Athens (Greece), Pisa and Athens, fostering links with conferences such as International Colloquium on Automata, Languages and Programming and Logic in Computer Science. Influential attendees included faculty associated with Royal Society fellows, members of European Research Council projects, and visitors from Max Planck Society labs.

Scope and Topics

The scope spans formal areas tied to work from Alfred Aho, Edgar F. Codd, Michael Stonebraker, Leslie Lamport, Edsger W. Dijkstra and others, encompassing queries inspired by languages like SQL, Datalog and paradigms advanced at Oracle Corporation and SAP SE. Topic clusters often reference complexity results related to the P versus NP problem, decidability results from Kurt Gödel-inspired logic, and algorithmic techniques connected to the Knuth–Morris–Pratt algorithm and the Hopcroft–Karp algorithm. Research areas include formal models influenced by Tarski and Alfred Tarski-style semantics, expressiveness comparisons akin to those in Chomsky hierarchy studies, and data provenance tracing comparable to methods in Lambda calculus research. Cross-disciplinary ties reach groups at European Organization for Nuclear Research, NASA, National Institutes of Health and standards bodies such as World Wide Web Consortium.

Conference Organization and Governance

Governance typically involves program committees chaired by researchers affiliated with ETH Zurich, University of Edinburgh, National University of Singapore, Technion – Israel Institute of Technology and University of Pennsylvania. Sponsorship and oversight often come from societies including Association for Computing Machinery, European Association for Theoretical Computer Science, International Federation for Information Processing and regional chapters in Asia, Europe and North America. Steering committees have included representatives from laboratories like IBM Research, Microsoft Research and Google Research as well as editorial board members from journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

Proceedings and Publication Model

Proceedings have been published by academic publishers including Springer Science+Business Media (in the Lecture Notes in Computer Science series), ACM and sometimes distributed as special issues of journals like Information and Computation and Database Systems. The review process mirrors standards seen at Conference on Foundations of Software Technology and Theoretical Computer Science and International Symposium on Mathematical Foundations of Computer Science, with double-blind or single-blind review practices similar to those at NeurIPS and ICML. Archival versions of papers are indexed in bibliographic databases maintained by Zentralblatt MATH, DBLP and Scopus.

Notable Papers and Contributions

ICDT has seen influential papers later cited alongside foundational works by Serge Abiteboul, Richard Hull, Hector Garcia-Molina, Raghu Ramakrishnan and Divesh Srivastava. Contributions include complexity classifications for query evaluation that relate to results by Stephen Cook and Leonid Levin, constraint satisfaction formulations echoing the Feder–Vardi conjecture, and advances in streaming and dynamic algorithms building on techniques from Andrew Yao and Sanjay Jain. Several ICDT papers informed standards and implementations by vendors such as Amazon Web Services and PostgreSQL Global Development Group, and influenced projects at European Space Agency and Facebook.

Awards and Honors

The conference recognizes outstanding work through best paper awards and distinctions similar to prizes at ACM SIGMOD and PODS; recipients have gone on to receive honors such as the ACM SIGMOD Edgar F. Codd Innovations Award, ACM Fellowship and national academy memberships including National Academy of Sciences and Royal Society. Prominent laureates include scholars associated with University of Pennsylvania, Columbia University, Yale University and University of California, San Diego.

Related Workshops and Co-located Events

ICDT often co-locates workshops and satellite events that mirror formats used at International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Workshop on Algorithmic Foundations of Robotics, and summer schools sponsored by European Research Consortium for Informatics and Mathematics. Typical workshops address topics linked to Knowledge Graphs, Data Provenance Workshop, Query Optimization Workshop, and collaborative efforts with venues like VLDB, SIGMOD, PODS and regional meetings organized by IEEE Computer Society.

Category:Academic conferences