DocumentCode :
3335029
Title :
On the semantics and evaluation of top-k queries in probabilistic databases
Author :
Zhang, Xi ; Chomicki, Jan
Author_Institution :
Dept. of Comput. Sci. & Eng., Univ. at Buffalo, Buffalo, NY
fYear :
2008
fDate :
7-12 April 2008
Firstpage :
556
Lastpage :
563
Abstract :
We formulate three intuitive semantic properties for top-k queries in probabilistic databases, and propose Global-Topk query semantics which satisfies all of them. We provide a dynamic programming algorithm to evaluate top-k queries under Global-Topk in simple probabilistic relations. For general probabilistic relations, we show a polynomial reduction to the simple case. Our analysis shows that the complexity of query evaluation is linear in k and at most quadratic in database size.
Keywords :
dynamic programming; query processing; statistical databases; Global-Topk query semantics; dynamic programming algorithm; intuitive semantic properties; polynomial reduction; probabilistic databases; query evaluation; top-k queries; Bioinformatics; Biometrics; Biosensors; Cleaning; Computer science; Face recognition; Intelligent sensors; Query processing; Relational databases; Statistics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Engineering Workshop, 2008. ICDEW 2008. IEEE 24th International Conference on
Conference_Location :
Cancun
Print_ISBN :
978-1-4244-2161-9
Electronic_ISBN :
978-1-4244-2162-6
Type :
conf
DOI :
10.1109/ICDEW.2008.4498380
Filename :
4498380
Link To Document :
بازگشت