This research work dynamically finds the most cost effective path from the lattice structure of cuboids based on concept hierarchy to minimize the query access ...

In this paper authors adopt an incremental view maintenance policy based on attribute affinity to update the materialized views at run time without using ...

This research work dynamically finds the most cost effective path from the lattice structure of cuboids based on concept hierarchy to minimize the query access ...

Dynamic discovery of query path on the lattice of cuboids using hierarchical data granularity and storage hierarchy · Source · Abstract · Identifiers · Authors.

Aug 2, 2022 · Bibliographic details on Dynamic discovery of query path on the lattice of cuboids using hierarchical data granularity and storage ...

Dynamic discovery of query path on the lattice of cuboids using hierarchical data granularity and storage hierarchy. 2014. Abstract.

The focus of this research work is to dynamically identify the most cost effective path within the lattice structure of cuboids to minimize the query access ...

These cuboids are resided in different layers of memory hierarchy like cache memory, primary memory, secondary memory, etc. This research work dynamically finds ...

Dynamic discovery of query path on the lattice of cuboids using hierarchical data granularity and storage hierarchy2013 | Elsevier. References (1).

Journal. Dynamic discovery of query path on the lattice of cuboids using hierarchical data granularity and storage hierarchy2013 | Elsevier. Publication cover.