Abstract
Applications of database technology, such as Computer Assisted Design and Computer Assisted Software Engineering, demand expressive and powerful database query languages capable of supporting, for instance, recursive queries [6, 9].
The performance of such query languages on conventional von Neumann architectures is so poor that well understood enhancements such as integrity constraint checking, are often not incorporated so as not to further weaken performance.
The REKURSIV processor [3] has a microprogrammable object-oriented architecture. The microcode level is powerful enough to support recursion. The object store is persistent and much of the overhead of garbage collection is carried out in hardware. An object-oriented language, Lingo, which is similar to Smalltalk is available for the REKURSIV in source form, together with the source for its microcoded instruction set, which is thus extensible.
The paper describes the implementation (in Lingo, on the REKURSIV system) of a recursive query language, DEAL [2], from a formal specification [5].
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
Davie, A.J.T. and Morrison, R. Recursive Descent Compiling, EllisHorwood, 1981.
Deen, S.M. DEAL - a Relational language with Deductions, Functions and Recursion, Data and Knowledge Engineering, Volume 1, 1985.
Harland, D.M. REKURSIV - an Object-oriented architecture, EllisHorwood, 1988.
Goldberg, A. Smalltalk80: the language and its implementation, Addison-Wesley, 1983.
Natanson, L.D., Samson, W.B. and Wakelin, A.W. Object-oriented implementations from a functional specification, in proceedings of Software Quality Workshop, Dundee, 1990.
Sadeghi, R.S. HQL - a Historical Query Language, in proceedings of British National Conference on Databases 6, Cambridge University Press, 1988.
Samson, W.B, Deen, S.M. Wakelin, A.W. and Sadeghi R. Formalising the Relational Algebra — Some specifications, observations, problems and suggestions, presented at Formal Methods Workshop, Teesside Polytechnic (UK), 1987.
Samson, W.B. and Wakelin, A.W. PEARL — a database query language for the integration of data and knowledge bases, Proc. Int. Conf. on AI in industry and government, Hyderabad, India, ed P. Balagurusamy, Macmillan 1989.
Wakelin, A. A database query language for operations on graphical objects. Ph.D thesis, Dundee Institute of Technology, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Computational Mechanics Publications
About this chapter
Cite this chapter
Natanson, L., Samson, W., Wakelin, A. (1991). A Recursive Database Query Language on an Object-Oriented Processor. In: Brebbia, C.A., Peters, A., Howard, D. (eds) Applications of Supercomputers in Engineering II. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3660-0_14
Download citation
DOI: https://doi.org/10.1007/978-94-011-3660-0_14
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-85166-695-9
Online ISBN: 978-94-011-3660-0
eBook Packages: Springer Book Archive