Abstract
Deductive object-oriented databases advocate the advantage of combining object-oriented and deductive paradigms into a single data model. Certainly, the query language in such a data model has to reflect the amalgamation because it works as the interface to the user and/or application program. This paper proposes a language to formulate queries as classes related to the schema classes and constrained by an associative membership condition. Answers are then regarded as their instances. The interpretation is based on a deductive database view of queries. Generic query classes are introduced with a simple parameter substitution construct. The syntactic separation of structural and associative conditions opens the way to semantic query optimization: subsumption between the structural parts of queries can be decided efficiently.
This work was supported in part by the Commission of the European Communities under ESPRIT Basic Research Action 6810 (Compulog 2) and by the Ministry of Science and Research of Nordrhein-Westfalen.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul, ”Towards a deductive object-oriented database language”, Data & Knowledge Engineering, 5, 1990, pp. 263–287.
H.W. Beck, S.K. Gala, and S.B. Navathe, ”Classification as a query processing technique in the CANDIDE semantic data model”, in Proc. 5th Int. Conf. on Data Engineering, 1989, pp. 572–581.
C. Beeri and R. Ramakrishnan, ”On the power of magic”, in Proc. 6th ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, 1987.
A. Borgida, ”From type systems to knowledge representation: natural semantics specifications for description logics”, Int. Journal of Intelligent and Cooperative Information Systems 1(1), pp. 93–126, 1992.
A. Borgida, R.J. Brachman, D. McGuiness, and L.A. Resnick, ”CLASSIC: A structural data model for Objects”, in Proc. ACM-SIGMOD Int. Conf. on Management of Data, 1989, pp. 58–67.
R.J. Brachman, D.L. McGuinness, P.F. Patel-Schneider, L.A. Resnick, and A. Borgida, ”Living with CLASSIC: When and how to use a KL-ONE-like language”, in Principles of Semantic Networks (Sowa, J.,ed.), Morgan Kaufmann, 1991.
R.J. Brachman and J.G. Schmölze, ”An overview of the KL-ONE knowledge representation system”, Cognitive Science 9(2), pp. 171–216, 1985.
F. Bry, H. Decker, and R. Manthey, ”A uniform approach to constraint satisfaction and constraint satisfiability in deductive databases”, in Int. Conf. on Extending Database Technology, 1988, pp. 488–505.
M. Buchheit, M.A. Jeusfeld, W. Nutt, and M. Staudt, ”Subsumption between queries to object-oriented databases”, appears in Proc. EDBT'94, Cambridge, UK, March 1994.
S. Ceri, G. Gottlob, and L. Tanca, Logic programming and databases, Springer-Verlag, 1990.
F.M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf, ”A hybrid system with datalog and concept languages”, in Trends in Artificial Intelligence, (Ardizzone E., Gaglio S., Sorbello F., eds.), LNAI 549, Springer Verlag, pp. 88–97, 1991.
B. Hollunder, W. Nutt, M. Schmidt-Schauss, ”Subsumption algorithms for concept description languages”, in Proc. 9th European Conf. on Artificial Intelligence, pp. 348–353, 1990.
M. Jarke (ed.), ConceptBase V3.1 user manual, Report Aachener Informatik-Berichte Nr. 92-17, RWTH Aachen, Germany, 1992.
M.A. Jeusfeld, Update control in deductive object bases (in German). Infix-Verlag, St.Augustin, Germany, 1992.
M.A. Jeusfeld and M. Jarke, ”From relational to object-oriented integrity simplification”, in Proc. 2nd Int. Conf. on Deductive and Object-Oriented Databases, LNCS 566, Springer-Verlag, pp. 460–477, 1991.
M.A. Jeusfeld and M. Staudt, ”Query optimization in deductive object bases”, in Query Processing for Advanced Database Applications, (Freytag et al., eds.), Morgan-Kaufmann, 1993.
A.C. Kakas and P. Mancarella, ”Database updates through abduction”, in Proc. 16th Int. Conf. on Very Large Databases, 1990, pp. 650–661.
M. Kifer, W. Kim, Y. Sagiv, ”Querying object-oriented databases”, in Proc. ACM-SIGMOD Int. Conf. on Management of Data, San Diego, Ca., 1992, pp. 393–402.
A. Klemann, Schema integration of relational databases (in German), Diploma thesis, Universität Passau, Germany, 1991.
J. Mylopoulos, A. Borgida, M. Jarke, and M. Koubarakis, ”Telos: a language for representing knowledge about information systems”, in ACM Trans. Information Systems 8(4), pp. 325–362, 1990.
A. Olivé, ”Integrity constraints checking in deductive databases”, in Proc. 17th Int. Conf. on Very Large Databases, 1991, pp. 513–524.
T. Rose, M. Jarke, J. Mylopoulos, ”Organizing software repositories — modeling requirements and implementation experiences”, in Proc. 16th Int. Computer Software & Applications Conf., Chicago, Ill., 1992.
M.H. Scholl, C. Laasch, and M. Tresch, ”Updatable views in object oriented databases”, in Proc. 2nd Int. Conf. on Deductive and Object-Oriented Databases, Munich, Germany, 1991.
M. Staudt, Query representation and evaluation in deductive object bases (in German), Diploma thesis, Universität Passau, Germany, 1990.
M. Staudt, H.W. Nissen, M.A. Jeusfeld, ”Query by class, rule, and concept”, in Applied Intelligence, Special issue on Knowledge Base Management, (Mylopoulos L., ed.), 1993.
G. Steinke, ”Design aspects of access control in a knowledge base system”, in Computers & Security, 10, 7, 1991, pp. 612–625.
L. Vieille, ”Recursive axioms in deductive databases: The query-subquery approach”, In Proc. 1st Int. Conf. on Expert Database Systems, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Staudt, M., Jarke, M., Jeusfeld, M.A., Nissen, H.W. (1993). Query classes. 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_18
Download citation
DOI: https://doi.org/10.1007/3-540-57530-8_18
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