Log in

Relevant bibliographies by topics / Deductive database / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Deductive database.

Dissertations / Theses on the topic 'Deductive database'

Author: Grafiati

Published: 4 June 2021

Last updated: 15 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 43 dissertations / theses for your research on the topic 'Deductive database.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Kong, Qinzheng. "Incomplete information in a deductive database." Thesis, Heriot-Watt University, 1989. http://hdl.handle.net/10399/927.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cao, Hua. "PDDS : a parallel deductive database system." Thesis, University of Ulster, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.294505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Barja, Goni Maria Lusia. "A database programming language for a deductive object-oriented database." Thesis, Heriot-Watt University, 1995. http://hdl.handle.net/10399/1335.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Shao, Jianhua. "A study of parallel deductive database systems." Thesis, University of Ulster, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.302834.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hall, Andrew Brian. "DJ: Bridging Java and Deductive Databases." Thesis, Virginia Tech, 2008. http://hdl.handle.net/10919/33383.

Full text

Abstract:

<p>Modern society is intrinsically dependent on the ability to manage data effectively. While relational databases have been the industry standard for the past quarter century, recent growth in data volumes and complexity requires novel data management solutions. These trends revitalized the interest in deductive databases and highlighted the need for column-oriented data storage. However, programming technologies for enterprise computing were designed for the relational data management model (i.e., row-oriented data storage). Therefore, developers cannot easily incorporate emerging data manag

APA, Harvard, Vancouver, ISO, and other styles

6

Luppnow, Andrew James. "Bottom-up evaluation of HiLog in the context of deductive database systems." Master's thesis, University of Cape Town, 1998. http://hdl.handle.net/11427/9585.

Full text

Abstract:

Bibliography: leaves 127-130.<br>HiLog is a logic-based language which boasts the expressiveness of a higher-order syntax while retaining the simplicity of a first-order semantics. This work examines the suitability of Horn-clause HiLog as a query language for deductive databases by investigating the feasibility of adapting well-established Datalog evaluation algorithms for the evaluation of HiLog programs. Each of the evaluation algorithms examined in the work is formally described and verified in terms of completeness and correctness. Furthermore, a practical HiLog evaluator based on each al

APA, Harvard, Vancouver, ISO, and other styles

7

Nardon, Fabiane Bizinella. "Estudo e construção de um sistema gerenciador de banco de dados dedutivo." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 1996. http://hdl.handle.net/10183/24105.

Full text

Abstract:

Este trabalho apresenta o estudo e a construção de um Sistema Gerenciador de Bancos de Dados Dedutivos. Um Banco de Dados Dedutivo (BDD) é um Banco de Dados que, alem de sua parte tradicional, ou seja, as informações contidas nas relações básicas, que são explicitamente inseridas, possui um conjunto de regras dedutivas que permite derivar novas informações a partir das relações básicas. Neste trabalho, as deficiências da linguagem de consulta Datalog foram identificadas e, com o objetivo de obter uma linguagem que atenda melhor algumas das necessidades de aplicações do mundo real, foram propos

APA, Harvard, Vancouver, ISO, and other styles

8

Yu, Chaoping. "Query optimization for Federated Database Systems: the Cyrano prototype." Thesis, Virginia Tech, 1996. http://hdl.handle.net/10919/44452.

Full text

Abstract:

The purpose of this research is to improve the performance for the query processing of Cyrano, a prototype deductive object-oriented meta model for Federated Database Systems (FDBSs). The hypothesis was that query optimization techniques such as Semi-Naive algorithm and Magic-Sets Rewrite algorithm could be used to improve the performance of Cyrano prototype query processing. Query optimization has not been used for an FDBS with a deductive object-oriented meta model. Most existing FDBS query optimization techniques are for FDBSs with relational meta models. This research involves two major s

APA, Harvard, Vancouver, ISO, and other styles

9

Desouki, Mohammad Saïd. "Aspects actifs et déductifs dans les bases de données et de connaissances : dérivation et maintenance des attributs." Université Joseph Fourier (Grenoble ; 1971-2015), 1997. http://www.theses.fr/1997GRE10275.

Full text

Abstract:

Les regles deductives et les regles actives dans les bases de donnees, ainsi que l'attachement procedural dans les bases de connaissances, representent des modeles de derivations differents. Le calcul des attributs derives est exprime differemment par les langages de ces modeles. La mise en place des valeurs des attributs derives et la maintenance de ces valeurs sont peu abordees dans ces modeles. Dans une premiere partie, nous montrons plusieurs exemples de systemes dans differents domaines en analysant les incovenients des differentes approches. Dans une deuxieme partie, nous montrons les as

APA, Harvard, Vancouver, ISO, and other styles

10

Sripada, Suryanarayana Murthy. "Temporal reasoning in deductive databases." Thesis, Imperial College London, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387841.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Kesim, Fehime Nihan. "Temporal objects in deductive databases." Thesis, Imperial College London, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.321884.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Das, Subrata Kumar. "Integrity constraints in deductive databases." Thesis, Heriot-Watt University, 1990. http://hdl.handle.net/10399/875.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Böhlen, Michael. "Managing temporal knowledge in deductive databases /." [S.l.] : [s.n.], 1994. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=10802.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Herre, Heinrich, and Gerd Wagner. "Stable Semantics of Temporal Deductive Databases." Universität Leipzig, 1996. https://ul.qucosa.de/id/qucosa%3A34503.

Full text

Abstract:

We define a preferential semantics based on stable generated models for a very general class of temporal deductive databases. We allow two kinds of temporal information to be represented and queried: timepoint and timestamp formulas, and show how each of them can be translated into the other. Because of their generality, our formalism and our semantics can serve as a basis for comparing and extending other temporal deductive database frameworks.

APA, Harvard, Vancouver, ISO, and other styles

15

Wang, Xuegang. "Negation in logic and deductive databases." Thesis, University of Leeds, 2000. http://etheses.whiterose.ac.uk/1292/.

Full text

Abstract:

This thesis studies negation in logic and deductive databases. Among other things, two kinds of negation are discussed in detail: strong negation and nonmonotonic negation. In the logic part, we have constructed a first-order logic CF 0 of strong negation with bounded quantifiers. The logic is based on constructive logics, in particular, Thomason's logic CF. However, unlike constructive logic, quantifiers in our system as in Thomason's are static rather than dynamic. For the logic CF 0 , the usual Kripke formal semantics is defined but based on situations instead of conventional possible world

APA, Harvard, Vancouver, ISO, and other styles

16

Obimbo, Charlie F. "Access clause trees in disjunctive deductive databases." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq62176.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Xu, Lihui. "On the integration of heterogeneous deductive databases." Thesis, King's College London (University of London), 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.321953.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Seipel, Dietmar. "Practical Applications of Extended Deductive Databases in DATALOG*." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4145/.

Full text

Abstract:

A wide range of additional forward chaining applications could be realized with deductive databases, if their rule formalism, their immediate consequence operator, and their fixpoint iteration process would be more flexible. Deductive databases normally represent knowledge using stratified Datalog programs with default negation. But many practical applications of forward chaining require an extensible set of user–defined built–in predicates. Moreover, they often need function symbols for building complex data structures, and the stratified fixpoint iteration has to be extended by aggregation o

APA, Harvard, Vancouver, ISO, and other styles

19

Brass, Stefan. "Bottom-up query evaluation in extended deductive databases." [S.l. : s.n.], 1996. http://deposit.ddb.de/cgi-bin/dokserv?idn=954338324.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Antunes, Fernandes Alvaro Adolfo. "An axiomatic approach to deductive object-oriented databases." Thesis, Heriot-Watt University, 1995. http://hdl.handle.net/10399/773.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Roncancio, Claudia Lucia. "Règles actives et règles déductives dans les bases de données à objets." Université Joseph Fourier (Grenoble), 1994. http://www.theses.fr/1994GRE10240.

Full text

Abstract:

L'objectif de cette thèse est l'enrichissement d'un système de gestion de bases de données à objets (SGBDO) par l'intégration de certaines fonctions typiquement remplies par des langages de règles. Plus précisément, nous nous sommes intéressés à l'intégration de règles actives dans un système à objets, afin de lui conférer la capacité de réagir à des situations particulières. Nous avons travaillé cet aspect en profondeur et nous proposons un modèle de règles actives qui tient pleinement compte des spécificités du contexte objet. Nous avons étudié l'approche langage de programmation pour base d

APA, Harvard, Vancouver, ISO, and other styles

22

Shiri-Varnaamkhaasti, Nematollaah. "Towards a generalized theory of deductive databases with uncertainty." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0005/NQ39795.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Uno, Yushi. "Studies on the Optimization of Query Processing in Deductive Databases." Kyoto University, 1995. http://hdl.handle.net/2433/160760.

Full text

Abstract:

本文データは平成22年度国立国会図書館の学位論文(博士)のデジタル化実施により作成された画像ファイルを基にpdf変換したものである<br>Kyoto University (京都大学)<br>0048<br>新制・課程博士<br>博士(工学)<br>甲第6018号<br>工博第1415号<br>新制||工||984(附属図書館)<br>UT51-95-D337<br>京都大学大学院工学研究科応用システム科学専攻<br>(主査)教授長谷川利治, 教授茨木俊秀, 教授上林彌彦<br>学位規則第4条第1項該当

APA, Harvard, Vancouver, ISO, and other styles

24

Abdelmoty, El-Hetw Alia Ibrahim. "Modelling and reasoning in spatial databases : a deductive object-oriented approach." Thesis, Heriot-Watt University, 1995. http://hdl.handle.net/10399/615.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

CanÌƒabate, Estrella Pulido. "Recursive query processing in deductive databases using graph traversal and rule compilation techniques." Thesis, University of Bristol, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.319084.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Ben, Mohamed Khalil. "Traitement de requêtes conjonctives avec négation : algorithmes et expérimentations." Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2010. http://tel.archives-ouvertes.fr/tel-00563217.

Full text

Abstract:

Dans cette thèse, nous nous intéressons à des problèmes à la croisée de deux domaines, les bases de données et les bases de connaissances. Nous considérons deux problèmes équivalents concernant les requêtes conjonctives avec négation : l'inclusion de requêtes et l'évaluation d'une requête booléenne sous l'hypothèse du monde ouvert. Nous reformulons ces problèmes sous la forme d'un problème de déduction dans un fragment de la logique du premier ordre. Puis nous raffinons des schémas d'algorithmes déjà existants et proposons de nouveaux algorithmes. Pour les étudier et les comparer expérimentale

APA, Harvard, Vancouver, ISO, and other styles

27

Jacquemard, Florent. "Modèles d'automates d'arbres étendus pour la vérification de systèmes infinis." Habilitation à diriger des recherches, École normale supérieure de Cachan - ENS Cachan, 2011. http://tel.archives-ouvertes.fr/tel-00643595.

Full text

Abstract:

Ce document présente l'étude de plusieurs modèles de machines à états finis qui étendent tous le même formalisme: les automates d'arbres classiques, et leur application dans différentes tâches telles que l'analyse statique de programmes ou de systèmes, la typage, la vérification de la cohérence de spécifications, le model checking... Les arbres sont une structure naturelle de données, très répandue en informatique, par exemple pour la représentation des structures de données hiérarchiques ou imbriquées, pour des algorithmes spécifiques (arbres binaires de recherche, algorithmes distribués), co

APA, Harvard, Vancouver, ISO, and other styles

28

"An object-oriented database model for deductive querying." Tulane University, 1993.

Find full text

Abstract:

Object Oriented Databases (OODBs) are coming of age. This is, in part, due to the modeling capabilities inherent in the object oriented paradigm. Yet, the OODBs are said to fall short of the ideal solution for a next generation database for two reasons. OODBs are not designed to handle logical inferences and they lack the ability to incorporate correctness proofs. These shortcomings are the chief advantages of Deductive Databases (DDBs). DDBs, while lacking much of the flexibility of OODBs, are based upon logic programming research and have a sound basis in proof theory. Therefore, adding the

APA, Harvard, Vancouver, ISO, and other styles

29

Chiang, Wen Tei, and 蔣文得. "The Strategies of Integrity Constraint on Deductive database." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/51710240430429914311.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>工程技術研究所<br>83<br>An operation algorithm of semantic update optimization for keeping he integrity in deductive databases is what this hesis all about. In order to promote the efficiency of the database updating, we combine the integrity constraints together with the deductive rules by using emantic analysis, so that the integrity checking an be moved ahead to the time of deducing mplication facts instead of just before the commitment time in the traditional database. an Aug

APA, Harvard, Vancouver, ISO, and other styles

30

Lin, Fang. "A design document for the CORAL deductive database system." Thesis, 2004. http://spectrum.library.concordia.ca/7896/1/MQ91068.pdf.

Full text

Abstract:

CORAL is a deductive database system that supports a rich declarative language, and an interface to C++ that allows for a combination of declarative and imperative programming. It is important to know the design and the implementation for CORAL in order to be able to extend this system. This report documents the design for CORAL. The Unified Modeling Language (UML) is used to describe the Architecture, Structural Model and Behavioral Model. The design documentation is based on the study of the source code, the user manual and the published papers about CORAL.

APA, Harvard, Vancouver, ISO, and other styles

31

Yim, Chi Hang. "Toward an efficient query processor for a deductive database system." Thesis, 1991. http://spectrum.library.concordia.ca/5435/1/MM64720.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Srivastava, Divesh. "Representing and querying complex information in the coral deductive database system." 1993. http://catalog.hathitrust.org/api/volumes/oclc/31040426.html.

Full text

Abstract:

Thesis (Ph. D.)--University of Wisconsin--Madison, 1993.<br>Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 213-226).

APA, Harvard, Vancouver, ISO, and other styles

33

Wagner, Gerd. "A logical reconstruction of fuzzy inference in databases and logic programs." 1997. https://ul.qucosa.de/id/qucosa%3A31962.

Full text

Abstract:

We propose to replace Zadeh's DeMorgan-type negation in fuzzy logic by a Heyting-type negation which, unlike the former, preserves the law of the excluded contradiction and is more in line with negation in databases and logic programs. We show that the resulting system can be used for obtaining conservative extensions of relational and deductive databases (resp. normal logic programs).

APA, Harvard, Vancouver, ISO, and other styles

34

"Disjunctive deductive databases." Chinese University of Hong Kong, 1996. http://library.cuhk.edu.hk/record=b5888777.

Full text

Abstract:

by Hwang Hoi Yee Cothan.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 1996.<br>Includes bibliographical references (leaves 68-70).<br>Abstract --- p.ii<br>Acknowledgement --- p.iii<br>Chapter 1 --- Introduction --- p.1<br>Chapter 1.1 --- Objectives of the Thesis --- p.1<br>Chapter 1.2 --- Overview of the Thesis --- p.7<br>Chapter 2 --- Background and Related Work --- p.8<br>Chapter 2.1 --- Deductive Databases --- p.8<br>Chapter 2.2 --- Disjunctive Deductive Databases --- p.10<br>Chapter 2.3 --- Model tree for disjunctive deductive databases --- p.11<br>Chapter 3 --- Prelimina

APA, Harvard, Vancouver, ISO, and other styles

35

WANG, JIN-BAO, and 王金寶. "Negation in non-HORN deductive databases." Thesis, 1989. http://ndltd.ncl.edu.tw/handle/85224841998420947776.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Sudarshan, Sundararajarao. "Optimizing bottom-up query evaluation for deductive databases." 1992. http://catalog.hathitrust.org/api/volumes/oclc/28693366.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Jamil, Hasan M. "Semantics of behavioral inheritance in deductive object-oriented databases." Thesis, 1996. http://spectrum.library.concordia.ca/4188/1/NN18404.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Zheng, Zhi Hong. "On efficient fixpoint computation of deductive databases with uncertainty." Thesis, 2004. http://spectrum.library.concordia.ca/8114/1/MQ94763.pdf.

Full text

Abstract:

Uncertainty management has been identified as an important challenge in AI and database research. Many frameworks of logic programming have been proposed to manage uncertain information in deductive databases and expert systems. These proposals address fundamental issues of modeling, semantics, query processing and optimization. However, there have been fewer reports on efficient implementation of such frameworks. In this research, we study this issue in the context of a fragment of the parametric framework [19] over the certainty domain of [0, 1]. It has been shown that the standard Semi-Naiv

APA, Harvard, Vancouver, ISO, and other styles

39

Qiong, Huang. "Extending magic sets techniques to deductive databases with uncertainty." Thesis, 2008. http://spectrum.library.concordia.ca/975919/1/MR45486.pdf.

Full text

Abstract:

With the magic sets techniques having been proposed to improve the efficiency of bottom-up evaluations of Datalog programs by taking advantage of goal structure, we extend these techniques to deductive databases with uncertainty in the context of the parametric framework (PF). In our endeavor, we develop the generalized magic sets and generalized supplementary magic sets techniques, and establish their correctness. We have implemented the proposed techniques and have conducted numerous experiments for the assessment of the evaluation performance. Our experiment results reveal that different pr

APA, Harvard, Vancouver, ISO, and other styles

40

Nonen, Daniel A. "Temporal deductive databases : query finiteness and a query language." Thesis, 1993. http://spectrum.library.concordia.ca/4398/1/MM90921.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Ashraf, Karima. "Recursive query optimization in deductive databases via proof-tree transformations." Thesis, 1996. http://spectrum.library.concordia.ca/4086/1/MM10819.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Braß, Stefan [Verfasser]. "Bottom-up query evaluation in extended deductive databases / von Stefan Brass." 1996. http://d-nb.info/954338324/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Lai, Jinzan. "Query processing and optimization in deductive databasses with certainty constraints." Thesis, 2009. http://spectrum.library.concordia.ca/976317/1/MR63321.pdf.

Full text

Abstract:

Uncertainty reasoning has been identified as an important and challenging issue in the database research presented in the Lowell report [ea05]. Many logic frameworks have been proposed to represent and reason about uncertainty in deductive databases. Based on the way in which uncertainties are associated with the facts and rules in programs, these frameworks have been classified into: "annotation based" (AB) and "implication based" (IB). [Shi05] has investigated the relative expressive powers of AB and IB frameworks and has introduced the notion of certainty constraints, which makes them equiv

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!