• Home
  • Search
  • A view selection algorithm with performance guarantee
  • Cite Icon16
  • https://doi.org/10.1145/1516360.1516468Copy DOI Icon

A view selection algorithm with performance guarantee

  • Mar 24, 2009
  • Nicolas Hanusse +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually measured by three criteria: (1) the amount of memory to store the selected views, (2) the query response time and (3) the time complexity of this algorithm. The two first measurements deal with the output of the algorithm. No existing solutions give good trade-off between amount of memory and queries cost with a small time complexity. We propose in this paper an algorithm guaranteeing a constant approximation factor of queries response time with respect to the optimal solution. Moreover, the time complexity for a D-dimensional fact table is O (D * 2D) corresponding to the fastest known algorithm. We provide an experimental comparison with two other well known algorithms showing that our approach also gives good performance in terms of memory.

Similar Papers
  • Research Article
  • Citations16

Materialized View Selection Using Set Based Particle Swarm Optimization

  • Jul 01, 2018
  • International Journal of Cognitive Informatics and Natural Intelligence
  • Amit Kumar +1
  • Research Article
  • Citations39

Materialised view selection using differential evolution

  • Jan 01, 2014
  • International Journal of Innovative Computing and Applications
  • T.V Vijay Kumar +1
  • PDF
  • Research Article
  • Citations6

Development of maximum clique definition method in a non-oriented graph

  • Oct 30, 2017
  • Eastern-European Journal of Enterprise Technologies
  • Sergey Listrovoy +3
  • Research Article
  • Citations22

A context‐awareness model for activity recognition in robot‐assisted scenarios

  • Dec 11, 2019
  • Expert Systems
  • Francisco J Rodriguez Lera +3
  • Book Chapter
  • Citations6

Efficient Compression of Text Attributes of Data Warehouse Dimensions

  • Jan 01, 2005
  • Jorge Vieira +2
  • PDF
  • Research Article

Improved View Selection Algorithm Using SOM and 0/1 Knapsack

  • May 19, 2019
  • Statistics, Optimization & Information Computing
  • Reyhaneh Sabbagh Gol +1
  • Book Chapter
  • Citations4

A fast heuristic for approximating the minimum weight triangulation

  • Jan 01, 1996
  • Christos Levcopoulos +1
  • PDF
  • Research Article
  • Citations34

A Parallelized Database Damage Assessment Approach after Cyberattack for Healthcare Systems

  • Mar 31, 2021
  • Future Internet
  • Sanaa Kaddoura +3
  • Research Article
  • Citations12

An optimal insertion algorithm for one-sided height-balanced binary search trees

  • Sep 01, 1979
  • Communications of the ACM
  • Kari-Jouko Räihä +1
  • Conference Article
  • Citations8

Semi-Automated Exploration of Data Warehouses

  • Oct 17, 2015
  • Thibault Sellam +2
  • Book Chapter
  • Citations1

Study of Meta-Data Enrichment Methods to Achieve Near Real Time ETL

  • Nov 05, 2018
  • N Mohammed Muddasir +1
  • Research Article
  • Citations6

Solve the IRP problem with an improved discrete differential evolution algorithm

  • Jan 01, 2019
  • International Journal of Intelligent Information and Database Systems
  • Shi Cheng +1
  • Single Report
  • Citations40

An efficient compression scheme for bitmap indices

  • Apr 13, 2004
  • Kesheng Wu +2
  • Book Chapter
  • Citations2

Quicksort Algorithm—An Empirical Study

  • Jan 01, 2020
  • Gampa Rahul +2
  • Research Article
  • Citations3

Optimizing batch-processing operations with batch-position-based learning effects

  • Jan 01, 2021
  • RAIRO - Operations Research
  • Leilei Tai
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.