OLAP and statistical databases
Published 1 May 1997
Arie Shoshani
Citations171
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
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.
Abstract
Article Free Access Share on OLAP and statistical databases: similarities and differences Author: Arie Shoshani Lawrence Berkeley National Lahoratory, Berkeley, California Lawrence Berkeley National Lahoratory, Berkeley, CaliforniaView Profile Authors Info & Claims PODS '97: Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systemsMay 1997 Pages 185–196https://doi.org/10.1145/263661.263682Published:01 May 1997Publication History 109citation2,001DownloadsMetricsTotal Citations109Total Downloads2,001Last 12 Months142Last 6 weeks27 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Keywords
Computer Science
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.
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.
Modeling multidimensional databases
453 Citations2002R. K. Agrawal, Ankit Gupta +1 more
A data model and a few algebraic operations that provide semantic foundation to multidimensional databases and provide an algebraic application programming interface (API) that allows the separation of the front end from the back end are proposed.
An array-based algorithm for simultaneous multidimensional aggregates
380 Citations1997Yihong Zhao, Prasad Deshpande +1 more
A MOLAP algorithm to compute the Cube, and a comparison between the two is interesting, since although they are computing the same function, one is value-based whereas the other is position-based, and the difference is so pronounced that this MOL AP algorithm may be useful for ROLAP systems as well as M OLAP systems, since in many cases, it is faster to first convert the table to an array, cube the array, then convert the result back to a table.
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.
Efficient organization of large multidimensional arrays
264 Citations2002Sunita Sarawagi, Michael Stonebraker
Methods of organizing arrays to make their access on secondary and tertiary memory devices fast and efficient are presented, showing that accesses on arrays organized using these techniques are often an order of magnitude faster than on the unoptimized data.
Statistics and ComputingRandom sampling from databases: a survey
182 Citations1995Frank Olken, Doron Rotem
This paper reviews recent literature on techniques for obtaining random samples from databases, and describes sampling for estimation of aggregates (e.g. the size of query results).
Cubetree
127 Citations1997Nick Roussopoulos, Yannis Kotidis +1 more
The “cubetree” is defined as a storage abstraction of the cube and realized in using packed R-trees for most efficient cube queries and the size of the delta increment is characterized for achieving good bulk update schedules for the cube.
Lecture notes in computer scienceStorm: A statistical object representation model
121 Citations1990Maurizio Rafanelli, Arie Shoshani
This paper identifies a number of SO representational problems in current models and a methodology for their solution, and proposes a new "statistical object representation model", based on a graph representation.
ACM Transactions on Database SystemsA fast procedure for finding a tracker in a statistical database
78 Citations1980Dorothy E. Denning, Jan Schlörer
A simple algorithm for finding a tracker when the maximum number of identical records is not too large and the number of queries required is at most &Ogr;(log2S) queries, where S is thenumber of distinct records possible.
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.
A DBMS For Large Statistical Databases
60 Citations1979Martin Turner, Raymond Hammond +1 more
The approach taken at Statistics Canada to create a generalized DBMS appropriate for the management of large statistical data-bases is described, with special emphasis on the usefulness of the transposed physical structure for the creation of statistical databases.
eScholarship (California Digital Library)Bit transposed files
57 Citations1985Harry K. T. Wong, Hsiu-Fen Liu +3 more
Results from experiments suggest that the bit transposed file is a reasonable alternative file structure for large SSDBs and is also amenable to special parallel hardware.
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)A compression technique for large statistical data-bases
49 Citations1981Susan J. Eggers, Frank Olken +1 more
This paper explores the compression of large statistical databases and proposes techniques for organizing the compressed data, such that the time required to access the data is logarithmic.
A language and a physical organization technique for summary tables
43 Citations1985Gültekin Özsoyoğlu, Z. Meral Özsoyoğlu +1 more
A set of summary table mampulatlon operators that, together with an algebra of set-valued relations, form an algebraic language for mampsulatmg set- valued relations and arbitrary summary tables are proposed.
Extendible arrays for statistical databases and OLAP applications
30 Citations2002Doron Rotem, Jianmin Zhao
This work proposes new methods to deal with disk resident extendible arrays and introduces a new index data structure for keeping track of the extensions, and a performance analysis is conducted for array extension and retrievals.
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.