View usability and safety for the answering of top-k queries via materialized views

Authors:
Eftychia Baikousi;Panos Vassiliadis
Affiliations:
Univ. of Ioannina, Ioannina, Greece;Univ. of Ioannina, Ioannina, Greece
Venue:
Proceedings of the ACM twelfth international workshop on Data warehousing and OLAP
Year:
2009

Citing 8
Cited 3

Combining fuzzy information from multiple systems (extended abstract)

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fuzzy queries in multimedia database systems

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PREFER: a system for the efficient execution of multi-parametric ranked queries

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Optimizing Multi-Feature Queries for Image Databases

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Query Processing Issues in Image(Multimedia) Databases

ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Optimal aggregation algorithms for middleware

Journal of Computer and System Sciences - Special issu on PODS 2001
Algorithms and applications for answering ranked queries using ranked views

The VLDB Journal — The International Journal on Very Large Data Bases
Answering top-k queries using views

VLDB '06 Proceedings of the 32nd international conference on Very large data bases

Efficient distributed top-k query processing with caching

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
The SB-index and the HSB-index: efficient indices for spatial data warehouses

Geoinformatica
Efficient top-k query answering using cached views

Proceedings of the 16th International Conference on Extending Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate the problem of answering top-k queries via materialized views. We provide theoretical guarantees for the adequacy of a view to answer a top-k query, along with algorithmic techniques to compute the query via a view when this is possible. We explore the problem of answering a query via a combination of more than one view and show that it is impossible to improve our theoretical guarantees for the answering of a query via a combination of views. Finally, we experimentally assess our approach for its effectiveness and efficiency.