Research Seminar (Fall 2003):

In this seminar we will discuss various research issues concerning the efficient processing of massive data sets. These include effective ways to represent synopses of massive data sets, algorithms and techniques of handling streaming data, and issues of representation and retrieval in modern information systems. Relevant application domains include

• Massive databases & data warehouses
• Telecom call records
• Data mining
• Information retrieval
• Market basket analysis
• Network monitoring and traffic engineering
• Sensor networks
• Program profiling

We will concentrate on works which have both theoretical and applied flavor. Such works may be published in conferences that deal with database systems, algorithms, theory, and various applications such as architecture and compilation, including ACM SIGMOD International Conference on Management of Data (SIGMOD), International Conference on Very Large Databases (VLDB), ACM-SIAM Symposium of Discrete Algorithms (SODA), ACM Symposium on Theoretical Computer Science (STOC), IEEE Foundation of Computer Science (FOCS), Architectural Support for Programming Languages and Operating Systems (ASPLOS), International Symposium on Computer Architecture (ISCA), International Conference on Compiler Construction (CC), and others.

No prior knowledge on databases will be assumed.

• Schedule.
• Students are encouraged to consult the following papers while preparing their presentations: Ian Parberry's speaker's guide for theoretical computer science (see also a related paper), McGeoch and Moret's paper on How to present a paper on experimental work with algorithms
• A link to a previous seminar.
• Useful resources.