Full Citation

Title: Optimisation des requêtes skyline multidimensionnelles

Citation Type: Dissertation/Thesis

Publication Year: 2017

ISBN:

ISSN:

DOI:

NSFID:

PMCID:

PMID:

Abstract: As part of the selection of the best items in a multidimensional database,several kinds of query were defined. The skyline operator has the advantage of not requiring the definition of a scoring function in order to classify tuples. However, the property of monotony that this operator does not satify, (i) makes difficult to optimize its queries in a multidimensional context, (ii) makes hard to estimate the size of query result. This work proposes, first, to address the question of estimating the size of the result of a given skyline query, formulating estimators with good statistical properties (unbiased or convergent). Then, it provides two different approaches to optimize multidimensional skyline queries. The first leans on a well known database concept: functional dependencies. And the second approach looks like a data compression method. Both algorithms are very interesting as confirm the experimental results. Finally, we address the issue of skyline queries in dynamic data by adapting one of our previous solutions in this goal.

Url: https://tel.archives-ouvertes.fr/tel-01507468

User Submitted?: No

Authors: Wanko, Patrick Kamnang

Institution: Université de Bordeaux

Department: Computer Science

Advisor:

Degree:

Publisher Location:

Pages:

Data Collections: IPUMS USA

Topics: Methodology and Data Collection, Other

Countries: