SEARCH
0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Prev | Current Page 299 | Next

Robert Wrembel and Christian Koncilia

"Data Warehouses and Olap: Concepts, Architectures and Solutions"

Copying or distributing in print or electronic forms without written permission of
Idea Group Inc. is prohibited.
Tsois, A. (2005). Optimization of on-line analytical processing systems: Conceptual
data modeling and query processing techniques. Unpublished doctoral
dissertation, National Technical University Of Athens.
Tsois, A., & Sellis, T. (2003). The generalized pre-grouping transformation: Aggregate-
query optimization in the presence of dependencies (Tech. Rep. No.
TR-2003-4). Retrieved May 29, 2006, from http://www.dbnet.ece.ntua.gr/
pubs/uploads/TR-2003-4.pdf
Weber, R., Schek, H.-J., & Blott, S. (1998). A quantitative analysis and performance
study for similarity-search methods in high-dimensional spaces. VLDB, 194-
205.
Wu, M. C., & Buchmann, A. P. (1998). Encoded bitmap indexing for data warehouses.
ICDE, 220-230.
Yan, W. P., & Larson, P.-A. (1995). Eager aggregation and lazy aggregation. VLDB,
345-357.
Endnote
1 Naturally, the only way to favor more than one hierarchy (per dimension) in
clustering is to maintain redundant copies of the cube (Sarawagi & Stonebraker,
1994), or to treat different hierarchy paths as separate dimensions (Markl,
1999). The latter results in an increase of the cube dimensionality, rendering
clustering even more difficult (Weber, 1998).
Bitmap Indices for Data Warehouses
Copyright ?© 2007, Idea Group Inc.


Pages:
287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311