000 03999nam a22005295i 4500
001 978-3-031-01879-4
003 DE-He213
005 20240730163439.0
007 cr nn 008mamaa
008 220601s2011 sz | s |||| 0|eng d
020 _a9783031018794
_9978-3-031-01879-4
024 7 _a10.1007/978-3-031-01879-4
_2doi
050 4 _aTK5105.5-5105.9
072 7 _aUKN
_2bicssc
072 7 _aCOM043000
_2bisacsh
072 7 _aUKN
_2thema
082 0 4 _a004.6
_223
100 1 _aSuciu, Dan.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_978586
245 1 0 _aProbabilistic Databases
_h[electronic resource] /
_cby Dan Suciu, Dan Olteanu, Christopher Re, Christoph Koch.
250 _a1st ed. 2011.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2011.
300 _aXV, 164 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Data Management,
_x2153-5426
505 0 _aOverview -- Data and Query Model -- The Query Evaluation Problem -- Extensional Query Evaluation -- Intensional Query Evaluation -- Advanced Techniques.
520 _aProbabilistic 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.
650 0 _aComputer networks .
_931572
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 1 4 _aComputer Communication Networks.
_978587
650 2 4 _aData Structures and Information Theory.
_931923
700 1 _aOlteanu, Dan.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_978588
700 1 _aRe, Christopher.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_978589
700 1 _aKoch, Christoph.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_978590
710 2 _aSpringerLink (Online service)
_978591
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031007514
776 0 8 _iPrinted edition:
_z9783031030079
830 0 _aSynthesis Lectures on Data Management,
_x2153-5426
_978592
856 4 0 _uhttps://doi.org/10.1007/978-3-031-01879-4
912 _aZDB-2-SXSC
942 _cEBK
999 _c84615
_d84615