DocumentCode
1951776
Title
A data model and access method for summary data management
Author
Chen, Meng Chang ; McNamee, Lawrence
Author_Institution
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
fYear
1989
fDate
6-10 Feb 1989
Firstpage
242
Lastpage
249
Abstract
A data model and an access method for summary data management are proposed. Summary data, represented as a trinary tuple <statistical function, category, summary>, 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
Keywords
database management systems; query languages; SD-tree; access method; conventional database; data model; derivation; disjointness constraint; hyperrectangle; insertion; metaknowledge; orthogonal category; statistical function; stored summary data; summary data management; summary data search; summary data tree; Bridges; Computer science; Data engineering; Data models; Database systems; Decision making; Programming profession; Query processing;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering, 1989. Proceedings. Fifth International Conference on
Conference_Location
Los Angeles, CA
Print_ISBN
0-8186-1915-5
Type
conf
DOI
10.1109/ICDE.1989.47220
Filename
47220
Link To Document