Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

 
 
DownloadE-Mail
  Efficient Querying and Learning in Probabilistic and Temporal Databases

Dylla, M. (2014). Efficient Querying and Learning in Probabilistic and Temporal Databases. PhD Thesis, Universität des Saarlandes, Saarbrücken.

Item is

Dateien

einblenden: Dateien
ausblenden: Dateien
:
phd_thesis_maximilian_dylla.pdf (Postprint), 4MB
Name:
phd_thesis_maximilian_dylla.pdf
Beschreibung:
-
OA-Status:
Keine Angabe
Sichtbarkeit:
Öffentlich
MIME-Typ / Prüfsumme:
application/pdf / [MD5]
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:
ausblenden:
externe Referenz:
http://scidok.sulb.uni-saarland.de/volltexte/2014/5814/ (beliebiger Volltext)
Beschreibung:
-
OA-Status:
Grün
Beschreibung:
-
OA-Status:
Keine Angabe

Urheber

einblenden:
ausblenden:
 Urheber:
Dylla, Maximilian1, 2, Autor           
Weikum, Gerhard1, Ratgeber           
Theobald, Martin1, Gutachter           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, Campus E1 4, 66123 Saarbrücken, DE, ou_1116551              

Inhalt

einblenden:
ausblenden:
Schlagwörter: Deduction Rules, Probabilistic Database, Temporal Database, Learning, Constraints, Top-k
 Zusammenfassung: Probabilistic databases store, query, and manage large amounts of uncertain information. This thesis advances the state-of-the-art in probabilistic databases in three different ways: 1. We present a closed and complete data model for temporal probabilistic databases and analyze its complexity. Queries are posed via temporal deduction rules which induce lineage formulas capturing both time and uncertainty. 2. We devise a methodology for computing the top-k most probable query answers. It is based on first-order lineage formulas representing sets of answer candidates. Theoretically derived probability bounds on these formulas enable pruning low-probability answers. 3. We introduce the problem of learning tuple probabilities which allows updating and cleaning of probabilistic databases. We study its complexity, characterize its solutions, cast it into an optimization problem, and devise an approximation algorithm based on stochastic gradient descent. All of the above contributions support consistency constraints and are evaluated experimentally.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2014-05-092014-06-202014
 Publikationsstatus: Erschienen
 Seiten: VIII, 169 p.
 Ort, Verlag, Ausgabe: Saarbrücken : Universität des Saarlandes
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: BibTex Citekey: DyllaPhDThesis2014
URN: urn:nbn:de:bsz:291-scidok-58146
 Art des Abschluß: Doktorarbeit

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle

einblenden: