Multidimensionality in Statistical, OLAP and Scientific Databases
IGI Global eBooksPublished 1 January 2003Open access
Arie Shoshani
Citations5
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This chapter shows the commonality of concepts between three database areas: statistical, OLAP, and scientific databases, and argues that the concepts of multidimensionality and classification structures should be elevated to "first class" object types.
Abstract
The term “multidimensional databases” refers to data that can be viewed conceptually in a multidimensional space, where each dimension represents some attributes of the data. Viewing data in this form is natural for many applications, yet the concepts are not treated in a uniform way in the database literature. In this chapter, we show the commonality of concepts between three database areas: statistical, OLAP, and scientific databases. We show that these domains have two main structural concepts: the cross-product space of the dimensions, and the classification hierarchy structure associated with each dimension. In the first part of this chapter we describe how these structures are sed to represent data in statistical and OLAP databases and how summarization operators can be applied to them. Further, we discuss how these structures can be extended to represent related information using federated database concepts. In the second part of the chapter we show that these concepts are common to many scientific database applications. In particular, we discuss the importance of supporting classification structures and the difficulty in representing them as tables in relational databases. We also discuss data structures to support multidimensional databases, emphasizing space-time representation, clustering in multidimensional space, indexing in multidimensional space, and supporting classification structures. We conclude by arguing that the concepts of multidimensionality and classification structures as well as the operation over them should be elevated to “first class” object types. These object types should be visible by the application user explicitly in the conceptual schemas as well as exposing them in the user interfaces.
Keywords
Computer Science
ACM Computing SurveysData clustering
13,184 Citations1999Anil K. Jain, M. Narasimha Murty +1 more
An overview of pattern clustering methods from a statistical pattern recognition perspective is presented, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners.
R-trees
6,543 Citations1984Antonin Guttman
A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
ACM Computing SurveysThe Quadtree and Related Hierarchical Data Structures
2,171 Citations1984Hanan Samet
L'accentuation est mise sur la representation de donnees dans les applications de traitement d'images, d'infographie, les systemes d'informations geographiques and the robotique.
Data Mining and Knowledge DiscoveryData Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
2,134 Citations1997Jim Gray, Surajit Chaudhuri +6 more
This paper explains the cube and roll-up operators, shows how they fit in SQL, explains how users can define new aggregatefunctions for cubes, and discusses efficient techniques to compute the cube.
Very Large Data BasesThe R+-Tree: A Dynamic Index for Multi-Dimensional Objects
1,263 Citations2018Timos Sellis, Nick Roussopoulos +1 more
A variation to Guttman’s Rtrees (R+-trees) that avoids overlapping rectangles in intermediate nodes of the tree is introduced and analytical results indicate that R+-Trees achieve up to 50% savings in disk accesses compared to an R-tree when searching files of thousands of rectangles.
Implementing data cubes efficiently
1,166 Citations1996Venky Harinarayan, Anand Rajaraman +1 more
This paper investigates the issue of which cells (views) to materialize when it is too expensive to materialized all views, and presents greedy algorithms that work off this lattice and determine a good set of views to materializing.
ACM Transactions on Database SystemsThe Grid File
1,149 Citations1984J. Nievergelt, Hans Hinterberger +1 more
This work discusses in detail the design decisions that led to the grid file, present simulation results of its behavior, and compare it to other multikey access file structures.
ACM Computing SurveysSearching in high-dimensional spaces
827 Citations2001Christian Böhm, Stefan Berchtold +1 more
An overview of the current state of the art in querying multimedia databases is provided, describing the index structures and algorithms for an efficient query processing in high-dimensional spaces.
The VLDB JournalAn introduction to spatial database systems
717 Citations1994Ralf Hartmut G�ting
This work surveys data modeling, querying, data structures and algorithms, and system architecture for spatial database systems, with the emphasis on describing known technology in a coherent manner, rather than listing open problems.
The pyramid-technique
402 Citations1998Stefan Berchtold, Christian Böhm +1 more
The results of experiments demonstrate that the Pyramid-Technique outperforms the X-tree and the Hilbert R-tree by a factor of up to 14 (number of page accesses) and up to 2500 (total elapsed time) for range queries.
IEEE Transactions on Knowledge and Data EngineeringVisualization techniques for mining large databases: a comparison
373 Citations1996Daniel A. Keim, H.-P. Kriegel
This article describes and evaluates a new visualization-based approach to mining large databases and compares them to other well-known visualization techniques for multidimensional data: the parallel coordinate and stick-figure visualization techniques.
KOPS (University of Konstanz)Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
336 Citations1999Alexander Hinneburg, Daniel A. Keim
A new clustering technique called OptiGrid is developed which is based on constructing an optimal grid-partitioning of the data and has a mathematical basis which is by far more e ectiveness andiency than existing clustering algorithms for highdimensional data.
Summarizability in OLAP and statistical data bases
292 Citations2002H. Lenz, Arie Shoshani
A framework for precisely specifying the context in which statistical objects are defined is introduced, which uses a three-step process to define normalized statistical objects.
Lecture notes in computer scienceA logical approach to multidimensional databases
283 Citations1998Luca Cabibbo, Riccardo Torlone
This paper presents MD, a logical model for OLAP systems, and shows how it can be used in the design of multidimensional databases, and presents a design methodology, to obtain an MD scheme from an operational database.
GeoInformaticaSurvey of Spatio-Temporal Databases
212 Citations1999Tamas Abraham, John F. Roddick
An overview of previous achievements within the spatio-temporal data field is provided and areas currently receiving or requiring further investigation are highlighted.
OLAP and statistical databases
171 Citations1997Arie Shoshani
It is argued for the support of a Statistical Object data type as one of the fundamental structures that object-oriented data models and systems should support.
Lecture notes in computer scienceQuerying multidimensional databases
135 Citations1998Luca Cabibbo, Riccardo Torlone
A model and a query language are introduced to establish a theoretical basis for multi-dimensional data analysis based on the notions of dimension and f-table and compared with other approaches.
IEEE Transactions on Software EngineeringStatistical and Scientific Database Issues
93 Citations1985Arie Shoshani, Harry K. T. Wong
The purpose of this paper is to summarize the research issues of statistical and scientific databases (SSDB's), and organizes the issues into four major groups: physical organization and access methods, operators, logical organization and user interfaces, and miscellaneous issues.
Extending Practical Pre-Aggregation in On-Line Analytical Processing
76 Citations1999Torben Bach Pedersen, Christian S. Jensen +1 more
Algorithms are given that transform “irregular” dimension hierarchies and fact-dimension relationships, which often occur in real-world OLAP applications, into well-behaved structures that, when used by existing OLAP systems, enable practical pre-aggregation.
Very Large Data BasesSUBJECT: a directory driven system for organizing and accessing large statistical databases
73 Citations1981Paul H. Chan, Arie Shoshani
The concepts, design and capabilities of an existing system for managing statistical data bases are described, which are amenable to statistical summaries.
Multidimensional indexing and query coordination for tertiary storage management
65 Citations2003Arie Shoshani, Luı́s M. Bernardo +3 more
This work describes the architecture and implementation of a Storage Access Coordination System (STACS) designed to optimize the use of a disk cache, and thus minimize the number of files read from tape, and focuses on a specific application area, high energy physics data management and analysis environment.
MAC: Conceptual Data Modeling for OLAP
64 Citations2001Aris Tsois, Nikos Karayannidis +1 more
The central concept of the model is the Multidimensional Aggregation Cube, which gives a broad and flexible definition to the notion of a multidimensional cube, and it is shown that MAC offers a unique combination of modeling skills.
A performance comparison of bitmap indexes
61 Citations2001Kesheng Wu, Ekow Otoo +1 more
Two new word-aligned schemes are presented that perform logical operations on compressed data 12 times faster than BBC and achieve this performance advantage by guaranteeing that during logical operations every machine instruction performs useful work on words rather than on bytes or bits.
Lecture notes in computer scienceThe Dynamic Data Cube
57 Citations2000S. Geffner, Divakant Agrawal +1 more
The Dynamic Data Cube is presented, a new approach to range sum queries which provides efficient performance for both queries and updates, which handles clustered and sparse data gracefully, and which allows for the dynamic expansion of the data cube in any direction.
Information SystemsEfficient organization and access of multi-dimensional datasets on tertiary storage systems
54 Citations1995Lingpeng Chen, R. Drach +4 more
This paper has developed algorithms for partitioning the original datasets into “clusters” based on analysis of data access patterns and storage device characteristics, and designed enhancements to current storage server protocols to permit control over physical placement of data on storage devices.
eScholarship (California Digital Library)Characteristics of Scientific Databases
49 Citations1984Arie Shoshani, Frank Olken +1 more
Extending OLAP querying to external object databases
36 Citations2000Torben Bach Pedersen, Arie Shoshani +2 more
The concepts and techniques underlying a flexible, “multi-model” federated system that enables OLAP users to exploit simultaneously the features of OLAP and object database systems are presented.
Clustering techniques for large data sets—from the past to the future
31 Citations1999Daniel A. Keim, Alexander Hinneburg
The main goal of the tutorial is to provide an overview of the state-of-the-art in cluster discovery methods for large databases, covering well-known clustering methods from related fields such as statistics, pattern recognition, and machine learning, as well as database techniques which allow them to work efficiently on large databases.
CROSS-DB
11 Citations1996Wolfgang Lehner, Thomas Ruf +1 more
The CROSS-DB data model presented in this paper is optimized for use in such applications by providing advanced data mo&lling methods and application-oriented query fmilities, thus providing afiamework for optimized alzta nuuuzgement procedures.
Clustering high dimensional massive scientific datasets
8 Citations2002Ekow Otoo, Arie Shoshani +1 more
This work introduces a hybrid algorithm called HyCeltyc, which stands for Hybrid Cell Density Clustering method, which combines a cell-density based algorithm with a hierarchical agglomerative method to identify clusters in linear time.