The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Selection of views to materialize in a data warehouse
Abstract
A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing decision-support or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of materialized views to be maintained at the warehouse. The goal is to select an appropriate set of views that minimizes total query response time and the cost of maintaining the selected views, given a limited amount of resource, e.g., materialization time, storage space, etc. In This work, we have developed a theoretical framework for the general problem of selection of views in a data warehouse. We present polynomial-time heuristics for a selection of views to optimize total query response time under a disk-space constraint, for some important special cases of the general data warehouse scenario, viz.: 1) an AND view graph, where each query/view has a unique evaluation, e.g., when a multiple-query optimizer can be used to general a global evaluation plan for the queries, and 2) an OR view graph, in which any view can be computed from any one of its related views, e.g., data cubes. We present proofs showing that the algorithms are guaranteed to provide a solution that is fairly close to (within a constant factor ratio of) the optimal solution. We extend our heuristic to the general AND-OR view graphs. Finally, we address in detail the view-selection problem under the maintenance cost constraint and present provably competitive heuristics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 2×
“If an A heuristic expands nodes in the increasing order of their gðxÞ þ hðxÞ values, it is known ([16]) that”
BackgroundA threshold of ln n for approximating set cover
Feige, U. (1998) · Journal of the ACM · doi:10.1145/285055.285059 · Cited by 3,086
Implementing data cubes efficiently
Harinarayan, V., Rajaraman, A., & Ullman, J. D. (1996) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/233269.233333 · Cited by 1,158
Sellis, T. K. (1988) · ACM Transactions on Database Systems · doi:10.1145/42201.42203 · Cited by 809
Cornuejols, G., Fisher, M. L., & Nemhauser, G. L. (1977) · Management Science · doi:10.1287/mnsc.23.8.789 · Cited by 793
Principles of artificial intelligence
Schliferstein, A. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.12145 · Cited by 644
Maintenance of Materialized Views: Problems, Techniques, and Applications
Gupta, A., & Mumick, I. S. (1999) · Materialized Views · doi:10.7551/mitpress/4472.003.0016 · Cited by 642
Self-citationResearch problems in data warehousing
Widom, J. (1995) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/221270.221319 · Cited by 642
Automated Selection of Materialized Views and Indexes in SQL Databases
Agrawal, S., Chaudhuri, S., & Narasayya, V. R. (2000) · Cited by 546
View maintenance in a warehousing environment
Zhuge, Y., García-Molina, H., Hammer, J., & Widom, J. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223848 · Cited by 430
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
Chaudhuri, S., & Narasayya, V. R. (1997) · Cited by 355
Selection of Views to Materialize Under a Maintenance Cost Constraint
Gupta, H., & Mumick, I. S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_28 · Cited by 219
Self-citationA threshold of ln n for approximating set cover (preliminary version)
Feige, U. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237977 · Cited by 214
Maintenance of data cubes and summary tables in a warehouse
Mumick, I. S., Quass, D., & Mumick, B. S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253277 · Cited by 186
Self-citationSPEEDING UP MATERIALIZED VIEW SELECTION IN DATA WAREHOUSES USING A RANDOMIZED ALGORITHM
Lee, M., & Hammer, J. (2001) · International Journal of Cooperative Information Systems · doi:10.1142/s0218843001000370 · Cited by 88
A System Prototype for Warehouse View Maintenance
Wiener, J. L., Gupta, H., Labio, W. J., Zhuge, Y., García-Molina, H., & Widom, J. (1996) · Cited by 73
Self-citation
Cited by
Bottom-up computation of sparse and Iceberg CUBE
Beyer, K., & Ramakrishnan, R. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304214 · Cited by 461
Mozaffari, M., Dignös, A., Gamper, J., & Störl, U. (2024) · ACM Computing Surveys · doi:10.1145/3665323 · Cited by 17
Metadata
- Authors
- Gupta, H., & Mumick, I. S.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2005-01
- Volume
- 17
- Issue
- 1
- Pages
- 24-43
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2017782374
- Cited by
- 280
- References
- 16
- FWCI
- 15.71
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
