My Account Log in

1 option

Probabilistic Databases / by Dan Suciu, Dan Olteanu, Christopher Re, Christoph Koch.

Springer Nature Synthesis Collection of Technology Collection 4 Available online

Springer Nature Synthesis Collection of Technology Collection 4
Format:
Book
Author/Creator:
Suciu, Dan., Author.
Olteanu, Dan., Author.
Re, Christopher., Author.
Koch, Christoph., Author.
Series:
Synthesis Lectures on Data Management, 2153-5426
Language:
English
Subjects (All):
Computer networks.
Data structures (Computer science).
Information theory.
Computer Communication Networks.
Data Structures and Information Theory.
Local Subjects:
Computer Communication Networks.
Data Structures and Information Theory.
Physical Description:
1 online resource (XV, 164 p.)
Edition:
1st ed. 2011.
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2011.
Summary:
Probabilistic databases are databases where the value of some attributes or the presence of some records are uncertain and known only with some probability. Applications in many areas such as information extraction, RFID and scientific data management, data cleaning, data integration, and financial risk assessment produce large volumes of uncertain data, which are best modeled and processed by a probabilistic database. This book presents the state of the art in representation formalisms and query processing techniques for probabilistic data. It starts by discussing the basic principles for representing large probabilistic databases, by decomposing them into tuple-independent tables, block-independent-disjoint tables, or U-databases. Then it discusses two classes of techniques for query evaluation on probabilistic databases. In extensional query evaluation, the entire probabilistic inference can be pushed into the database engine and, therefore, processed as effectively as the evaluation of standard SQL queries. The relational queries that can be evaluated this way are called safe queries. In intensional query evaluation, the probabilistic inference is performed over a propositional formula called lineage expression: every relational query can be evaluated this way, but the data complexity dramatically depends on the query being evaluated, and can be #P-hard. The book also discusses some advanced topics in probabilistic data management such as top-k query processing, sequential probabilistic databases, indexing and materialized views, and Monte Carlo databases. Table of Contents: Overview / Data and Query Model / The Query Evaluation Problem / Extensional Query Evaluation / Intensional Query Evaluation / Advanced Techniques.
Contents:
Overview
Data and Query Model
The Query Evaluation Problem
Extensional Query Evaluation
Intensional Query Evaluation
Advanced Techniques.
ISBN:
9783031018794
3031018796

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

We want your feedback!

Thanks for using the Penn Libraries new search tool. We encourage you to submit feedback as we continue to improve the site.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account