Hiển thị biểu ghi dạng vắn tắt

dc.contributor.authorSuciu, Dan
dc.contributor.authorOlteanu, Dan
dc.contributor.authorRé, Christopher
dc.contributor.authorKoch, Christoph
dc.date.issued2011
dc.identifier.isbn9781608456802
dc.identifier.urihttps://thuvienso.hoasen.edu.vn/handle/123456789/3687
dc.descriptionxv, 164 p. : ill.
dc.description.abstractThis 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.
dc.language.isoen
dc.publisherMorgan & Claypool
dc.subjectData management
dc.subject.otherDatabases
dc.titleProbabilistic databases
dc.typeBook


Các tập tin trong tài liệu này

Thumbnail
Thumbnail

Tài liệu này xuất hiện trong Bộ sưu tập sau đây

Hiển thị biểu ghi dạng vắn tắt