Skip to Main content Skip to Navigation
Journal articles

Requêtes XPath bipolaires et évaluation

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

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01447297
Contributor : Maurice TCHOUPE TCHENDJI Connect in order to contact the contributor
Submitted on : Thursday, July 6, 2017 - 10:44:18 AM
Last modification on : Saturday, June 25, 2022 - 9:29:04 AM
Long-term archiving on: : Tuesday, January 23, 2018 - 11:08:45 PM

File

ARIMA-Vol27-1-22.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Maurice Tchoupé Tchendji, Brice Nguefack. Requêtes XPath bipolaires et évaluation. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2017, Volume 27 - 2017 - Special issue CARI 2016, ⟨10.46298/arima.3108⟩. ⟨hal-01447297v2⟩

Share

Metrics

Record views

146

Files downloads

993