Bookbot

Parametry

  • 180 stron
  • 7 godzin czytania

Więcej o książce

Probabilistic databases handle uncertainty in attribute values or record presence, with applications in information extraction, RFID, scientific data management, data cleaning, data integration, and financial risk assessment. These applications generate large volumes of uncertain data best modeled by probabilistic databases. This book explores the latest in representation formalisms and query processing techniques for such data. It begins with foundational principles for representing large probabilistic databases, decomposing them into tuple-independent tables, block-independent-disjoint tables, or U-databases. The discussion then shifts to two classes of query evaluation techniques. Extensional query evaluation allows probabilistic inference to be processed within the database engine, akin to standard SQL queries, with safe queries being those that can be evaluated this way. In contrast, intensional query evaluation relies on a propositional formula known as lineage expression, applicable to all relational queries, though its data complexity can be #P-hard. The book also covers advanced topics in probabilistic data management, including top-k query processing, sequential probabilistic databases, indexing, materialized views, and Monte Carlo databases.

Zakup książki

Probabilistic Databases, Dan Olteanu, Dan Suciu, Christopher Re ti, Christoph Koch

Język
Rok wydania
2011
Oprawa
(miękka)
Jak tylko się pojawi, wyślemy Ci wiadomość e-mail.

Metody płatności

Nikt jeszcze nie ocenił.Oceń

Tytuł
Probabilistic Databases
Język
angielski
Rok wydania
2011
Oprawa
miękka
Liczba stron
180
ISBN10
1608456803
ISBN13
9781608456802
Seria
Opis
Probabilistic databases handle uncertainty in attribute values or record presence, with applications in information extraction, RFID, scientific data management, data cleaning, data integration, and financial risk assessment. These applications generate large volumes of uncertain data best modeled by probabilistic databases. This book explores the latest in representation formalisms and query processing techniques for such data. It begins with foundational principles for representing large probabilistic databases, decomposing them into tuple-independent tables, block-independent-disjoint tables, or U-databases. The discussion then shifts to two classes of query evaluation techniques. Extensional query evaluation allows probabilistic inference to be processed within the database engine, akin to standard SQL queries, with safe queries being those that can be evaluated this way. In contrast, intensional query evaluation relies on a propositional formula known as lineage expression, applicable to all relational queries, though its data complexity can be #P-hard. The book also covers advanced topics in probabilistic data management, including top-k query processing, sequential probabilistic databases, indexing, materialized views, and Monte Carlo databases.