Accepted tutorials:


Querying the Deep Web

Andrea Cali (University of Oxford, UK) and Davide Martinenghi (Politecnico di Milano, Italy)

Duration: 3 hours
Abstract;:br>Data stored outside Web pages and accessible from the Web, typically through HTML forms, consitute the so-called Deep Web. Such data are of great value, but difficult to query and search. We survey techniques to optimize query processing on the Deep Web, in a setting where data are represented in the relational model. We illustrate optimizations both at query plan generation time and at runtime, highlighting the role of integrity constraints. We discuss several prototype systems that address the query processing problem.

FPGAs: A New Point in the Database Design Space

Rene Mueller and Jens Teubner (ETH Zurich, Switzerland)

Duration: 3 hours
Abstract:
In line with the insight that "one size" of databases will not fit all application needs [19], the database community is cur- rently exploring various alternatives to commodity, CPU- based system designs. One particular candidate in this trend are field-programmable gate arrays (FPGAs), programmable chips that allow tailor-made hardware designs optimized for specific systems, applications, or even user queries. With a focus on database use, this tutorial introduces into FPGA technology, demonstrates its potential, but also pinpoints some challenges that need to be addressed before FPGA-accelerated database systems can go mainstream. The goal of this tutorial is to develop an intuition of an FPGA development cycle, receive guidelines for a "good" FPGA design, but also learn the limitations that hardware-imple- mented database processing faces. Our more high-level ambition is to spur a broader interest in database processing on novel hardware technology.