On the public citation graph
Extended Derivation Cube Based View Materialization Selection in Distributed Data Warehouse
0 signed · 24 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-46439-5_19openalex-snapshot
Materialized View Selection for Multi-cube Data Models
inferredcites →https://doi.org/10.1007/3-540-48298-9_15openalex-snapshot
Set-Derivability of Multidimensional Aggregates
inferredcites →https://doi.org/10.1007/3-540-49257-7_28openalex-snapshot
Selection of Views to Materialize Under a Maintenance Cost Constraint
inferredcites →https://doi.org/10.1007/3-540-62222-5_39openalex-snapshot
Selection of views to materialize in a data warehouse
inferredcites →https://doi.org/10.1007/s00778-002-0070-0openalex-snapshot
A formal perspective on the view selection problem
inferredcites →https://doi.org/10.1016/s0169-023x(98)00042-1openalex-snapshot
Incremental materialization of object-oriented views
inferredcites →https://doi.org/10.1023/a:1009726021843openalex-snapshot
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
inferredcites →https://doi.org/10.1109/tkde.2005.16openalex-snapshot
Selection of views to materialize in a data warehouse
inferredcites →https://doi.org/10.1145/276304.276328openalex-snapshot
Caching multidimensional queries using chunks
inferredcites →https://doi.org/10.1145/303976.303993openalex-snapshot
On the complexity of the view-selection problem
inferredcites →https://doi.org/10.1145/543613.543634openalex-snapshot
The view-selection problem has an exponential-time lower bound for conjunctive queries and views
inferredcites →https://doi.org/10.7551/mitpress/4472.003.0029openalex-snapshot
Implementing Data Cubes Efficiently
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.2192openalex-snapshot
A heuristic approach to selecting views for materialization
inferred← citeshttps://doi.org/10.1007/978-3-662-49534-6_3openalex-snapshot
A Constraint Optimization Method for Large-Scale Distributed View Selection
inferred← citeshttps://doi.org/10.1109/isps.2013.6581483openalex-snapshot
TOP-SKY: Top-down algorithm for computing the skycube
inferred← citeshttps://doi.org/10.1145/1244002.1244117openalex-snapshot
Horizontal fragmentation as a technique to improve the performance of drill-down and roll-up queries
inferred← citeshttps://doi.org/10.1145/1516360.1516484openalex-snapshot
Towards materialized view selection for distributed databases
inferred← citeshttps://doi.org/10.1145/2206869.2206874openalex-snapshot
A survey of view selection methods
inferred← citeshttps://doi.org/10.3906/elk-1608-112openalex-snapshot
TSGV: a table-like structure-based greedy method for materialized view selection in data warehouses
inferred← citeshttps://doi.org/10.4018/ijban.2017010103openalex-snapshot
Query Frequency based View Selection
inferred← citeshttps://doi.org/10.4018/ijirr.2016070104openalex-snapshot
Efficient Materialized View Selection for Multi-Dimensional Data Cube Models
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.