Exact and Approximate Generic Multi-criteria Top-k Query Processing - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Transactions on Large-Scale Data- and Knowledge-Centered Systems Année : 2015

Exact and Approximate Generic Multi-criteria Top-k Query Processing

Résumé

Many algorithms for multi-criteria top-k query processing with ranking predicates have been proposed, but little effort has been directed toward genericity, i.e. supporting any type of access to the lists of predicate scores (sorted and/or random), or any access cost settings. In this paper we propose a general approach to exact and approximate generic top-k processing. To this end, we propose a general framework (GF) for generic top-k processing, able to express any top-k algorithm and present within this framework a first comparison between generic algorithms. In previous work, we proposed BreadthRefine (BR), a generic algorithm that considers the current top-k candidates as a whole instead of focusing on the best candidate for score refinement, then we compared it with specific top-k algorithms. In this paper, we propose two variants of existing generic strategies and experimentally compare them with the BR breadth-first strategy, showing that BR leads to better execution costs. We also extend the notion of θ-approximation to the GF framework and present a first experimental study of the approximation potential of top-k algorithms on early stopping.
Fichier principal
Vignette du fichier
article.pdf (1017.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01417072 , version 1 (15-12-2016)

Identifiants

Citer

Mehdi Badr, Dan Vodislav. Exact and Approximate Generic Multi-criteria Top-k Query Processing. Transactions on Large-Scale Data- and Knowledge-Centered Systems, 2015, 18, pp.53 - 79. ⟨10.1007/978-3-662-46485-4_3⟩. ⟨hal-01417072⟩
102 Consultations
118 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More