### Abstract

We propose a novel framework wherein probabilistic preferences can be naturally represented and analyzed in a probabilistic relational database. The framework augments the relational schema with a special type of a relation symbol - a preference symbol. A deterministic instance of this symbol holds a collection of binary relations. Abstractly, the probabilistic variant is a probability space over databases of the augmented form (i.e., probabilistic database). Effectively, each instance of a preference symbol can be represented as a collection of parametric preference distributions such as Mallows. We establish positive and negative complexity results for evaluating Conjunctive Queries (CQs) over databases where preferences are represented in the Repeated Insertion Model (RIM), Mallows being a special case. We show how CQ evaluation reduces to a novel inference problem (of independent interest) over RIM, and devise a solver with polynomial data complexity.

Original language | English (US) |
---|---|

Title of host publication | PODS 2017 - Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems |

Publisher | Association for Computing Machinery |

Pages | 21-36 |

Number of pages | 16 |

Volume | Part F127745 |

ISBN (Electronic) | 9781450341981 |

DOIs | |

State | Published - May 9 2017 |

Event | 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017 - Chicago, United States Duration: May 14 2017 → May 19 2017 |

### Other

Other | 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017 |
---|---|

Country | United States |

City | Chicago |

Period | 5/14/17 → 5/19/17 |

### Fingerprint

### Keywords

- Probabilistic databases
- Probabilistic preferences
- Ranking distributions
- Repeated insertion model

### ASJC Scopus subject areas

- Software
- Information Systems
- Hardware and Architecture

### Cite this

*PODS 2017 - Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems*(Vol. Part F127745, pp. 21-36). Association for Computing Machinery. https://doi.org/10.1145/3034786.3056111

**Querying probabilistic preferences in databases.** / Kenig, Batya; Kimelfeld, Benny; Ping, Haoyue; Stoyanovich, Julia.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*PODS 2017 - Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems.*vol. Part F127745, Association for Computing Machinery, pp. 21-36, 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, United States, 5/14/17. https://doi.org/10.1145/3034786.3056111

}

TY - GEN

T1 - Querying probabilistic preferences in databases

AU - Kenig, Batya

AU - Kimelfeld, Benny

AU - Ping, Haoyue

AU - Stoyanovich, Julia

PY - 2017/5/9

Y1 - 2017/5/9

N2 - We propose a novel framework wherein probabilistic preferences can be naturally represented and analyzed in a probabilistic relational database. The framework augments the relational schema with a special type of a relation symbol - a preference symbol. A deterministic instance of this symbol holds a collection of binary relations. Abstractly, the probabilistic variant is a probability space over databases of the augmented form (i.e., probabilistic database). Effectively, each instance of a preference symbol can be represented as a collection of parametric preference distributions such as Mallows. We establish positive and negative complexity results for evaluating Conjunctive Queries (CQs) over databases where preferences are represented in the Repeated Insertion Model (RIM), Mallows being a special case. We show how CQ evaluation reduces to a novel inference problem (of independent interest) over RIM, and devise a solver with polynomial data complexity.

AB - We propose a novel framework wherein probabilistic preferences can be naturally represented and analyzed in a probabilistic relational database. The framework augments the relational schema with a special type of a relation symbol - a preference symbol. A deterministic instance of this symbol holds a collection of binary relations. Abstractly, the probabilistic variant is a probability space over databases of the augmented form (i.e., probabilistic database). Effectively, each instance of a preference symbol can be represented as a collection of parametric preference distributions such as Mallows. We establish positive and negative complexity results for evaluating Conjunctive Queries (CQs) over databases where preferences are represented in the Repeated Insertion Model (RIM), Mallows being a special case. We show how CQ evaluation reduces to a novel inference problem (of independent interest) over RIM, and devise a solver with polynomial data complexity.

KW - Probabilistic databases

KW - Probabilistic preferences

KW - Ranking distributions

KW - Repeated insertion model

UR - http://www.scopus.com/inward/record.url?scp=85021212391&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85021212391&partnerID=8YFLogxK

U2 - 10.1145/3034786.3056111

DO - 10.1145/3034786.3056111

M3 - Conference contribution

AN - SCOPUS:85021212391

VL - Part F127745

SP - 21

EP - 36

BT - PODS 2017 - Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

PB - Association for Computing Machinery

ER -