Instructor: Wendy Hui Wang
|
Date |
Order |
Last Name |
First Name |
Paper Assignment |
|
11-Nov-08 |
1 |
Ayub |
Afaq |
Query Execution Assurance for
Outsourced Databases |
|
11-Nov-08 |
2 |
Bachchan |
Niharika |
Verifying Completeness of
Relational Query Results in Data Publishing |
|
11-Nov-08 |
3 |
Bhatte |
Swapnil |
Fast Data Anonymization
with Low Information Loss |
|
11-Nov-08 |
4 |
Brahmbhatt |
Sapna |
Self-tuning Histograms: Building
Histograms Without Looking at Data |
|
11-Nov-08 |
5 |
Chen |
Tzu-Ying |
Flexible Structure and Full-Text
Querying for XML |
|
11-Nov-08 |
6 |
Chen |
Yu-Jung |
Storage and Retrieval of XML
Data using Relational Databases |
|
18-Nov-08 |
1 |
Donadkar |
Rituja |
Answering Aggregation Queries in
a Secure System Model |
|
18-Nov-08 |
2 |
Kothari |
Kuldeep |
Providing database as a service |
|
18-Nov-08 |
3 |
Lee |
Chih-Yuan |
Anatomy: Simple and Effective
Privacy Preservation |
|
18-Nov-08 |
4 |
Li |
Ju-Chieh |
The Boundary Between Privacy and
Utility in Data Publishing |
|
18-Nov-08 |
5 |
Liu |
Ruilin |
Dynamic authenticated index
structures for outsourced databases |
|
18-Nov-08 |
6 |
Panchal |
Prashant |
Exploiting statistics on query
expressions for optimization |
|
25-Nov-08 |
1 |
Patel |
Dhrutiben |
XRANK: Ranked Keyword Search over XML
Documents |
|
25-Nov-08 |
2 |
Patel |
Sejalben |
Factorizing Complex Predicates
in Queries to Exploit Indexes. |
|
25-Nov-08 |
3 |
Patel |
Yaminiben |
Anonymizing Bipartite Graph Data using Safe Groupings |
|
25-Nov-08 |
4 |
Shah |
Mautik |
Structure and Content Scoring
for XML |
|
25-Nov-08 |
5 |
Singh |
Binita |
Incognito: Efficient Full Domain
K-anonymity |
|
25-Nov-08 |
6 |
Wang |
Chih-Chung |
Conditional Selectivity for
Statistics on Query Expressions |
Reason out what motivated your choice of the paper(s), the topic, etc.
It is hard to overemphasize the importance of this. Right up front, bring out a clear problem statement. In the beginning, it may not be technical, for that takes some development. However, the story behind the problem should be conveyed as clearly and as early as possible. Set the problem studied in the paper(s) in the context of previous work that has been done in the field. This would be usually done by the authors themselves. Rather than parrot them, bring your perspective to setting the context. This can be done only if you take the time to understand the context.
Why is this a worthwhile problem? What applications are driving it? What is the intellectual challenge in it? Where is the challenge -- mathematical analysis, algorithm design, complexity analysis, and empirical studies, something else?
List the technical contributions of the paper(s). This is intended to be an executive summary, that should make sense even to someone not in the area. Best presented in the form of bullets.
What is the originality/novelty of the contributions?
Is it a first? Is it a significantly different approach to an old problem? What if anything, is novel about the paper(s)?
This is where you'd delve into the technical details of the paper(s). Again, avoid parroting the authors. Take the time to understand the technical material of the paper(s). Don't be shy about getting technical here. Be that as it may, effective presentations use plenty of well-chosen examples as a tool for conveying technical concepts and results. The key is choosing the right examples: not too simple that they fail to bring out the intellectual fun part of the paper yet not too complex that you lose the audience quickly.
This is where you'd summarize the contributions, highlight any conclusions or lessons learned, and briefly sketch some interesting open problems.
What, in your opinion, are the strengths and weaknesses of the paper? If you were on SIGMOD/VLDB (or similar top conference) program committee and were reviewing this paper, would you recommend acceptance or rejection? Why?
A general note is that the papers were written by people you perhaps never met. But remember, the talk is yours . So, let's hear your voice and your perspective -- not just the authors' perspective -- in your talk.