Semantic Rewrite Rules at Object Oriented Query processing


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 2, No. 4, pp. 443-452, Jul. 1995
10.3745/KIPSTE.1995.2.4.443,   PDF Download:

Abstract

Object-oriented database systems have been proposed as an effective solution for providing the data management facilities of complex applications. Proving this claim and the investigation of related issues such as query processing have been hampered by the absence of a formal object-oriented query model. In this paper, we not only define a query model based on aggregation inheritance but also develop semantic rewriting rules which are applied to equivalence preserving rewrite rules in algebraic expression of a query. Analyzing semantically the query model, the query model can be optimized to logically object-oriented query processing. And algebra expressions of a query can be optimized by applying equivalence preserving rewrite rules.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. H. Ro, K. H. Sung, R. K. Ho, "Semantic Rewrite Rules at Object Oriented Query processing," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 2, no. 4, pp. 443-452, 1995. DOI: 10.3745/KIPSTE.1995.2.4.443.

[ACM Style]
Lee Hong Ro, Kwak Hoon Sung, and Ryu Keun Ho. 1995. Semantic Rewrite Rules at Object Oriented Query processing. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 2, 4, (1995), 443-452. DOI: 10.3745/KIPSTE.1995.2.4.443.