Scaling Probabilistic Databases

نویسندگان

  • Hernán Blanco
  • Martin Theobald
چکیده

Probabilistic databases, which have been widely studied over the past years, lie at the expressive intersection of databases and probabilistic graphical models, thus aiming to provide efficient support for the evaluation of probabilistic queries over uncertain, relational data. Several Machine Learning approaches, on the one hand, have recently investigated the issue of distributed probabilistic inference but do not support relational data and SQL. Conventional database engines, on the other hand, do not handle probabilistic data and queries, nor any form of uncertain data management. With this project, we aim to fill this prevalent gap between the two fields of Databases and Machine Learning by scaling probabilistic databases to a distributed setting, which is a topic that so far has not been addressed in the literature. The proposed PhD dissertation topic provides a number of intriguing and challenging aspects, both from a theoretical and a systems-engineering perspective.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implicational Scaling of Reading Comprehension Construct: Is it Deterministic or Probabilistic?

In English as a Second Language Teaching and Testing situations, it is common to infer about learners’ reading ability based on his or her total score on a reading test. This assumes the unidimensional and reproducible nature of reading items. However, few researches have been conducted to probe the issue through psychometric analyses. In the present study, the IELTS exemplar module C (1994) wa...

متن کامل

Scaling Lifted Probabilistic Inference and Learning Via Graph Databases

Over the past decade, exploiting relations and symmetries within probabilistic models has been proven to be surprisingly effective at solving large scale data mining problems. One of the key operations inside these lifted approaches is counting be it for parameter/structure learning or for efficient inference. Typically, however, they just count exploiting the logical structure using adhoc oper...

متن کامل

Representing and Querying Uncertain Data

There has been a longstanding interest in building systems that can handle uncertain data. Traditional database systems inherently assume exact data and harbour fundamental limitations when it comes to handling uncertain data. In this dissertation, we present a probabilistic database model that can compactly represent uncertainty models in full generality. Our representation is associated with ...

متن کامل

Title of dissertation : REPRESENTING AND QUERYING UNCERTAIN DATA

Title of dissertation: REPRESENTING AND QUERYING UNCERTAIN DATA Prithviraj Sen, Doctor of Philosophy, 2009 Dissertation directed by: Professor Lise Getoor Department of Computer Science Professor Amol Deshpande Department of Computer Science There has been a longstanding interest in building systems that can handle uncertain data. Traditional database systems inherently assume exact data and ha...

متن کامل

Probabilistic Databases

This paper provides a glimpse of basic probabilistic database concepts, which is an active area of research in today’s world. The discussion starts with the need for probabilistic databases, and their advantages over conventional databases in certain circumstances. Then, some of the key aspects of probabilistic databases are discussed, which include topics like types of uncertainties in a proba...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015