Einloggen

Thematische Bibliographien / Relational databases / Dissertationen

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Relational databases.

Dissertationen zum Thema „Relational databases“

Autor: Grafiati

Veröffentlicht am 4. Juni 2021

Zuletzt aktualisiert am 25. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Relational databases" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Bielecki, Pavel. "Distributed relational database system of occasionally connected databases." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA378092.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Kitinya, Sylivano Chiluli Nonga. "Relational multimedia databases." Thesis, Durham University, 1987. http://etheses.dur.ac.uk/1242/.

Der volle Inhalt der Quelle

Annotation:

This thesis is concerned with the design and im plementation of a Relational Multimedia Database System, in short RMDBS. RMDBS is designed to efficiently use storage space and manipulate various kinds of data; attribute data, bit-m apped pictures, and program s in binary code. RMDBS is an integrated system which enables the user to manage and control operations on the different forms of data in a user friendly manner. This means that even nonexperienced users can work with the system. The work described in this thesis is novel in that a true multimedia database has been implemented within the

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Alkahtani, Mufleh M. "Modeling relational database management systems." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/865955.

Der volle Inhalt der Quelle

Annotation:

Almost all of the database products developed over the past few years are based on what is called the relational approach.The purpose of this thesis is to characterize a relational data base management system, we do this by studying the relational model in some depth.The relational model is not static, rather it has been evolving over time. We trace the evolution of the relational model. We will also consider the ramifications of the relational model for modern database systems.<br>Department of Computer Science

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Karlapalem, Kamalakar. "Redesign of distributed relational databases." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/9173.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Zavodny, Jakub. "Factorisation in relational databases." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:54c9a3a7-caac-40d9-90fb-83797ced9c5a.

Der volle Inhalt der Quelle

Annotation:

We study representation systems for relational data based on relational algebra expressions with unions, products, and singleton relations. Algebraic factorisation using the distributivity of product over union allows succinct representation of many-to-many relationships; further succinctness is brought by sharing repeated subexpressions. We show that these techniques are especially applicable to results of conjunctive queries. In the first part of the dissertation we derive tight asymptotic size bounds for two flavours of factorised representations of results of conjunctive queries. Any conju

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Sullivan, Larry. "Performance issues in mid-sized relational database machines /." Online version of thesis, 1989. http://hdl.handle.net/1850/10445.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Jermaine, Christopher. "Approximate answering of aggregate queries in relational databases." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/9221.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Chen, Yu 1979. "Data mining relational databases with probabilistic relational models." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=97928.

Der volle Inhalt der Quelle

Annotation:

Relational databases are a popular method for organizing and storing data. Unfortunately, many machine-learning techniques are unable to handle complex relational models. The Probabilistic Relational Model (PRM) is an extension of the Bayesian Network framework that can express relational structure as well as probabilistic dependencies. In this thesis, we significantly expand and improve an implementation of PRMs that allows defining conditional probability distributions over discrete and continuous variables. The thesis uses as starting point an implementation that has various problems, and r

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Henderson, Rebecca Sue. "Technology in action : the design and use of relational databases /." Thesis, Connect to this title online; UW restricted, 1999. http://hdl.handle.net/1773/8880.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Monat, Andre Soares. "Exceptional values in relational databases." Thesis, University of East Anglia, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359326.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

MORELLI, EDUARDO MARIA TERRA. "AUTOMATIC REINDEXING IN RELATIONAL DATABASES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2006. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9531@1.

Der volle Inhalt der Quelle

Annotation:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>Uma dentre as muitas tarefas desempenhadas por DBAs consiste em tentar garantir que os tempos de respostas dos comandos submetidos por usuários a um grande SGBDR não excedam valores previamente acordados. Esta dissertação segue uma linha de estudos denominada auto-sintonia de índices, que preconiza a realização de ajustes automáticos na execução de consultas SQL, visando reduzirlhes tempos de resposta, a partir de alterações no conjunto de índices: criação, eliminação e recriação. Este trabalho teve como ponto de partida a dissertaçã

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Rawlani, Praynaa. "Graph analytics on relational databases." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/100670.

Der volle Inhalt der Quelle

Annotation:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 99-100).<br>Graph analytics has become increasing popular in the recent years. Conventionally, data is stored in relational databases that have been refined over decades, resulting in highly optimized data processing engines. However, the awkwardness of expressing iterative queries in SQL makes the relational query-processing model inadequate for graph analytics, leading to many alternativ

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Maatuk, Abdelsalam. "Migrating relational databases into object-based and XML databases." Thesis, Northumbria University, 2009. http://nrl.northumbria.ac.uk/3374/.

Der volle Inhalt der Quelle

Annotation:

Rapid changes in information technology, the emergence of object-based and WWW applications, and the interest of organisations in securing benefits from new technologies have made information systems re-engineering in general and database migration in particular an active research area. In order to improve the functionality and performance of existing systems, the re-engineering process requires identifying and understanding all of the components of such systems. An underlying database is one of the most important component of information systems. A considerable body of data is stored in relat

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Moatassem, Nawal N. "A Study of Migrating Biological Data from Relational Databases to NoSQL Databases." Youngstown State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1442486094.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Yu, Chaoran. "A study on relational databases through mathematical theories of relations and logic." Virtual Press, 1988. http://liblink.bsu.edu/uhtbin/catkey/539627.

Der volle Inhalt der Quelle

Annotation:

The purpose of this study is to explore that mathematics provides a convenient formalism for studying classical database management system problems. There are two main parts in this study, devoted respectively to using mathematical theory of relations and using logical theory to study database management systems. In the first part we focus on relational model and relational algebra. The second part deals with the application of mathematical logic to database management systems, where logic may be used both as a inference system and as a representation language. The features and logical mechani

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Hansson, Andreas. "Relational Database Web Application : Web administration interface for visualizing and predicting relationships to manage relational databases." Thesis, Mittuniversitetet, Avdelningen för informations- och kommunikationssystem, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-25879.

Der volle Inhalt der Quelle

Annotation:

There is a need of storing and keeping track of things. As the amount of information increases, so does the demand for suitable applications that can manage the data. This thesis has had its focus on developing a web administration interface for relational databases, where the focus has been on managing and visualizing the data, where relationships between data within the database could be predicted through an algorithm. During the thesis, it was revealed that administrators can utilize naming conventions for databases, a property which can be used to predict its relationships. Furthermore, ex

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Aleksic, Mario. "Incremental computation methods in valid and transaction time databases." Thesis, Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/8126.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Hines, Gary L. "From entities to objects : reverse engineering a relational data model into an object-oriented design." Virtual Press, 2000. http://liblink.bsu.edu/uhtbin/catkey/1164846.

Der volle Inhalt der Quelle

Annotation:

In many software applications, an object-oriented design (OOD) is generated first, then persistent storage is implemented by mapping the objects to a relational database. This thesis explores the "reverse engineering" of an OOD out of an existing relational data model. Findings from the current literature are presented, and a case study is undertaken using the model and research process published by GENTECH, a nonprofit organization promoting genealogical computing. The model is mapped into an OOD and captured in Unified Modeling Language (UML) class diagrams and object collaboration diagrams.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Ulibarri, Desirea Duarte. "Volunteer system project Regis University Networking Lab Practicum /." [Denver, Colo.] : Regis University, 2006. http://165.236.235.140/lib/DUlibarriPartI2006.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Ciolek, Thomas S. "Meeting the challenges of met data with MySQL X /." [Denver, Colo.] : Regis University, 2006. http://165.236.235.140/lib/TCiolek2006.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Attar-Bashi, Hussain Ali. "Natural language output from relational databases." Thesis, University of Bradford, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.304029.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Kesztyus, Tibor I., and Klaus P. Kratzer. "Three-dimensional visualization of relational databases." Journal for New Generation Sciences, Vol 2, Issue 1: Central University of Technology, Free State, Bloemfontein, 2004. http://hdl.handle.net/11462/451.

Der volle Inhalt der Quelle

Annotation:

Published Article<br>In recent years, databases have reached unprecedented complexity and volume. A database structure comprising tens of thousands of tables with a staggering number of inter-table relationships to match can hardly be understood and managed by the human mind. This holds in particular, if two-dimensional visualizations of such a structure are used. This paper describes a project to enhance human comprehension by another dimension enabling database users to move among database tables in three dimensions. The project applies techniques of virtual reality enabling users to control

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Herath, H. M. A. C. "Statistical databases within a relational framework." Thesis, Keele University, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.386218.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Clemens, David W. "Relational database design of a shipboard ammunition inventory, requisitioning, and reporting system." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA231559.

Der volle Inhalt der Quelle

Annotation:

Thesis (M.S. in Information Systems)--Naval Postgraduate School, June 1990.<br>Thesis Advisor(s): Kamel, Magdi N. Second Reader: Bhargava, Hemant K. "June 1990." Description based on signature page as viewed on October 19, 2009. Author(s) subject terms: Ammunition, database design, relational database. Includes bibliographical references (p. 163-166). Also available online.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Nagy, Victor. "Performance Analysis of Relational Databases, Object-Oriented Databases and ORM Frameworks." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-9528.

Der volle Inhalt der Quelle

Annotation:

In the planning stage of web and software development, it is important to select the right tool for the job. When selecting the database to use, relational databases like MySQL is a popular choice. However, relational databases suffer by object-relational impedance mismatch. In this work we will explore the response time of relational and object-oriented databases and the overhead of ORM frameworks. This will be done by creating a web application that receives data about flights and airports from a client, which measures the response time of the databases and the entire request. It was found t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Frank, Martin Robert. "Adaptive and automated index selection in relational database systems." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/8170.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Stanier, C. F. "A model integrity based object-relational data model and complex data model definition framework." Thesis, Staffordshire University, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.522119.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Jafer, Yasser. "Aggregation and Privacy in Multi-Relational Databases." Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/22695.

Der volle Inhalt der Quelle

Annotation:

Most existing data mining approaches perform data mining tasks on a single data table. However, increasingly, data repositories such as financial data and medical records, amongst others, are stored in relational databases. The inability of applying traditional data mining techniques directly on such relational database thus poses a serious challenge. To address this issue, a number of researchers convert a relational database into one or more flat files and then apply traditional data mining algorithms. The above-mentioned process of transforming a relational database into one or more flat fi

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Zimanyi, Esteban. "Incomplete and uncertain information in relational databases." Doctoral thesis, Universite Libre de Bruxelles, 1992. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/212914.

Der volle Inhalt der Quelle

Annotation:

<p align="justify">In real life it is very often the case that the available knowledge is imperfect in the sense that it represents multiple possible states of the external world, yet it is unknown which state corresponds to the actual situation of the world. Imperfect knowledge can be of two different categories. Knowledge is incomplete if it represents different states, one of which is true in the external world. On the contrary, knowledge is uncertain if it represents different states which may be satisfied or are likely to be true in the external world.</p><p><p align="justify">Imperfect k

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Ellison, Martyn. "Evaluating cloud migration options for relational databases." Thesis, University of York, 2017. http://etheses.whiterose.ac.uk/20206/.

Der volle Inhalt der Quelle

Annotation:

Migrating the database layer remains a key challenge when moving a software system to a new cloud provider. The database is often very large, poorly documented, and used to store business-critical information. Most cloud providers offer a variety of services for hosting databases and the most suitable choice depends on the database size, workload, performance requirements, cost, and future business plans. Current approaches do not support this decision-making process, leading to errors and inaccurate comparisons between database migration options. The heterogeneity of databases and clouds mean

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

El, Abri Marwa. "Probabilistic relational models learning from graph databases." Thesis, Nantes, 2018. http://www.theses.fr/2018NANT4019/document.

Der volle Inhalt der Quelle

Annotation:

Historiquement, les Modèles Graphiques Probabilistes (PGMs) sont une solution d’apprentissage à partir des données incertaines et plates, appelées aussi données propositionnelles ou représentations attribut-valeur. Au début des années 2000, un grand intérêt a été adressé au traitement des données relationnelles présentant un grand nombre d’objets participant à des différentes relations. Les Modèles Probabilistes Relationnels (PRMs) présentent une extension des PGMs pour le contexte relationnel. Avec l’évolution rapide issue de l’internet, des innovations technologiques et des applications web,

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Nulty, William Glenn. "Geometric searching with spacefilling curves." Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/24520.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Khayundi, Peter. "A comparison of open source object-oriented database products." Thesis, University of Fort Hare, 2009. http://hdl.handle.net/10353/254.

Der volle Inhalt der Quelle

Annotation:

Object oriented databases have been gaining popularity over the years. Their ease of use and the advantages that they offer over relational databases have made them a popular choice amongst database administrators. Their use in previous years was restricted to business and administrative applications, but improvements in technology and the emergence of new, data-intensive applications has led to the increase in the use of object databases. This study investigates four Open Source object-oriented databases on their ability to carry out the standard database operations of storing, querying, upda

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Lau, Ho Lam. "The development of the nested relational sequence model to support XML databases /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20LAU.

Der volle Inhalt der Quelle

Annotation:

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002.<br>Includes bibliographical references (leaves 87-96). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Toprak, Serkan. "Data Mining For Rule Discovery In Relational Databases." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605356/index.pdf.

Der volle Inhalt der Quelle

Annotation:

Data is mostly stored in relational databases today. However, most data mining algorithms are not capable of working on data stored in relational databases directly. Instead they require a preprocessing step for transforming relational data into algorithm specified form. Moreover, several data mining algorithms provide solutions for single relations only. Therefore, valuable hidden knowledge involving multiple relations remains undiscovered. In this thesis, an implementation is developed for discovering multi-relational association rules in relational databases. The implementation is based on

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Lee, Anna. "Transformation of set schema into relational structures." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26431.

Der volle Inhalt der Quelle

Annotation:

This thesis describes a new approach of relational database design using the SET conceptual model. The SET conceptual model is used for information modelling. The database schema generated from the information modelling is called the SET schema. The SET schema consists of the declarations of all the sets of the database schema. A domain graph can be constructed based on the information declared in the SET schema. A domain graph is a directed graph with nodes labelled with declared sets and arcs labelled with degree information. Each are in the domain graph points to a node S from a node labell

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Markowetz, Alexander. "Keyword search over relational data /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20MARKOW.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Hedman, Surlien Peter. "Economic advantages of Blockchain technology VS Relational database : An study focusing on economic advantages with Blockchain technology and relational databases." Thesis, Blekinge Tekniska Högskola, Institutionen för industriell ekonomi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-17366.

Der volle Inhalt der Quelle

Annotation:

Many IT-systems are when created not designed to be flexible and dynamic resulting in old and complex systems hard to maintain. Systems usually build their functionality and capability on the data contained in their databases. The database underlines such system, and when data do not correspond between different and synchronizing systems, it is a troublesome debugging process. This is because systems are complex and the software architecture is not always easy to understand. Due to increasing complexity in systems over time, making systems harder to debug and understand, there is a need for a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Norcio, Sheila Azadeh. "Object-oriented and relational databases : a comparative study of concepts and applications /." Master's thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-01202010-020128/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Krogel, Mark-André. "On propositionalization for knowledge discovery in relational databases." [S.l. : s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=976835835.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

To, Christina. "A form of manipulation system for relational databases." Thesis, University of Ottawa (Canada), 1987. http://hdl.handle.net/10393/5411.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Luo, Yi Computer Science &amp Engineering Faculty of Engineering UNSW. "SPARK: a keyword search system on relational databases." Awarded by:University of New South Wales. Computer Science & Engineering, 2009. http://handle.unsw.edu.au/1959.4/41542.

Der volle Inhalt der Quelle

Annotation:

With the increasing usage of storing textual data into relational databases, there is a demand for the databases to support keyword queries over textual data. Due to the normalization and the inherent connections among tuples in different tables, traditional IR-style ranking and query evaluation methods do not apply. A number of systems have been proposed to deal with this issue. In this thesis, I will give a detailed demonstration and description to our SPARK project. In the project, we study both the effectiveness and the efficiency issues of answering top-k keyword query on a relational dat

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Vista, Dimitra. "Optimizing incremental view maintenance expressions in relational databases." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0015/NQ28310.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Owda, Majdi Sabe. "Conversation-based interfaces to relational databases (C-BIRDS)." Thesis, Manchester Metropolitan University, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.551122.

Der volle Inhalt der Quelle

Annotation:

The development of reliable natural language interfaces to relational databases can accelerate the progress of many areas of applications, such as the need for interactive relational database interfaces for non-technical users. This thesis presents a novel development of C-BIRDs framework. The C-BIRD framework was developed in two phases. The first phase involved the development of a Static Approach-Based C-BIRD framework, which is based on a combination of a Goal-Oriented Conversational Agent (GOCA) and a knowledge tree (KT). GO CAs have proven their capability to disambiguate the user's need

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

BERARDI, RITA CRISTINA GALARRAGA. "DESIGN RATIONALE IN THE TRIPLIFICATION OF RELATIONAL DATABASES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2015. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=27082@1.

Der volle Inhalt der Quelle

Annotation:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>PROGRAMA DE EXCELENCIA ACADEMICA<br>DOUTORADO SANDUÍCHE NO EXTERIOR<br>Uma das estratégias mais populares para publicar dados estruturados na Web é expor bases de dados relacionais (BDR) em formato RDF. Esse processo é chamado BDR-para-RDF ou triplificação. Além disto, princípios de Linked Data oferecem vários guias para dar suporte a este processo. Existem duas principais abordagens para mapear bases de dados rel

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

MEDEIROS, ANTONY SEABRA DE. "PARTITIONING AS A TUNING ACTION FOR RELATIONAL DATABASES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2017. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=30726@1.

Der volle Inhalt der Quelle

Annotation:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>PROGRAMA DE EXCELENCIA ACADEMICA<br>As principais estratégias de sintonia fina utilizadas por administradores de bancos de dados relacionais são a construção de estruturas de acesso, como índices, índices parciais e visões materializadas, e técnicas como desnormalização e reescrita de consultas. Estas técnicas e estruturas de acesso, juntas ou separadas, podem melhorar o desempenho das consultas submetidas ao banco de dados. O particionamento de tabelas do banco de dados, técni

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Picalausa, Francois. "Guarded structural indexes: theory and application to relational RDF databases." Doctoral thesis, Universite Libre de Bruxelles, 2013. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209432.

Der volle Inhalt der Quelle

Annotation:

Ces dernières années ont vu un regain d’intérêt dans l’utilisation de données semi-structurées, grâce à la standardisation de formats d’échange de données sur le Web tels que XML et RDF. On notera en particulier le Linking Open Data Project qui comptait plus de 31 milliard de triplets RDF à la fin de l’année 2011. XML reste, pour sa part, l’un des formats de données privilégié de nombreuses bases de données de grandes tailles dont Uniprot, Open Government Initiative et Penn Treebank. <p><p>Cet accroissement du volume de données semi-structurées a suscité un intérêt croissant pour le développem

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Liu, Jixue. "View maintenance in nested relations and object-relational databases." 2000. http://arrow.unisa.edu.au:8081/1959.8/24993.

Der volle Inhalt der Quelle

Annotation:

A materialized view is a derived data collecton stored in a database. When the source data for a materialized view is updated, the materialized view also needs to be updated. The process of updating a materialized view in response to changes in the source data is called view maintenance. There are two methods for maintaining a materialized view - recomputation and incremental computation. Recomputation computes the new view instance from scratch using the updated sources data. Incremental computation on the other hand, computes the new view instance by using the update to the source data, the

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Fonseca, Guilherme António Duarte. "On Forgetting Relations in Relational Databases." Master's thesis, 2022. http://hdl.handle.net/10362/135417.

Der volle Inhalt der Quelle

Annotation:

Although not usually acknowledged as such, forgetting is a crucial aspect of human reasoning. It allows us to deal with large amounts of information, pushing irrelevant details out of our consciousness so that we can focus on the essential knowledge. Motivated by its beneficial effect on the human brain, this operation has been emulated in many formalisms in the field of Knowledge Representation and Reasoning, where several approaches to forgetting have been proposed. In common, these support computer systems dealing with inaccurate or excessive information without negatively affecting t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Chang, Wei-Yi, and 張葦怡. "Fuzzy Relational Databases." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/42005297366678074217.

Der volle Inhalt der Quelle

Annotation:

碩士<br>元智大學<br>資訊管理研究所<br>92<br>This research discuss about the topic of such application type as fuzzy relation database, fuzzy function dependence, fuzzy multiple-value dependence, and introduction of four kinds of the fuzzy relation database. During the process of database designing, the normalization is getting become as a very important problem on fuzzy relation database. The function of normalization in database can be evaded the happening of distortion and data reoccurrence; data dependence during the normalization with regarding to function dependence, multiple-value function dependence

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!