A system for management and analysis of preference data

Marie Jacob, Benny Kimelfeld, Julia Stoyanovich

    Research output: Contribution to journalArticle

    Abstract

    Preference data arises in a wide variety of domains. Over the past decade, we have seen a sharp increase in the volume of preference data, in the diversity of applications that use it, and in the richness of preference data analysis methods. Examples of applications include rank aggregation in genomic data analysis, management of votes in elections, and recommendation systems in e-commerce. However, little attention has been paid to the challenges of building a system for preference-data management, which would help incorporate sophisticated analytics into larger applications, support computational abstractions for usability by data scientists, and enable scaling up to modern volumes. This vision paper proposes a management system for preference data that aims to address these challenges. We adopt the relational database model, and propose extensions that are specialized to handling preference data. Specically, we introduce a special type of a relation that is designed for preference data, and describe composable operators on preference relations that can be embedded in SQL statements, for convenient reuse across applications.

    Original languageEnglish (US)
    Pages (from-to)1255-1258
    Number of pages4
    JournalProceedings of the VLDB Endowment
    Volume7
    Issue number12
    DOIs
    StatePublished - Jan 1 2014

    Fingerprint

    Data handling
    Recommender systems
    Information management
    Agglomeration

    ASJC Scopus subject areas

    • Computer Science (miscellaneous)
    • Computer Science(all)

    Cite this

    A system for management and analysis of preference data. / Jacob, Marie; Kimelfeld, Benny; Stoyanovich, Julia.

    In: Proceedings of the VLDB Endowment, Vol. 7, No. 12, 01.01.2014, p. 1255-1258.

    Research output: Contribution to journalArticle

    Jacob, Marie ; Kimelfeld, Benny ; Stoyanovich, Julia. / A system for management and analysis of preference data. In: Proceedings of the VLDB Endowment. 2014 ; Vol. 7, No. 12. pp. 1255-1258.
    @article{be769b3978514c4fa0f89665f6ebe822,
    title = "A system for management and analysis of preference data",
    abstract = "Preference data arises in a wide variety of domains. Over the past decade, we have seen a sharp increase in the volume of preference data, in the diversity of applications that use it, and in the richness of preference data analysis methods. Examples of applications include rank aggregation in genomic data analysis, management of votes in elections, and recommendation systems in e-commerce. However, little attention has been paid to the challenges of building a system for preference-data management, which would help incorporate sophisticated analytics into larger applications, support computational abstractions for usability by data scientists, and enable scaling up to modern volumes. This vision paper proposes a management system for preference data that aims to address these challenges. We adopt the relational database model, and propose extensions that are specialized to handling preference data. Specically, we introduce a special type of a relation that is designed for preference data, and describe composable operators on preference relations that can be embedded in SQL statements, for convenient reuse across applications.",
    author = "Marie Jacob and Benny Kimelfeld and Julia Stoyanovich",
    year = "2014",
    month = "1",
    day = "1",
    doi = "10.14778/2732977.2732998",
    language = "English (US)",
    volume = "7",
    pages = "1255--1258",
    journal = "Proceedings of the VLDB Endowment",
    issn = "2150-8097",
    publisher = "Very Large Data Base Endowment Inc.",
    number = "12",

    }

    TY - JOUR

    T1 - A system for management and analysis of preference data

    AU - Jacob, Marie

    AU - Kimelfeld, Benny

    AU - Stoyanovich, Julia

    PY - 2014/1/1

    Y1 - 2014/1/1

    N2 - Preference data arises in a wide variety of domains. Over the past decade, we have seen a sharp increase in the volume of preference data, in the diversity of applications that use it, and in the richness of preference data analysis methods. Examples of applications include rank aggregation in genomic data analysis, management of votes in elections, and recommendation systems in e-commerce. However, little attention has been paid to the challenges of building a system for preference-data management, which would help incorporate sophisticated analytics into larger applications, support computational abstractions for usability by data scientists, and enable scaling up to modern volumes. This vision paper proposes a management system for preference data that aims to address these challenges. We adopt the relational database model, and propose extensions that are specialized to handling preference data. Specically, we introduce a special type of a relation that is designed for preference data, and describe composable operators on preference relations that can be embedded in SQL statements, for convenient reuse across applications.

    AB - Preference data arises in a wide variety of domains. Over the past decade, we have seen a sharp increase in the volume of preference data, in the diversity of applications that use it, and in the richness of preference data analysis methods. Examples of applications include rank aggregation in genomic data analysis, management of votes in elections, and recommendation systems in e-commerce. However, little attention has been paid to the challenges of building a system for preference-data management, which would help incorporate sophisticated analytics into larger applications, support computational abstractions for usability by data scientists, and enable scaling up to modern volumes. This vision paper proposes a management system for preference data that aims to address these challenges. We adopt the relational database model, and propose extensions that are specialized to handling preference data. Specically, we introduce a special type of a relation that is designed for preference data, and describe composable operators on preference relations that can be embedded in SQL statements, for convenient reuse across applications.

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

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

    U2 - 10.14778/2732977.2732998

    DO - 10.14778/2732977.2732998

    M3 - Article

    AN - SCOPUS:84905099073

    VL - 7

    SP - 1255

    EP - 1258

    JO - Proceedings of the VLDB Endowment

    JF - Proceedings of the VLDB Endowment

    SN - 2150-8097

    IS - 12

    ER -