International audienceGiven a relational fact table R, we call a base of data cubes on R a structure that allows to query the data cubes with any aggregate function. This work presents a compact base of data cubes, called the first-half index base, with its implementation, and the method for querying the data cubes using this base. Through experiments on real datasets, we show how the first-half index base resolves efficiently the main data cube issues, i.e., the storage space and the query response time
Observed in many real applications, a top-k query often consists of two components to reflect a user...
Datacube queries compute aggregates over database relations at a variety of granularities, and they ...
Datacube queries compute aggregates over database relations at a variety of granularities, and they ...
International audienceWe call a base of data cubes a structure that allows to compute data cube quer...
International audience—This paper presents an approach to data cube representation that allows for e...
Abstract. A common operation involved with the majority of algo-rithms relevant to On-Line Analytica...
International audience—This paper presents a simple approach to represent data cubes that allows eff...
International audience—Many existing approaches to data cube computation search for the group-by par...
Abstract. Exact top-k query processing has caught much attention recently because of its wide use in...
In today’s data-driven world, analytical querying, typically based on the data cube concept, is the ...
The data cube is a critical tool for accelerating online analysis in big data. Due to its exponentia...
Most data cube compression approaches focused on reducing the cube size but overlooked preserving t...
This paper proposes a computation method for holistic multi-feature cube (MF-Cube) queries based on ...
A Multi-Feature Cube (MF-Cube) query is a complex-data-mining query based on data cubes, which compu...
Decision support applications involve complex queries on very large databases. Since response times ...
Observed in many real applications, a top-k query often consists of two components to reflect a user...
Datacube queries compute aggregates over database relations at a variety of granularities, and they ...
Datacube queries compute aggregates over database relations at a variety of granularities, and they ...
International audienceWe call a base of data cubes a structure that allows to compute data cube quer...
International audience—This paper presents an approach to data cube representation that allows for e...
Abstract. A common operation involved with the majority of algo-rithms relevant to On-Line Analytica...
International audience—This paper presents a simple approach to represent data cubes that allows eff...
International audience—Many existing approaches to data cube computation search for the group-by par...
Abstract. Exact top-k query processing has caught much attention recently because of its wide use in...
In today’s data-driven world, analytical querying, typically based on the data cube concept, is the ...
The data cube is a critical tool for accelerating online analysis in big data. Due to its exponentia...
Most data cube compression approaches focused on reducing the cube size but overlooked preserving t...
This paper proposes a computation method for holistic multi-feature cube (MF-Cube) queries based on ...
A Multi-Feature Cube (MF-Cube) query is a complex-data-mining query based on data cubes, which compu...
Decision support applications involve complex queries on very large databases. Since response times ...
Observed in many real applications, a top-k query often consists of two components to reflect a user...
Datacube queries compute aggregates over database relations at a variety of granularities, and they ...
Datacube queries compute aggregates over database relations at a variety of granularities, and they ...