The purpose of this paper is to introduce a Generalized-Query-By-Example (GQBE) data manipulation language (DML) that can be built on top of most existing databases (ie., relational, hierarchical, and network). The data manipulation language supports retrieval, insertion, deletion, and update operations and has a formal semantics based on database logic. It is also seen that GQBE can by used as a DML on external views of an integrated database. We also show the advantages of GQBE on heterogeneous databases over Zloof's QBE on relational external views.

A common framework is provided for the investigation of various types of integnty constraints for relaaonal databases.The family of generahzed dependency constraints is introduced.It is shown that this famdy contains as members most of the classes of dependencies studied m the database literature as well as some other classes of database constraints.A charactenzaaon, together with an algorithm, Is provided for determining whether or not a universal statement of first-order logic is a logical consequence of a class in the family.Thts result is shown to be a generalization of former results concerning unphcatmns of dependencies and yields a connection between the resolution method and the chase method as well as a method for constructing Armstrong databases In addition, an alternative version of the theorem ~s described, the preservation of the theorem is discussed m the context of lossless join decomposluons, and the extension of the results to embedded dependencies is elaborated.

Database logic is a proposed framework for database theory which can serve the relational, hierarchical, and network approaches as first-order logic serves the relational approach.In this paper, the first m a series, the key defimuons for database logic are estabhshed, it is demonstrated how the logtc may be used to design a generahzed calculus data mampulauon language for heterogeneous databases, and several of the major properties of database logic are discussed In other papers, the ideas developed here are used to deal with several database issues--external-to-conceptual mapping construction, automatic program conversion, generahzed query languages, and integrated database design and maintenance.

The interconnection between conceptual and external levels of a relational database is made precise in terms of the notion of “interpretation” between first-order languages. This is then used to obtain a methodology for discovering constraints at the external level that are “implied” by constraints at the conceptual level and by conceptual-to-external mappings. It is also seen that these concepts are important in other database issues, namely, automatic program conversion, database design, and compile-time error checking of embedded database languages. Although this the deals exclusively with the relational approach, it also discusses how these ideas can be extended to hierarchical and network databases.

article Free Access Share on A Note on Fuzzy Deduction Authors: Jack Minker Department of Computer Science, University of Maryland, College Park, Maryland Department of Computer Science, University of Maryland, College Park, MarylandView Profile , Alan R. Aronson Department of Computer Science, University of Maryland, College Park, Maryland Department of Computer Science, University of Maryland, College Park, MarylandView Profile , Barry E. Jacobs Department of Computer Science, University of Maryland, College Park, Maryland Department of Computer Science, University of Maryland, College Park, MarylandView Profile Authors Info & Claims Journal of the ACMVolume 27Issue 4Oct. 1980 pp 599–603https://doi.org/10.1145/322217.322218Published:01 October 1980Publication History 9citation453DownloadsMetricsTotal Citations9Total Downloads453Last 12 Months4Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

If one regards an ordinal number as a generalization of a counting number, then it is natural to begin thinking in terms of computations on sets of ordinal numbers. This is precisely what Takeuti [22] had in mind when he initiated the study of recursive functions on ordinals. Kreisel and Sacks [9] too developed an ordinal recursion theory, called metarecursion theory, which specialized to the initial segment of the ordinals bounded by (the first nonconstructive ordinal). The notion of admissibility was introduced by Kripke [11] and Platek [14] and served to generalize metarecursion theory. Kripke called ordinal α admissible if it satisfied certain closure properties of infinitary computations. It was shown that admissibility could be equivalently formulated in terms of the replacement schema of ZF set theory and that α = is an admissible ordinal. The study of a recursion theory on an initial segment of the ordinals bounded by some arbitrary admissible α became known as α-recursion theory. Kripke [10] employed a Gödel numbering scheme to perform an arithmetiza-tion of α -recursion theory and created an analogue to Kleene'sT-predicate (cf. [8]) of ordinary recursion theory (o.r.t.). TheT-predicate then served as the basis for showing that analogues of the major results of unrelativized o.r.t. held in α-recursion theory; namely, the α-Enumeration Theorem, T Theorem, α-Recursion Theorem, and α-Universal Function Theorem.