Querying probabilistic preferences in databases

Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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 languageEnglish (US)
    Title of host publicationPODS 2017 - Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
    PublisherAssociation for Computing Machinery
    Pages21-36
    Number of pages16
    VolumePart F127745
    ISBN (Electronic)9781450341981
    DOIs
    StatePublished - May 9 2017
    Event36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017 - Chicago, United States
    Duration: May 14 2017May 19 2017

    Other

    Other36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017
    CountryUnited States
    CityChicago
    Period5/14/175/19/17

    Fingerprint

    Polynomials

    Keywords

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

    ASJC Scopus subject areas

    • Software
    • Information Systems
    • Hardware and Architecture

    Cite this

    Kenig, B., Kimelfeld, B., Ping, H., & Stoyanovich, J. (2017). Querying probabilistic preferences in databases. In 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.

    PODS 2017 - Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Vol. Part F127745 Association for Computing Machinery, 2017. p. 21-36.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Kenig, B, Kimelfeld, B, Ping, H & Stoyanovich, J 2017, Querying probabilistic preferences in databases. in 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
    Kenig B, Kimelfeld B, Ping H, Stoyanovich J. Querying probabilistic preferences in databases. In PODS 2017 - Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Vol. Part F127745. Association for Computing Machinery. 2017. p. 21-36 https://doi.org/10.1145/3034786.3056111
    Kenig, Batya ; Kimelfeld, Benny ; Ping, Haoyue ; Stoyanovich, Julia. / Querying probabilistic preferences in databases. PODS 2017 - Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Vol. Part F127745 Association for Computing Machinery, 2017. pp. 21-36
    @inproceedings{45f098be6a324da7b26bb9950451b574,
    title = "Querying probabilistic preferences in databases",
    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.",
    keywords = "Probabilistic databases, Probabilistic preferences, Ranking distributions, Repeated insertion model",
    author = "Batya Kenig and Benny Kimelfeld and Haoyue Ping and Julia Stoyanovich",
    year = "2017",
    month = "5",
    day = "9",
    doi = "10.1145/3034786.3056111",
    language = "English (US)",
    volume = "Part F127745",
    pages = "21--36",
    booktitle = "PODS 2017 - Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems",
    publisher = "Association for Computing Machinery",

    }

    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 -