Abstract
To build the d-dimensional datacube, for on-line analytical processing, in the relational algebra, the database programming language must support a loop of d steps. Each step of the loop involves a different attribute of the data relation being cubed, so the language must support attribute metadata. A set of attribute names is a relation on the new data type, attribute. It can be used in projection lists and in other syntactical postions requiring sets of attributes. It can also be used in nested relations, and the transpose operator is a handy way to create such nested metadata. Nested relations of attribute names enable us to build decision trees for classification data mining. This paper uses OLAP and data mining to illustrate the advantages for the relational algebra of adding the metadata type attribute and the transpose operator.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agarwal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In P. Buneman and S. Jajodia, editors, Proceedings of the 1993 ACM International Conference on Management of Data, May 26–28, 1993, pages 207–16, Washington, D.C., May 1993. ACM Press.
E.F. Codd, S.B. Codd, and C.T. Salley. Providing OLAP to user-analysts: An IT mandate. Technical report, E.F. Codd & Associates, Hyperion Solutions, Sunnyvale, CA, 1993. http://www.arborsoft.com/essbase/wht_ppr/coddps.zip, http://www.arborsoft.com/essbase/wht_ppr/coddTOC.html.
P. Fischer and S. Thomas. Operators for non-first-normal-form relations. In Proc. 7th COMPSAC, pages 464–75, Chicago, November 1983.
J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichert, M. Venkatarao, F. Pellow, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Mining und Knowledge Discovery, 1:29–53, 1997.
G. Jaeschke and H.-J. Schek. Remarks on the algebra of non first normal form relations. In Proc. ACM Symposium on Principles of Database Systems, pages 124–38, March 1982.
A. Makinouchi. A consideration on normal form of not-necessarily normalized relations in the relational model. In A.G. Merten, editor, Proc. 3rd Internat. Conf. on Very Large Data Bases, pages 447–53, October 1977. examples of nest, recursive nest; discusses normalization, dep.
T.H. Merrett. Experience with the domain algebra. In C. Beeri, U. Dayal, and J.W. Schmidt, editors, Proc. 3rd Internat. Conf. on Data and Knowledge Bases: Improving Usability und Responsiveness, pages 335–46, San Mateo, California, July 1988. Morgan Kaufmann Publishers Inc.
G. Piatetsky-Shapiro. Discovery, analysis, and presentation of strong rules. In G. Piatetsky-Shapiro, editor, Knowledge Discovery in Databases, pages 229–48. AAAI/MIT Press, 1991.
J.R. Quinlan. Induction of decision trees. Machine Learning, 1(1):81–106, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Merrett, T.H. (2002). Attribute Metadata for Relational OLAP and Data Mining. In: Ghelli, G., Grahne, G. (eds) Database Programming Languages. DBPL 2001. Lecture Notes in Computer Science, vol 2397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46093-4_6
Download citation
DOI: https://doi.org/10.1007/3-540-46093-4_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44080-2
Online ISBN: 978-3-540-46093-0
eBook Packages: Springer Book Archive