Materialized views
R Chirkova, J Yang - Foundations and Trends® in …, 2012 - nowpublishers.com
Materialized views are queries whose results are stored and maintained in order to facilitate
access to data in their underlying base tables. In the SQL setting, they are now considered a …
access to data in their underlying base tables. In the SQL setting, they are now considered a …
[PDF][PDF] Design Considerations for High Fan-In Systems: The HiFi Approach.
Advances in data acquisition and sensor technologies are leading towards the development
of “high fan-in” architectures: widely distributed systems whose edges consist of numerous …
of “high fan-in” architectures: widely distributed systems whose edges consist of numerous …
Supporting ad-hoc ranking aggregates
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking)
aggregate queries, which provide the k groups with the highest aggregates as results …
aggregate queries, which provide the k groups with the highest aggregates as results …
Rewriting queries with arbitrary aggregation functions using views
The problem of rewriting aggregate queries using views is studied for conjunctive queries
with arbitrary aggregation functions and built-in predicates. Two types of queries over views …
with arbitrary aggregation functions and built-in predicates. Two types of queries over views …
Exact and inexact methods for selecting views and indexes for olap performance improvement
In on-line analytical processing (OLAP), precomputing (materializing as views) and indexing
auxiliary data aggregations is a common way of reducing query-evaluation time costs for …
auxiliary data aggregations is a common way of reducing query-evaluation time costs for …
Incremental checking of OCL constraints with aggregates through SQL
Valid states of data are those satisfying a set of constraints. Therefore, efficiently checking
whether some constraint has been violated after a data update is an important problem in …
whether some constraint has been violated after a data update is an important problem in …
Counting and enumeration problems with bounded treewidth
R Pichler, S Rümmele, S Woltran - … , LPAR-16, Dakar, Senegal, April 25 …, 2010 - Springer
Abstract By Courcelle's Theorem we know that any property of finite structures definable in
monadic second-order logic (MSO) becomes tractable over structures with bounded …
monadic second-order logic (MSO) becomes tractable over structures with bounded …
A formal model for the problem of view selection for aggregate queries
We present a formal analysis of the following view-selection problem: Given a set of queries
and a database, return definitions of views that, when materialized in the database, would …
and a database, return definitions of views that, when materialized in the database, would …
Stacked indexed views in Microsoft SQL Server
Appropriately selected materialized views (also called indexed views) can speed up query
execution by orders of magnitude. Most database systems limit support for materialized …
execution by orders of magnitude. Most database systems limit support for materialized …
Query evaluation using overlap** views: completeness and efficiency
G Gou, M Kormilitsin, R Chirkova - Proceedings of the 2006 ACM …, 2006 - dl.acm.org
We study the problem of finding efficient equivalent view-based rewritings of relational
queries, focusing on query optimization using materialized views under the assumption that …
queries, focusing on query optimization using materialized views under the assumption that …