Ranking Queries on Uncertain Data

• Κύριοι συγγραφείς: Hua, Ming (Συγγραφέας), Pei, Jian (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: New York, NY : Springer New York, 2011.
• Έκδοση: 1.
• Σειρά: Advances in Database Systems, 42
• Θέματα: Computer science.; Computers.; Database management.; Data mining.; Computer Science.; Database Management.; Data Mining and Knowledge Discovery.; Information Systems Applications (incl. Internet).; Information Systems and Communication Service.

 Uncertain data is inherent in many important applications, such as environmental surveillance, market analysis, and quantitative economics research. Due to the importance of those applications and rapidly increasing amounts of uncertain data collected and accumulated, analyzing large collections of uncertain data has become an important task. Ranking queries (also known as top-k queries) are often natural and useful in analyzing uncertain data. Ranking Queries on Uncertain Data discusses the motivations/applications, challenging problems, the fundamental principles, and the evaluation algorithms of ranking queries on uncertain data. Theoretical and algorithmic results of ranking queries on uncertain data are presented in the last section of this book. Ranking Queries on Uncertain Data is the first book to systematically discuss the problem of ranking queries on uncertain data. 

 Introduction -- Probabilistic Ranking Queries on Uncertain Data -- Related Work -- Top-k Typicality Queries on Uncertain Data -- Probabilistic Ranking Queries on Uncertain Data -- Continuous Ranking Queries on Uncertain Streams -- Ranking Queries on Probabilistic Linkages -- Probabilistic Path Queries on Road Networks -- Conclusions -- References.