About The Forum
Calendar 2009 Poster Sessions : Confidence-Aware Join Algorithms
Abstract :
In uncertain databases, confidence values are associated with each data item. Confidence values are assigned to query results based on combining confidences from the input data. Users may wish to apply a threshold on result confidence values, ask for the “top-k” results by confidence, or obtain results sorted by confidence. Efficient algorithms for these types of queries can be devised by exploiting properties of the input data and the combining functions for result confidences. Previous algorithms for these problems assumed sufficient memory was available for processing. We address the problem of processing all three types of queries when sufficient memory is not available, minimizing retrieval cost. We present algorithms, theoretical guarantees, and experimental evaluation.
Bio:
Parag is a fourth year PhD student in the computer science department.
He works on uncertain data problems with Prof. Jennifer Widom.
In uncertain databases, confidence values are associated with each data item. Confidence values are assigned to query results based on combining confidences from the input data. Users may wish to apply a threshold on result confidence values, ask for the “top-k” results by confidence, or obtain results sorted by confidence. Efficient algorithms for these types of queries can be devised by exploiting properties of the input data and the combining functions for result confidences. Previous algorithms for these problems assumed sufficient memory was available for processing. We address the problem of processing all three types of queries when sufficient memory is not available, minimizing retrieval cost. We present algorithms, theoretical guarantees, and experimental evaluation.
Bio:
Parag is a fourth year PhD student in the computer science department.
He works on uncertain data problems with Prof. Jennifer Widom.