A data model and access method for summary data management

A data model and an access method for summary data management are proposed. Summary data, represented as a trinary tuple , consist of metaknowledge summarized by a statistical function of a category of individual information typically stored in a conventional database. The concept of category (type or class) and the additivity property of statistical functions form a basis for the model that allows for the derivation of summary data. The complexity of deriving summary data has been found computationally intractable in general, and the proposed summary data model, with disjointness constraint, solves the problem without the loss of information. The proposed access method, called the summary data tree, or SD-tree, which handles an orthogonal category as a hyperrectangle, realizes the proposed summary data model. The structure of the SD-tree provides for efficient operations including summary data search, derivation, and insertion on the stored summary data.<<ETX>>

[1]  Jaideep Srivastava,et al.  A tree based access method (TBSAM) for fast processing of aggregate queries , 1988, Proceedings. Fourth International Conference on Data Engineering.

[2]  Sakti P. Ghosh SIAM: statistics information access method , 1988, Inf. Syst..

[3]  Jürg Nievergelt,et al.  The Grid file , 1983 .

[4]  Masao Sakauchi,et al.  The BD-Tree - A New N-Dimensional Data Structure with Highly Efficient Dynamic Characteristics , 1983, IFIP Congress.

[5]  H. Sato Handling summary information in a database: derivability , 1981, SIGMOD '81.

[6]  Diane C. P. Smith,et al.  Database abstractions: aggregation and generalization , 1977, TODS.

[7]  Andrew Chi-Chih Yao On the Complexity of Maintaining Partial Sums , 1985, SIAM J. Comput..

[8]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[9]  T. J. Teorey,et al.  A logical design methodology for relational databases using the extended entity-relationship model , 1986, CSUR.

[10]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.

[11]  Meng Chang Chen,et al.  A Model of Summary Data and its Applications in Statistical Databases , 1988, SSDBM.

[12]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[13]  Michael Stonebraker,et al.  An Analysis of Rule Indexing Implementations in Data Base Systems , 1986, Expert Database Conf..

[14]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[15]  Pascal Faudemay,et al.  An extension of access paths to improve joins and selections , 1986, 1986 IEEE Second International Conference on Data Engineering.

[16]  Sakti P. Ghosh Statistical relational tables for statistical database management , 1986, IEEE Transactions on Software Engineering.

[17]  A. Guttman,et al.  A Dynamic Index Structure for Spatial Searching , 1984, SIGMOD 1984.