The newsletter on principles of data management aims to distribute announcements about conferences, (research) jobs or books, and other information relevant for researchers who are interested to some extent in the principles of data management. You can register to receive the newsletter by the form at the right-hand side of this page.
We plan to send out the newsletter roughly every two months, more specifically during the first days of odd-numbered months (without any guarantee). So please submit your announcements by the end of even-numbered months.
We reserve the right to not include announcements in the newsletter, if we think that they do not fit the scope of the newsletter or they do not follow the formatting instructions.
PODS 2007 - 26th ACM SIGMOD-SIGACT-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS Call for Papers June 11-13, 2007, Beijing, China http://sigmod07.riit.tsinghua.edu.cn * The PODS symposium series, held in conjunction with the SIGMOD conference series, provides a premier annual forum for the communication of new advances in the theoretical foundation of database systems. For the 26th edition, original research papers providing new insights in the specification, design, or implementation of data management tools are called for. * Topics that fit the interests of the symposium include the following (as they pertain to databases): algorithms; complexity; computational model theory; concurrency; constraints; data exchange; data integration; data mining; data modeling; data on the Web; data streams; data warehouses; distributed databases; information retrieval; knowledge bases; logic; multimedia; physical design; privacy; quantitative approaches; query languages; query optimization; real-time data; recovery; scientific data; security; semantic Web; semi-structured data; spatial data; temporal data; transactions; updates; views; Web services; workflows; XML. * Important dates: Abstract submission due: 28 Nov 2006; Paper submission: 5 Dec 2006; Notification: 26 Feb 2007 BOOK ANOUNCEMENT: Parameterized Complexity Theory by Jörg Flum and Martin Grohe Springer Verlag 2006, 493 Pages ISBN: 3540299521 * Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability. * This book is a state-of-the-art introduction into both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters each are devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic. * Further information can be found at http://www2.informatik.hu-berlin.de/~grohe/pub/pkbuch.html JOB ANOUNCEMENT: * PHD STUDENTS (or post-docs) * Database Theory or Logic and Complexity * TU Dortmund University, Germany * 1-3 years * Link: https://ls1-www.cs.tu-dortmund.de/de/kontakt-thomas-schwentick * The opening is in the working group of Thomas Schwentick and involves teaching in German language. (Remark: this paragraph should not be longer than 10 lines) * Contact: TU Dortmund, Dept. of Computer Science Chair I - Logic in Computer Science Thomas Schwentick Otto-Hahn-Str. 12 D-44227 Dortmund