The Logic and Database Theory group has moved to the Institute for Computer Science at J.W. Goethe-University in Frankfurt/Main and is called Theory of Complex Systems group now.
See http://www.informatik.uni-frankfurt.de/~tkshp.
|
Logic and Database Theory
Prof. Dr. Nicole Schweikardt |
![]() Logic in Computer Science, Dept. of Computer Science, Humboldt-University Berlin |
|
Processing huge data sets has emerged to a major challange for
computer science — last but not least due to the fact that external memory
has become an extremely cheap resource in recent years.
Huge data sets occur in many application areas, for example in collections of
research results (e.g., medical databases such as medline and swiss-prot),
in the form of sensor data, or in stock tickers.
Often, data is not available in the form of a classical database, but only in semistructured form, e.g., as XML document. Such semistructured data can be represented in a natural way by trees. Due to size of the data, a computer's main memory might be too small to hold a tree representation of all the data. Therefore, at any point in time, only a small fraction of the data is available in main memory, whereas the major amount of data solely resides in external memory. In many applications we even have the situation that data is only available bit by bit, in the form of a data stream. One such application, for example, is a stock ticker that constantly produces new data items. For efficiently processing such data, new techniques, extending those known from classical relational databases, need to be developed. Our logic and database theory research group investigates the foundations of processing huge, semistructured data, with an emphasis on the following topics: query optimisation, properties of query languages, and complexity theory for huge data set processing. In the following, some details on these topics are given. Complexity Theory for Huge Data Set Processing: Information theory and communication complexity of problems impose bounds on the efficiency of processing large data sets. Aims of this research project are to develop machine models and complexity classes for classifying the resources necessary for processing huge data sets and data streams, and to prove lower bounds on the costs produced by external memory accesses that are inherently necessary for solving certain problems. Properties of Query Languages: This research project's aim is to investigate properties (such as, e.g., expressive power, succinctness, evaluation complexity, and complexity of the query containment problem) of various query languages. Some of these aspects are already well-understood for node selecting languages such as XPath or Monadic Datalog. However, for data transformation languages, which allow the formulation of considerably more complex queries, e.g., joins, these aspects are far from being solved. Query Optimisation: Relational database management systems usually use algebraic and cost based methods to rewrite queries into equivalent queries that can be evaluated more efficiently. The aim of this research project is to develop methods for optimising queries against semistructured data such as, e.g., XML documents. A key task is to investigate, how schema information, i.e. information on the structure of the data, can be used for query optimisation. The Logic and Database Theory group is supported by the German Research Foundation (DFG). |
|
Head:
Prof. Dr. Nicole Schweikardt Secretary: Birgit Eisenmann Research Assistant: Dipl.-Inf. André Hernich Student: André Böhm |
|
André Hernich
Nicole Schweikardt |
Teaching:
|
Summer 2007:
Exercises in Logic and Complexity (Monday 3-5 p.m., room 1'305, Erwin Schrödinger-Zentrum) Research Seminar Logic in Computer Science (usually Fridays, 11 a.m. - 1 p.m., room 4.410, Johann von Neumann-Haus) Seminar ("Oberseminar") Theoretical Computer Science (usually Fridays, 1-3 p.m., room 3.101, Johann von Neumann-Haus) |
|
|
Location: Johann von Neumann-Haus Raum 4.426 (Haus 4, 4. Stock) Rudower Chaussee 25 12489 Berlin (Adlershof) How to find this |