Maurice Tchoupé Tchendji ; Brice Nguefack - XPath bipolar queries and evaluation

arima:3108 - Revue Africaine de Recherche en Informatique et Mathématiques Appliquées, July 11, 2017, Volume 27 - 2017 - Special issue CARI 2016 - https://doi.org/10.46298/arima.3108
XPath bipolar queries and evaluation

Authors: Maurice Tchoupé Tchendji ; Brice Nguefack

    The concept of bipolar queries (also call preferences queries) emerged in the Relational Databasescommunity, allowing users to get much more relevant responses to their requests, expressed via queries say withpreferences. Such requests usually have two parts: the first is used to express the strict constraints and thesecond, preferences or wishes. Any response to a query with preferences must necessarily satisfy the first partand preferably the latter. However, if there is at least a satisfactory answer of the second part, those satisfyingonly the first part will be excluded from the final result: they are dominated. In this paper, we explore an approachof importation of this concept in a XML Database via XPath language. To do this, we propose PrefSXPathlanguage, an extension of XPath in order to express XPath queries with structural preferences, then we presenta query evaluation algorithm of PrefSXPath using automata


    Volume: Volume 27 - 2017 - Special issue CARI 2016
    Published on: July 11, 2017
    Accepted on: July 11, 2017
    Submitted on: July 10, 2017
    Keywords: Preferences Queries,XML Database,Automata,Skyline,Base de Données XML,Requêtes avec Préférences,XPath, XML,Automates ,[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL],[INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE],[INFO] Computer Science [cs]

    1 Document citing this article

    Share

    Consultation statistics

    This page has been seen 630 times.
    This article's PDF has been downloaded 494 times.