Probabilistic Databases (Record no. 84615)

000 -LEADER
fixed length control field 03999nam a22005295i 4500
001 - CONTROL NUMBER
control field 978-3-031-01879-4
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730163439.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220601s2011 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783031018794
-- 978-3-031-01879-4
082 04 - CLASSIFICATION NUMBER
Call Number 004.6
100 1# - AUTHOR NAME
Author Suciu, Dan.
245 10 - TITLE STATEMENT
Title Probabilistic Databases
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2011.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XV, 164 p.
490 1# - SERIES STATEMENT
Series statement Synthesis Lectures on Data Management,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Overview -- Data and Query Model -- The Query Evaluation Problem -- Extensional Query Evaluation -- Intensional Query Evaluation -- Advanced Techniques.
520 ## - SUMMARY, ETC.
Summary, etc 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.
700 1# - AUTHOR 2
Author 2 Olteanu, Dan.
700 1# - AUTHOR 2
Author 2 Re, Christopher.
700 1# - AUTHOR 2
Author 2 Koch, Christoph.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-031-01879-4
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2011.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer networks .
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Data structures (Computer science).
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Information theory.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Communication Networks.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Data Structures and Information Theory.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 2153-5426
912 ## -
-- ZDB-2-SXSC

No items available.