<--- Back to Details
First PageDocument Content
Information technology management / Online analytical processing / Data / Data warehousing / Complexity classes / Functional dependency / Hierarchy / Relational model / OLAP cube / Data management / Data modeling / Database constraints
Date: 2001-06-29 04:41:58
Information technology management
Online analytical processing
Data
Data warehousing
Complexity classes
Functional dependency
Hierarchy
Relational model
OLAP cube
Data management
Data modeling
Database constraints

Logical Multidimensional Database Design for Ragged and Unbalanced Aggregation Hierarchies Tapio Niemi Department of Computer and Information Sciences, University of Tampere FINUniversity of Tampere,

Add to Reading List

Source URL: sunsite.informatik.rwth-aachen.de

Download Document from Source Website

File Size: 82,64 KB

Share Document on Facebook

Similar Documents

Lebesgue density and Π01 Classes Mushfeq Khan University of Hawai‘i at M¯anoa Algorithmic Randomness and Complexity Shonan Village Center September 12th, 2014

Lebesgue density and Π01 Classes Mushfeq Khan University of Hawai‘i at M¯anoa Algorithmic Randomness and Complexity Shonan Village Center September 12th, 2014

DocID: 1ubuP - View Document

Rademacher Complexity Margin Bounds for Learning with a Large Number of Classes Vitaly Kuznetsov Courant Institute of Mathematical Sciences, 251 Mercer street, New York, NY, 10012 Mehryar Mohri

Rademacher Complexity Margin Bounds for Learning with a Large Number of Classes Vitaly Kuznetsov Courant Institute of Mathematical Sciences, 251 Mercer street, New York, NY, 10012 Mehryar Mohri

DocID: 1t1hx - View Document

Principles of metabolism: coping with complexity Six classes of enzymes

Principles of metabolism: coping with complexity Six classes of enzymes

DocID: 1sh47 - View Document

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

DocID: 1ruap - View Document

The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1  School of Engineering and Computing Sciences, Durham University,

The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University,

DocID: 1rtIQ - View Document