The problem of selecting views and/or indexes to materialize has been extensively studied in the context of query optimization. Traditionally, the problem is formalized as follows: given a set of queries and a budget e.g., an available memory space, find the objects to materialize (views and/or indexes) that (1) satisfy the given budget and (2) minimize the query cost. In this paper, we depart from this setting by adopting a user-centric point of view: given a constraint on query evaluation, namely a maximal query cost the user does accept, find the objects (1) whose materialization needs the minimal storage space and (2) that guarantee the query evaluation constraint. We study this problem in the data cube setting and provide exact and approximate solutions. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hanusse, N., Maabout, S., & Tofan, R. (2011). Revisiting the partial data cube materialization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6909 LNCS, pp. 70–83). https://doi.org/10.1007/978-3-642-23737-9_6
Mendeley helps you to discover research relevant for your work.