For today's class, we will be reading one of two papers. Originally, I only recommended the second one, but that proved to be way more theoretical than I remembered, so I added the first one. Read either one and give your response (but the first one will be way easier):

Dalvi, Nilesh, Christopher Re, and Dan Suciu. Probabilistic databases: diamonds in the dirt. Communications of the ACM 52.7 (2009): 86-94.
Dalvi, Nilesh, and Dan Suciu. Efficient query evaluation on probabilistic databases. VLDB (2004). We are reading this paper because it's a top paper on probablistic databases.

To successfully complete this reading, be ready to write a good response and be prepared for a good in class discussion, I suggest only skimming section 4 and not worrying too much about the theoretical results.

[504 home] [grading] [schedule][project] [Connect]

Rachel Pottinger
E-mail Address: rap [at] cs [dot] ubc [dot] ca

Office Location: ICICS 345
Phone: (604)822-0436
Fax:(604)822-5485
Postal/Courier address:
The Department of Computer Science
University of British Columbia
201-2366 Main Mall
Vancouver, B.C. V6T 1Z4
Canada