Maintenance of top-k materialized views

Eftychia Baikousi, Panos Vassiliadis
2009 Distributed and parallel databases  
In this paper we present results on the problem of maintaining materialized top-k views and provide results in two directions. The first problem we tackle concerns the maintenance of top-k views in the presence of high deletion rates. We provide a principled method that complements the inefficiency of the state of the art independently of the statistical properties of the data and the characteristics of the update streams. The second problem we have been concerned with has to do with the
more » ... nt maintenance of multiple top-k views in the presence of updates to their base relation. To this end, we provide theoretical guarantees for the nucleation (practically, inclusion) of a view with respect to another view and the reflection of this property to the management of updates. We also provide algorithmic results towards the maintenance of a large number of views, via their appropriate structuring in hierarchies of views. Keywords Top-k views · View refreshment Introduction The top-k querying problem concerns the retrieval of the top-k results of a ranked query over a database. Specifically, given a relation R(tid, A 1 , A 2 , . . . , A m ) and a query Q over R retrieves the top-k tuples from R having the k highest values according to a scoring function f that accompanies Q. Typically, f is a monotone ranking function of the form: f : dom(A 1 ) × · · · × dom(A m ) → .
doi:10.1007/s10619-009-7057-4 fatcat:z26ttg4ngvf6vdcxlwuaubz3ti