Coverart for item
The Resource Probabilistic databases, Dan Suciu ... [et al.], (electronic book)

Probabilistic databases, Dan Suciu ... [et al.], (electronic book)

Label
Probabilistic databases
Title
Probabilistic databases
Statement of responsibility
Dan Suciu ... [et al.]
Contributor
Subject
Language
eng
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
Member of
Cataloging source
CaBNVSL
Dewey number
005.74
Illustrations
illustrations
Index
no index present
LC call number
QA76.9.D32
LC item number
P763 2011
Literary form
non fiction
Nature of contents
  • dictionaries
  • abstracts summaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
Suciu, Dan
http://library.link/vocab/subjectName
  • Databases
  • Probabilistic number theory
  • Query languages (Computer science)
Target audience
  • adult
  • specialized
Label
Probabilistic databases, Dan Suciu ... [et al.], (electronic book)
Instantiates
Publication
Bibliography note
Includes bibliographical references (p. 145-161)
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Preface: a great promise -- Acknowledgments --
  • 1. Overview -- Two examples -- Key concepts -- Probabilities and their meaning in databases -- Possible worlds semantics -- Types of uncertainty -- Types of probabilistic databases -- Query semantics -- Lineage -- Probabilistic databases v.s. graphical models -- Safe queries, safe query plans, and the dichotomy -- Applications of probabilistic databases -- Bibliographic and historical notes --
  • 2. Data and query model -- Background of the relational data model -- The probabilistic data model -- Query semantics -- Views: possible answer sets semantics -- Queries: possible answers semantics -- C-tables and PC-tables -- Lineage -- Properties of a representation system -- Simple probabilistic database design -- Tuple-independent databases -- BID databases -- U-databases -- Bibliographic and historical notes --
  • 3. The query evaluation problem -- The complexity of P([phi]) -- The complexity of P(Q) -- Bibliographic and historical notes --
  • 4. Extensional query evaluation -- Query evaluation using rules -- Query independence -- Six simple rules for P(Q) -- Examples of unsafe (intractable) queries -- Examples of safe (tractable) queries -- The möbius function -- Completeness -- Query evaluation using extensional plans -- Extensional operators -- An algorithm for safe plans -- Extensional plans for unsafe queries -- Extensions -- BID tables -- Deterministic tables -- Keys in the representation -- Bibliographic and historical notes --
  • 5. Intensional query evaluation -- Probability computation using rules -- Five simple rules for P([phi]) -- An algorithm for P([phi]) -- Read-once formulas -- Compiling P([phi]) -- d-DNNF -- FBDD -- OBDD -- Read-once formulas -- Approximating P([phi]) -- A deterministic approximation algorithm -- Monte Carlo approximation -- Query compilation -- Conjunctive queries without self-joins -- Unions of conjunctive queries -- Discussion -- Bibliographic and historical notes --
  • 6. Advanced techniques -- Top-k query answering -- Computing the set top-k -- Ranking the set top-k -- Sequential probabilistic databases -- Monte Carlo databases -- The MCDB data model -- Query evaluation in MCDB -- Indexes and materialized views -- Indexes for probabilistic data -- Materialized views for relational probabilistic databases --
  • Conclusion -- Bibliography -- Authors' biographies
Control code
201105DTM016
Dimensions
unknown
Extent
1 electronic text (xiv, 164 p.)
File format
multiple file formats
Form of item
online
Isbn
9781608456819
Issn
2153-5426
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
ill., digital file.
Reformatting quality
access
Specific material designation
remote
Label
Probabilistic databases, Dan Suciu ... [et al.], (electronic book)
Publication
Bibliography note
Includes bibliographical references (p. 145-161)
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Preface: a great promise -- Acknowledgments --
  • 1. Overview -- Two examples -- Key concepts -- Probabilities and their meaning in databases -- Possible worlds semantics -- Types of uncertainty -- Types of probabilistic databases -- Query semantics -- Lineage -- Probabilistic databases v.s. graphical models -- Safe queries, safe query plans, and the dichotomy -- Applications of probabilistic databases -- Bibliographic and historical notes --
  • 2. Data and query model -- Background of the relational data model -- The probabilistic data model -- Query semantics -- Views: possible answer sets semantics -- Queries: possible answers semantics -- C-tables and PC-tables -- Lineage -- Properties of a representation system -- Simple probabilistic database design -- Tuple-independent databases -- BID databases -- U-databases -- Bibliographic and historical notes --
  • 3. The query evaluation problem -- The complexity of P([phi]) -- The complexity of P(Q) -- Bibliographic and historical notes --
  • 4. Extensional query evaluation -- Query evaluation using rules -- Query independence -- Six simple rules for P(Q) -- Examples of unsafe (intractable) queries -- Examples of safe (tractable) queries -- The möbius function -- Completeness -- Query evaluation using extensional plans -- Extensional operators -- An algorithm for safe plans -- Extensional plans for unsafe queries -- Extensions -- BID tables -- Deterministic tables -- Keys in the representation -- Bibliographic and historical notes --
  • 5. Intensional query evaluation -- Probability computation using rules -- Five simple rules for P([phi]) -- An algorithm for P([phi]) -- Read-once formulas -- Compiling P([phi]) -- d-DNNF -- FBDD -- OBDD -- Read-once formulas -- Approximating P([phi]) -- A deterministic approximation algorithm -- Monte Carlo approximation -- Query compilation -- Conjunctive queries without self-joins -- Unions of conjunctive queries -- Discussion -- Bibliographic and historical notes --
  • 6. Advanced techniques -- Top-k query answering -- Computing the set top-k -- Ranking the set top-k -- Sequential probabilistic databases -- Monte Carlo databases -- The MCDB data model -- Query evaluation in MCDB -- Indexes and materialized views -- Indexes for probabilistic data -- Materialized views for relational probabilistic databases --
  • Conclusion -- Bibliography -- Authors' biographies
Control code
201105DTM016
Dimensions
unknown
Extent
1 electronic text (xiv, 164 p.)
File format
multiple file formats
Form of item
online
Isbn
9781608456819
Issn
2153-5426
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
ill., digital file.
Reformatting quality
access
Specific material designation
remote

Library Locations

Processing Feedback ...