Abstract
The main conjecture of this contribution is that forthcoming intelligent database systems — in particular future DOOD systems — should be designed in such a way that a major part of the services they provide are implemented using these same services in a bootstrapping-like manner. We call such an approach “reflective”, as is often done by researchers in AI and programming languages. Data dictionaries, being part of any reasonable database system today, exhibit the reflective principle in a nutshell, if they are implemented by means of the same data structures that hold application data. However, even for data dictionaries the reflective implementation is often abandoned for performance reasons. Applying reflection for more advanced and ambitious purposes, up to integrity control or query optimization, is viewed even more skeptically by many, despite the conceptual elegance of the approach. On the other hand, there are a few successful approaches around today that can be interpreted as exhibiting a reflective nature. It is the purpose of this paper to identify such examples and to encourage research to invest more in the reflective style and to look for new solutions to the obstacles still ahead.
This work was supported in part by the Commission of the European Community under ESPRIT project number 6333 (IDEA); however, this paper does not constitute a statement of the IDEA consortium, but represents the author's opinions only
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Anwar, L. Maugis, and S. Chakravarthy: ”A New Perspective on Rule Support for Object-Oriented Databases”, in: Proc. SIGMOD 1993
F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman: ”Magic sets and other strange ways to implement logic programs”, in: Proc. PODS 1986
F. Bancilhon and R. Ramakrishnan: ”An amateur's introduction to recursive query processing strategies”, in: Proc. SIGMOD 1986
R. Bayer: ”Query Evaluation and Recursion in Deductive Database Systems”, Techn. Report TUM-18503, Techn. Univ. Muenchen, Inst. f. Informatik, 1985
F. Bry: ”Query evaluation in recursive databases: bottom-up and top-down reconciled”, Data and Knowledge Engineering, Vol. 5, 1990, (earlier version in Proc. DOOD 1989)
F. Bry and R. Manthey: ”On the magic of updates: a fixpoint approach to updatepropagation in deductive databases”, in preparation
S. Ceri, G. Gottlob, and L. Tanca: ”Logic Programming and Databases”, Springer Verlag, Berlin-Heidelberg-New York, 1990
S. Ceri and J. Widom: ”Deriving Production Rules for Constraint Maintenance”, in: Proc. VLDB 1990
S. Ceri and J. Widom: ”Deriving Production Rules for Incremental View Maintenance”, in: Proc. VLDB 1991
S. Das and M.H. Williams: ”A path finding method for constraint checking in deductive databases”, in: Data and Knowledge Engineering, Vol. 4, 1989
U. Dayal, A. Buchmann, and D. McCarthy: ”Rules Are Objects Too: A Knowledge Model for an Active, Object-Oriented Database System”, in: Proc. 2nd Intern. Workshop on Object-Oriented Database Systems, LNCS 334, 1988
H. Decker: ”Integrity Enforcement on Deductive Databases”, in: 1st Intern. Conf. on Expert Database Systems (EDS), 1986
A. Lefebvre and L. Vieille: ”On Deductive Query Evaluation in the Dedgin* System”, in: Proc. DOOD 1989
J.M. Nicolas and K. Yazdanian: ”An Outline of BDGEN: A Deductive DBMS”, in: Proc. IFIP 1983
O. Diaz, N.W. Paton, and P.M.D. Gray: ”Rule management in object-oriented database systems”, in: Proc. VLDB 1991
R. Ramakrishnan, S. Sudarshan, and D. Srivasta: ”Rule ordering in the bottom-up fixpoint evaluation of logic programs”, in: Proc. VLDB 1990
D. Sacca and C. Zaniolo: ”Magic Counting Methods”, in: Proc. SIGMOD 1987
D. Sacca and C. Zaniolo: ”Differential Fixpoint Methods and Stratification of Logic Programs”, in: Proc. 3rd Intern. Conference on Data and Knowledge Bases, Jerusalem, 1988
S. Sudarshan, D. Srivasta, R. Ramakrishnan, and J. Naughton: ”Space Optimization in the Bottom-Up Evaluation of Logic Programs”, in: Proc. SIGMOD 1991
L. Vieille: ”Recursive axioms in deductive databases: The Query-Subquery approach”, in: Proc. 1st Intern. Conf. on Expert Database Systems (EDS), 1986
L. Vieille, P. Bayer and V. Küchenhoff: ”Integrity Checking and Materialized Views Handling by Update Propagation in the EKS-V1 System”, ECRC Technical Report TR-KB-35, June 1991
J. Widom: ”Deduction in the Starburst Production Rule System”, Research Report RJ 8135, IBM Almaden Research Center, 1991
C. Zaniolo, N. Arni, and K. Ong: ”Negation and Aggregates in Recursive Rules: the LDL++ Approach”, in: Proc. DOOD93
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manthey, R. (1993). Beyond data dictionaries: Towards a reflective architecture of intelligent database systems. In: Ceri, S., Tanaka, K., Tsur, S. (eds) Deductive and Object-Oriented Databases. DOOD 1993. Lecture Notes in Computer Science, vol 760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57530-8_22
Download citation
DOI: https://doi.org/10.1007/3-540-57530-8_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57530-6
Online ISBN: 978-3-540-48212-3
eBook Packages: Springer Book Archive