ACM Home Page
Please provide us with feedback. Feedback
Rule-based optimization and query processing in an extensible geometric database system
Full text PdfPdf (3.35 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 17 ,  Issue 2  (June 1992) table of contents
Pages: 247 - 303  
Year of Publication: 1992
ISSN:0362-5915
Authors
Ludger Becker  Univ. Gesamthochschule Siegen, Siegen, Germany
Ralf Hartmut Güting  Fern Univ. Hagen, Hagen, Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 49,   Citation Count: 19
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/128903.128905
What is a DOI?

ABSTRACT

Gral is an extensible database system, based on the formal concept of a many-sorted relational algebra. Many-sorted algebra is used to define any application's query language, its query execution language, and its optimiztion rules. In this paper we describe Gral's optimization component. It provides (1) a sophisticated rule language—rules are transformations of abstract algebra expressions, (2) a general optimization framework under which more specific optimization algorithms can be implemented, and (3) several control mechanisms for the application of rules. An optimization algorithm can be specified as a series of steps. Each step is defined by its own collection of rules together with a selected control strategy. The general facilities are illustrated by the complete design of an example optimizer—in the form of a rule file—for a small nonstandard query language and an associated execution language. The query language includes selection, join, ordering, embedding derived values, aggregate functions, and several geometric operations. The example shows in particular how the special processing techniques of a geometric database systems, such as spatial join methods and geometric index structures, can be integrated into query processing and optimization of a relational database system. A similar, though larger, optimizer is fully functional within the geometric database system implemented as a Gral prototype.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
DAYAL, U., MANOLA, F., BUCHMAN, A., CHAKRAVARTHY, U., GOLDHIRSCH, D., HEILER, S., ORENSTEIN, J., AND ROSENTHAL, A. Simplifying complex objects: The PROBE approach to modelling and querying them. In Proceedings of BTW 87, H. J. Schek and G. Schlageter, Eds., (Springer 1987), pp. 17-37.
5
 
6
7
8
 
9
GOGUEN, J A., T~ATCH~R, J. W., AXD WAGNER, E.G. An initial algebra approach to the specification, correctness, and implementation of abstract data types. In Current Trends in Programming Methodology, Vol. IV. R. Yeh, Ed., Prentice-Hall 1978, 80-149.
10
 
11
 
12
 
13
G~T~NG, R.H. Modeling non-standard database systems by many-sorted algebras. Universit~t Dortmund, Fachbereich Informatik, Report 255, 1988.
 
14
G(~TING, R.H. Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles. Acta Inf. 21 (1984), 271-291.
 
15
16
 
17
HAAS, L. M., CODY, W. F., FREYTAG, J. C., LAPIS, G., LINDSAY, B. G., LEHMAN, G. M., ONe, K., AND PIRAHESH, H. An extensible processor for an extended relational query language. IBM Almaden Research Center, Report RJ6182, 1988.
18
 
19
HASAN, W., AND PmA~ES~, H. Query rewrite optimization in starburst. IBM Almaden Research Center, Report RJ 6367, 1988.
 
20
HXI~DER, T., AND REUTER, A Architektur yon Datenbanksystemen fur Non-Standard- Anwendungen (Architecture of database systems for non-standard applications). In Proceedings of the Conference on "Datenbanksysteme in Biiro, Tech,ik, and Wissenschaft", A Blaser, and P. Pistor Eds (Karlsruhe 1985), pp 253-286
 
21
22
 
23
24
 
25
26
 
27
LEHMAN, G.M. Personal communication, 1990.
 
28
29
 
30
 
30a
ONe, K., AND LEHMAN, G.M. Extensible enumeration of feasible joins for relational query optimization. IBM Almaden Research Center, Report RJ6625, 1988.
31
32
 
33
ROSENTHAL A., AND HELMAN, P. Understanding and extending transformation-based optimizers. IEEE Database Eng. 10, 4 (1987), 220-227.
 
34
35
36
 
37
STONEBRAKER, M., RUBENSTEIN, B., AND GUTTMANN, A. Application of Abstract Data Types and Abstract Indices to CAD Databases. In Proceedings 1983 ACM Engineering Design Applications, pp. 107-114.
 
38
TESCHNER, J. Vergleich von Methoden zur Ausffihrung des Inside-Join in einem Geo- Datenbanksystem (Comparison of methods for performing the inside join in a geometric database system). Universit~t Dortmund, Fachbereich Informatik, Diplomarbeit, 1989.
 
39
WmMS, P. F., SCUWARZ, P. M., SCHEK, H.-J., AND HAAS, L.M. Incorporating Data Types in an Extensible Database Architecture. In Proceedings of the 3rd International Conference on Data and Knowledge Bases (Jerusalem, June 1988), pp. 180-192.
40

CITED BY  19


REVIEW

"M. Tamer O¨zsu : Reviewer"

Meeting the needs of new application domains, such as office information systems, CAD databases, and geographic database systems, has become an overriding concern of database systems research. Extensible (or customizable) database systems are   more...

Collaborative Colleagues:
Ludger Becker: colleagues
Ralf Hartmut Güting: colleagues