Curtis Dyreson Department of Computer Science, James Cook University Information Retrieval from an Incomplete Data Cube Abstract: A data cube is a multidimensional space of aggregate values. The aggregate values in the cube are organised in a hierarchy. Values higher in the hierarchy are aggregations of values lower in the hierarchy. The hierarchical organisation supports `drill-down' and `roll-up' which are operations that jump between a low precision and a high precision view of the same aggregate. A "complete" data cube is a data cube in which every aggregate value in the multidimensional space is stored or can be computed. An "incomplete" data cube is a data cube in which points in the multidimensional space are missing and cannot be computed. Incomplete data cubes change the nature of retrieving information from a cube since a requested aggregate value might be missing. This talk will describe an incomplete data cube design. When: 1.00 pm, Thursday, 19 February 1998 Where: Seminar Room, Archway West