Log in

Relevant bibliographies by topics / Database model / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Database model.

Dissertations / Theses on the topic 'Database model'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Database model.'

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

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Rogers, Brandon Lamar. "A Statistical Performance Model of Homogeneous Raidb Clusters." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd709.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Britts, Wademar. "Select Database (SeDB) : A Database Selection Process Model." Thesis, Uppsala universitet, Institutionen för informatik och media, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-263107.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Zawis, John A., and David K. Hsiao. "Accessing hierarchical databases via SQL transactions in a multi-model database system." Thesis, Monterey, California. Naval Postgraduate School, 1987. http://hdl.handle.net/10945/22186.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Walpole, Dennis A., and Alphonso L. Woods. "Accessing network databases via SQL transactions in a multi-model database system." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/25647.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Baxter, Ockert Cornelius. "Physical database design applied in the relational database model / O.C. Baxter." Thesis, North-West University, 2003. http://hdl.handle.net/10394/839.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

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.

Full text

Abstract:

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. The suitability of the example OOD is evaluated against the GENTECH research process using UML use cases and sequence diagrams. The mapping of relational database designs into OODs is found to be suitable in certain instances.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

8

Kong, Yibing. "Security and privacy model for association databases." Access electronically, 2003. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20031126.142250/index.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mendoza, Jayo Rubén G., Carlos Raymundo, Francisco Domínguez Mateos, and Rodríguez José María Alvarez. "Convergence model for the migration of a relational database to a NoSQL database." International Institute of Informatics and Systemics, IIIS, 2017. http://hdl.handle.net/10757/656362.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Morgan, Jac F. "The design of a small business database using the Semantic Database Model." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9867.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Lodico, Marc Richard. "SQLSDM : a SQL front-end semantic data model /." Online version of thesis, 1989. http://hdl.handle.net/1850/10620.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Vlk, Jan. "Návrh relační databáze pro obecní knihovnu." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2020. http://www.nusl.cz/ntk/nusl-417702.

Full text

Abstract:

This diploma thesis focuses on problematics associated with design of relational database. It is divided into several parts where it deals with theoretical basis, analyses of current state and the design of own solution.

APA, Harvard, Vancouver, ISO, and other styles

13

Beyers, Hector Quintus. "Database forensics : Investigating compromised database management systems." Diss., University of Pretoria, 2013. http://hdl.handle.net/2263/41016.

Full text

Abstract:

The use of databases has become an integral part of modern human life. Often the data contained within databases has substantial value to enterprises and individuals. As databases become a greater part of people’s daily lives, it becomes increasingly interlinked with human behaviour. Negative aspects of this behaviour might include criminal activity, negligence and malicious intent. In these scenarios a forensic investigation is required to collect evidence to determine what happened on a crime scene and who is responsible for the crime. A large amount of the research that is available focuses on digital forensics, database security and databases in general but little research exists on database forensics as such. It is difficult for a forensic investigator to conduct an investigation on a DBMS due to limited information on the subject and an absence of a standard approach to follow during a forensic investigation. Investigators therefore have to reference disparate sources of information on the topic of database forensics in order to compile a self-invented approach to investigating a database. A subsequent effect of this lack of research is that compromised DBMSs (DBMSs that have been attacked and so behave abnormally) are not considered or understood in the database forensics field. The concept of compromised DBMSs was illustrated in an article by Olivier who suggested that the ANSI/SPARC model can be used to assist in a forensic investigation on a compromised DBMS. Based on the ANSI/SPARC model, the DBMS was divided into four layers known as the data model, data dictionary, application schema and application data. The extensional nature of the first three layers can influence the application data layer and ultimately manipulate the results produced on the application data layer. Thus, it becomes problematic to conduct a forensic investigation on a DBMS if the integrity of the extensional layers is in question and hence the results on the application data layer cannot be trusted. In order to recover the integrity of a layer of the DBMS a clean layer (newly installed layer) could be used but clean layers are not easy or always possible to configure on a DBMS depending on the forensic scenario. Therefore a combination of clean and existing layers can be used to do a forensic investigation on a DBMS. PROBLEM STATEMENT The problem to be addressed is how to construct the appropriate combination of clean and existing layers for a forensic investigation on a compromised DBMS, and ensure the integrity of the forensic results. APPROACH The study divides the relational DBMS into four abstract layers, illustrates how the layers can be prepared to be either in a found or clean forensic state, and experimentally combines the prepared layers of the DBMS according to the forensic scenario. The study commences with background on the subjects of databases, digital forensics and database forensics respectively to give the reader an overview of the literature that already exists in these relevant fields. The study then discusses the four abstract layers of the DBMS and explains how the layers could influence one another. The clean and found environments are introduced due to the fact that the DBMS is different to technologies where digital forensics has already been researched. The study then discusses each of the extensional abstract layers individually, and how and why an abstract layer can be converted to a clean or found state. A discussion of each extensional layer is required to understand how unique each layer of the DBMS is and how these layers could be combined in a way that enables a forensic investigator to conduct a forensic investigation on a compromised DBMS. It is illustrated that each layer is unique and could be corrupted in various ways. Therefore, each layer must be studied individually in a forensic context before all four layers are considered collectively. A forensic study is conducted on each abstract layer of the DBMS that has the potential to influence other layers to deliver incorrect results. Ultimately, the DBMS will be used as a forensic tool to extract evidence from its own encrypted data and data structures. Therefore, the last chapter shall illustrate how a forensic investigator can prepare a trustworthy forensic environment where a forensic investigation could be conducted on an entire PostgreSQL DBMS by constructing a combination of the appropriate forensic states of the abstract layers. RESULTS The result of this study yields an empirically demonstrated approach on how to deal with a compromised DBMS during a forensic investigation by making use of a combination of various states of abstract layers in the DBMS. Approaches are suggested on how to deal with a forensic query on the data model, data dictionary and application schema layer of the DBMS. A forensic process is suggested on how to prepare the DBMS to extract evidence from the DBMS. Another function of this study is that it advises forensic investigators to consider alternative possibilities on how the DBMS could be attacked. These alternatives might not have been considered during investigations on DBMSs to date. Our methods have been tested at hand of a practical example and have delivered promising results.
Dissertation (MEng)--University of Pretoria, 2013.
gm2014
Electrical, Electronic and Computer Engineering
unrestricted

APA, Harvard, Vancouver, ISO, and other styles

14

Garani, Georgia. "A temporal database model using nested relations." Thesis, Birkbeck (University of London), 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.409697.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Rauxloh, Peter David. "A relational database model of archaeologcial stratigraphy." Thesis, University College London (University of London), 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.243781.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Reblitz-Richardson, Orion Aubrey 1976. "Architecture for biological model and database networking." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86495.

Full text

Abstract:

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
Includes bibliographical references (leaves 73-75).
by Orion Aubrey Reblitz-Richardson.
S.B.and M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

17

Meira, Jorge Augusto. "Model-based stress testing for database systems." reponame:Repositório Institucional da UFPR, 2014. http://hdl.handle.net/1884/37344.

Full text

Abstract:

Orientador : Prof. Dr. Eduardo Cunha de Almeida
Co-orientador : Prof. Dr. Yves Le Traon
Tese (doutorado) - Universidade Federal do Paraná, Setor de Tecnologia, Programa de Pós-Graduação em Ciências da Computação. Defesa: Curitiba, 17/12/2014
Inclui referências
Abstract: Database Management Systems (DBMS) have been successful at processing transaction workloads over decades. But contemporary systems, including Cloud computing, Internet-based systems, and sensors (i.e., Internet of Things (IoT)), are challenging the architecture of the DBMS with burgeoning transaction workloads. The direct consequence is that the development agenda of the DBMS is now heavily concerned with meeting non-functional requirements, such as performance, robustness and scalability [85]. Otherwise, any stressing workload will make the DBMS lose control of simple functional requirements, such as responding to a transaction request [62]. While traditional DBMS, including DB2, Oracle, and PostgreSQL, require embedding new features to meet non-functional requirements, the contemporary DBMS called as NewSQL [56, 98, 65] present a completely new architecture. What is still lacking in the development agenda is a proper testing approach coupled with burgeoning transaction workloads for validating the DBMS with nonfunctional requirements in mind. The typical non-functional validation is carried out by performance benchmarks. However, they focus on metrics comparison instead of finding defects. In this thesis, we address this lack by presenting different contributions for the domain of DBMS stress testing. These contributions fit different testing objectives to challenge each specific architecture of traditional and contemporary DBMS. For instance, testing the earlier DBMS (e.g., DB2, Oracle) requires incremental performance tuning (i.e., from simple setup to complex one), while testing the latter DBMS (e.g., VoltDB, NuoDB) requires driving it into different performance states due to its self-tuning capabilities [85]. Overall, this thesis makes the following contributions: 1) Stress TEsting Methodology (STEM): A methodology to capture performance degradation and expose system defects in the internal code due to the combination of a stress workload and mistuning; 2) Model-based approach for Database Stress Testing (MoDaST): An approach to test NewSQL database systems. Supported by a Database State Machine (DSM), MoDaST infers internal states of the database based on performance observations under different workload levels; 3) Under Pressure Benchmark (UPB): A benchmark to assess the impact of availability mechanisms in NewSQL database systems. We validate our contributions with several popular DBMS. Among the outcomes, we highlight that our methodologies succeed in driving the DBMS up to stress state conditions and expose several related defects, including a new major defect in a popular NewSQL.
Resumo: Sistemas de Gerenciamento de Bando de Dados (SGBD) têm sido bem sucedidos no processamento de cargas de trabalho transacionais ao longo de décadas. No entanto, sistemas atuais, incluindo Cloud computing, sistemas baseados na Internet, e os sensores (ou seja, Internet of Things (IoT)), estão desafiando a arquitetura dos SGBD com crescentes cargas de trabalho. A conseqüência direta é que a agenda de desenvolvimento de SGBD está agora fortemente preocupada em atender requisitos não funcionais, tais como desempenho, robustez e escalabilidade [85]. Caso contrário, uma simples carga de trabalho de estresse pode fazer com que os SGBD não atendam requisitos funcionais simples, como responder a um pedido de transação [62]. Enquanto SGBD tradicionais exigem a incorporação de novos recursos para atender tais requisitos não-funcionais, os SGBD contemporâneos conhecidos como NewSQL [56, 98, 65] apresentam uma arquitetura completamente nova. O que ainda falta na agenda do desenvolvimento é uma abordagem de teste adequada que leve em conta requisitos não-funcionais. A validação não-funcional típica para SGBD é realizada por benchmarks. No entanto, eles se concentram na comparação baseada em métricas em vez de encontrar defeitos. Nesta tese, abordamos essa deficiência na agenda de desenvolvimento, apresentando contribuições diferentes para o domínio de testes de estresse para SGBD. Estas contribuições atendem diferentes objetivos de teste que desafiam arquiteturas específica de SGBD tradicionais e contemporâneos. No geral, esta tese faz as seguintes contribuições: 1) Stress TEstingMethodology (STEM): Uma metodologia para capturar a degradação do desempenho e expor os defeitos do sistema no código interno devido a combinação de uma carga de trabalho de estresse e problemas de configuração; 2) Model-based Database Stress Testing (MoDaST): Uma abordagem para testar sistemas de banco de dados NewSQL. Apoiado por uma máquina de estado de banco de dados (DSM), MoDaST infere estados internos do banco de dados com base em observações de desempenho sob diferentes níveis de carga de trabalho; 3) Under Pressure Benchmark (UPB): Um benchmark para avaliar o impacto dos mecanismos de disponibilidade em sistemas de banco de dados NewSQL. Nós validamos nossas contribuições com vários SGBD populares. Entre os resultados, destaca-se em nossas metodologias o sucesso em conduzir o SGBD para condições de estresse e expor defeitos relacionados, incluindo um novo major bug em um SGBD NewSQL popular.

APA, Harvard, Vancouver, ISO, and other styles

18

Xie, Linchi. "The design of semantic database model SDBM." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26113.

Full text

Abstract:

This thesis is mainly concerned with semantic data modelling related to database design. The domain of this research is restricted to general data modelling and the discussion is carried out at the conceptual level. The thesis assesses a number of serious modelling shortcomings of the conventional data models and reviews several basic principles and mechanisms developed in current semantic data modelling research. Based on these findings, the thesis identifies the inadequacy of the conceptualization of data modelling and develops the two-view conceptualization of data modelling. The basic idea behind the two-view conceptualization is that the conceptual structure of the applications being modelled should be separated from its external data representation. A new semantic database model, SDBM, is designed based on the conceptualization. The model makes a clear separation between the conceptual structure and its external data representation. It offers a data type mechanism to deal with the data representation, a window mechanism to model the conceptual structure, and a transaction mechanism to provide database operations. One of the major extensions of the current semantic data models is that with SDBM the specialization relationship is just a special case of constraints that can be specified among SDBM windows. A formal syntax and informal semantics of SDBM are given in the thesis along with comparisons between SDBM and a closely-related semantic data model, Taxis.
Business, Sauder School of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

19

Pouyioutas, Philippos. "Formalising the extended object-oriented database model." Thesis, Birkbeck (University of London), 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362465.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Gibson, Mark G. "The need for object-oriented systems to extend or replace the relational database model to solve performance problems." Virtual Press, 1992. http://liblink.bsu.edu/uhtbin/catkey/834637.

Full text

Abstract:

The relational model has dominated the database field because of its reduced application development time and non-procedural data manipulation features. It has significant problems, however, including weak integrity constraints. This paper discusses the need for object oriented techniques to improve on these flaws. Three existing DBMS will be discussed: IRIS, ORION, and OZ.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

21

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

22

Kim, Pilho. "E-model event-based graph data model theory and implementation /." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29608.

Full text

Abstract:

Thesis (Ph.D)--Electrical and Computer Engineering, Georgia Institute of Technology, 2010.
Committee Chair: Madisetti, Vijay; Committee Member: Jayant, Nikil; Committee Member: Lee, Chin-Hui; Committee Member: Ramachandran, Umakishore; Committee Member: Yalamanchili, Sudhakar. Part of the SMARTech Electronic Thesis and Dissertation Collection.

APA, Harvard, Vancouver, ISO, and other styles

23

Shin, Dongil. "A Unifying Version Model for Objects and Schema in Object-Oriented Database System." Thesis, University of North Texas, 1997. https://digital.library.unt.edu/ark:/67531/metadc279222/.

Full text

Abstract:

There have been a number of different versioning models proposed. The research in this area can be divided into two categories: object versioning and schema versioning. In this dissertation, both problem domains are considered as a single unit. This dissertation describes a unifying version model (UVM) for maintaining changes to both objects and schema. UVM handles schema versioning operations by using object versioning techniques. The result is that the UVM allows the OODBMS to be much smaller than previous systems. Also, programmers need know only one set of versioning operations; thus, reducing the learning time by half. This dissertation shows that UVM is a simple but semantically sound and powerful version model for both objects and schema.

APA, Harvard, Vancouver, ISO, and other styles

24

Watanabe, Toyohide, Yuusuke Uehara, Yuuji Yoshida, and Teruo Fukumura. "A semantic data model for intellectual database access." IEEE, 1990. http://hdl.handle.net/2237/6923.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Pryor, Jacqueline. "Earthwork maintenance : a geotechnical database and predictive model." Thesis, Cardiff University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.266614.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Dzikiewicz, Joseph. "Cyrano : a meta model for federated database systems /." Diss., This resource online, 1996. http://scholar.lib.vt.edu/theses/available/etd-11082006-133632/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Kunishima, Takeo. "Studies on Flexible Workflow Model with Database Technologies." Kyoto University, 1997. http://hdl.handle.net/2433/160828.

Full text

Abstract:

本文データは平成22年度国立国会図書館の学位論文(博士)のデジタル化実施により作成された画像ファイルを基にpdf変換したものである
Kyoto University (京都大学)
0048
新制・課程博士
博士(工学)
甲第6874号
工博第1625号
新制||工||1069(附属図書館)
UT51-97-H258
京都大学大学院工学研究科情報工学専攻
(主査)教授上林彌彦, 教授矢島脩三, 教授石田亨
学位規則第4条第1項該当

APA, Harvard, Vancouver, ISO, and other styles

28

Brown, Simon Ambrose. "The semantics of database query languages." Thesis, University of Sheffield, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.310781.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Anastasopoulos, Achilles. "Cross model access in the multi-lingual, multi-model database management system." Thesis, Monterey, California. Naval Postgraduate School, 1997. http://hdl.handle.net/10945/8178.

Full text

Abstract:

Approved for public release; distribution is unlimited
Relational, hierarchical, network, functional, and object oriented databases support its corresponding query language, SQL, DL/I, CODASYL-DML, DAPLEX, and OO-DML, respectively. However, each database type may be accessed only by its own language. The goal of M2DBMS is to provide a heterogeneous environment in which any supported database is accessible by any supported query language. This is known as cross model access capability. In this thesis, relational to object oriented database cross model access is successfully implemented for a test database. Data from the object oriented database EWIROODB is accessed and retrieved, using an SQL query from the relational database EWIROODB. One problem is that the two interfaces (object oriented and relational) create catalog files with different formation, which makes the cross model access impossible, initially. In this thesis the relational created catalog file is used, and the cross model access capability is achieved. The object oriented catalog file must be identical with the relational one. Therefore, work yet to be done is to write a program that automatically reformats the object oriented catalog file into an equivalent relational catalog file

APA, Harvard, Vancouver, ISO, and other styles

30

Chandrasekaran, Arunkumar. "Building and Implementing an Inventory Database Model using Microsoft Access Database and C♯ Programming Language." Cincinnati, Ohio : University of Cincinnati, 2005. http://www.ohiolink.edu/etd/view.cgi?acc%5Fnum=ucin1131657662.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Monjaras, Alvaro, Enrique Bcndezu, and Carlos Raymundo. "Decision Tree Model to Support the Successful Selection of a Database Engine for Novice Database Administrators." Institute of Electrical and Electronics Engineers Inc, 2019. http://hdl.handle.net/10757/656346.

Full text

Abstract:

El texto completo de este trabajo no está disponible en el Repositorio Académico UPC por restricciones de la casa editorial donde ha sido publicado.
There are currently several types of databases that have different ways of manipulating data that affects the performance of transactions when dealing with the information stored. And it is very important for companies to manage information fast, so they do not lose any operation because of a bad performance of a database, in the same way, they need to operate fast while keeping the integrity of the information. Likewise, every database category's purpose is to serve a specific or specifics use cases to perform fast to manage the information when needed, so in this paper, we study and analyze the SQL, NoSQL and In Memory databases to understand their fit uses cases and make performance tests to build a decision tree that can help to take the decision to choose what database category to use to maintain a good performance. The precision of the tests of relational databases was 96.26% in NoSQL databases was 91.83% and finally in IMDBS was 93.87%.

APA, Harvard, Vancouver, ISO, and other styles

32

Shunmugam, Tamindran. "Adoption of a visual model for temporal database representation." Master's thesis, University of Cape Town, 2016. http://hdl.handle.net/11427/20875.

Full text

Abstract:

Today, in the world of information technology, conceptual model representation of database schemas is challenging for users both in the Software Development Life Cycle (SDLC) and the Human-Computer Interaction (HCI) domain. The primary way to resolve this issue, in both domains, is to use a model that is concise, interpretable and clear to understand, yet encompasses all of the required information to be able to clearly define the database. A temporal database is understood as a database capable of supporting reasoning of time-based data for e.g.: a temporal database can answer questions such as: - for what period was Mrs Jones single before she got married? On the other hand, an atemporal database stores data that is valid today and has no history. In the thesis, I looked at different theoretical temporal visual conceptual models proposed by temporal researchers and aimed, by means of a user-survey consisting of business users, to ascertain towards which models users a preference has. I further asked the users for firstly; whether they prefer textual or graphical representations for the entities, attributes and constraints represented by the visual models, or secondly; whether there is a preference for a specific graphical icon for the temporal entities and lastly; to ascertain if the users show a preference towards a specific theoretical temporal conceptual model. The methodology employed to reach my goal in this thesis, is one of experiments on business users with knowledge enhancements after each experiment. Users were to perform a task, and then based on analysis of the task results, they are taught additional temporal aspects so as improve their knowledge before the next experiment commences. The ultimate aim was to extract a visual conceptual model preference from business users with enhanced knowledge of temporal aspects. This is the first work done in this field and thus will aid researchers in future work, as they will have a temporal conceptual model that promotes effective communication, understandability and interpretability.

APA, Harvard, Vancouver, ISO, and other styles

33

SEQUEIRA, SARITA CARMEL. "INVESTIGATION AND EVALUATION OF A VHDL-AMS MODEL DATABASE." University of Cincinnati / OhioLINK, 2000. http://rave.ohiolink.edu/etdc/view?acc_num=ucin972311716.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Embury, Suzanne M. "Constraint-based updates in a functional data model database." Thesis, University of Aberdeen, 1994. http://digitool.abdn.ac.uk/R?func=search-advanced-go&find_code1=WSN&request1=AAIU066736.

Full text

Abstract:

State change is an intrinsic feature of real-world database applications. However, due to their inherent procedurality, updates can be difficult to support in databases based on the more declarative paradigms, such as the functional and logic data models. A common approach to this problem is to build two distinct subsystems, one of which is allowed to make state changes and the other of which is not. We have explored three ways to provide more uniform support for user updates within the context of P/FDM, a Functional Data Model database implemented in Prolog. The first of these is a subsystem for the efficient checking of a class of semantic integrity constraints, expressed in a declarative language, which relieves users of the burden of ensuring that their updates do not violate database integrity. The second is a simple transaction mechanism that allows users to suspend integrity checking during complex updates, but which ensures that validity has been restored before any transaction is allowed to commit. The final extension provides users with a language for the declarative description of object creations, in which updates are described in terms of the constraints that the resulting database state must satisfy, rather than as sequences of individual update operations. The common factor in each case is the use of semantic domain knowledge, expressed in the form of constraints, to allow the DBMS to insulate users from the worst consequences of state changes. The extended version of the P/FDM system now forms a solid platform from which to experiment further with constraint processing techniques in a database context.

APA, Harvard, Vancouver, ISO, and other styles

35

Burger, Albert G. "Branching transactions : a transaction model for parallel database systems." Thesis, University of Edinburgh, 1996. http://hdl.handle.net/1842/15591.

Full text

Abstract:

In order to exploit parallel computers, database management systems must achieve a high level of concurrency when executing transactions. In a high contention environment, however, concurrency is severely limited due to transaction blocking, and the utilisation of parallel hardware resources, e.g. multiple CPUs, can be low. In this dissertation, a new transaction model, Branching Transactions, is proposed. Under branching transactions, more than one possible path of execution of a transaction is followed up in parallel, which allows us to avoid unnecessary transaction blockings and restarts. This approach uses additional hardware resources, mainly CPU - which would otherwise sit idle due to data contention - to improve transaction response time and throughput. A new transaction model has implications for many transaction processing algorithms, in particular concurrency control. A family of locking algorithms, based on multi-version two-phase locking, has been developed for branching transactions, including an algorithm which can dynamically switch between branching and non-branching modes. The issues of deadlock handling and recovery are also considered. The correctness of all new concurrency control algorithms is proved by extending traditional serializability theory so that it is able to cope with the notion of a branching transaction. Architectural descriptions of branching transaction systems for shared-memory parallel data-bases and hybrid shared-disk/shared-memory systems are discussed. In particular, the problem of cache coherence is addressed. The performance of branching transactions in a shared-memory parallel database system has been investigated, using discrete-event simulation. One field which may potentially benefit greatly from branching transactions is that of so-called "real-time" database systems, in which transactions have execution deadlines. A new real-time concurrency control algorithm based on branching transactions is introduced.

APA, Harvard, Vancouver, ISO, and other styles

36

Von, Dollen Andrew C. "Data-Driven Database Education: A Quantitative Study of SQL Learning in an Introductory Database Course." DigitalCommons@CalPoly, 2019. https://digitalcommons.calpoly.edu/theses/2068.

Full text

Abstract:

The Structured Query Language (SQL) is widely used and challenging to master. Within the context of lab exercises in an introductory database course, this thesis analyzes the student learning process and seeks to answer the question: ``Which SQL concepts, or concept combinations, trouble students the most?'' We provide comprehensive taxonomies of SQL concepts and errors, identify common areas of student misunderstanding, and investigate the student problem-solving process. We present an interactive web application used by students to complete SQL lab exercises. In addition, we analyze data collected by this application and we offer suggestions for improvement to database lab activities.

APA, Harvard, Vancouver, ISO, and other styles

37

Smékalová, Pavlína. "Informační systém pro podporu tréninkových aktivit." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2007. http://www.nusl.cz/ntk/nusl-412792.

Full text

Abstract:

This Diploma thesis describes the process of analysis and design of an information system supporting training activities. The system is based on the web pages. It is creating an information system, that would allow monitoring the nutritional plan, strength training and sports activities of an athlete. The system allows each athlete to be assigned a dietitian and a coach, who take care of his/her nutritional plan and training. The athlete has immediate feedback atd of his success and has better conditions to meet his ambitions.

APA, Harvard, Vancouver, ISO, and other styles

38

Kolapalli, Pavani. "An analysis of structural and semantic validity in the data model." Click here for download, 2008. http://proquest.umi.com/pqdweb?did=1637583301&sid=1&Fmt=2&clientId=3260&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Hauzenberger, Sabina, and Brandt Emil Lindholm. "Proposal and Evaluation of a Database Data Model Decision Method." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-272123.

Full text

Abstract:

A common problem when choosing a data model for a database is that there are many aspects to take into consideration–making the decision diﬃcult and time-consuming. Therefore this work aims to create a decision method that enhances the decision by making it more suitable for the use-case at hand as well as making it quicker. First, the Analytical Hierarchy Process, a multi-criteria decision method, was identified as a suitable framework that the created decision method was based on. It was developed iteratively and later validated through a survey at Omegapoint. The survey had 27 respondents, but 14 answers were discarded due to being too unreliable, which led to a total of 13 utilized responses. The decision method was implemented in a web application to simplify the survey process, where the respondents use the web application, and answered some follow up questions about the web application’s result and process. It was found that it is possible to create a decision method which makes the choice of a data model quicker and better suited for the use-case. The method is reliable among a subsample of the respondents in the survey as 11 out of 13 respondents found the decision method’s result to be reasonable. However, the small sample size makes it impossible to draw any statistical conclusions of the reliability of the decision method. Additionally, the decision method helps to make the decision quicker, but this is only proven among the respondents in the survey. Based on the results, we conclude that it is possible to create a decision method which makes the decision quicker and better suited for the use-case. However this is only proved among the survey respondents, and a future work could aim to repeat the validation in order to statistically validate the reliability of the decision method.
Ett vanligt problem vid valet av datamodell för en databas är att det finns många aspekter att ta hänsyn till–vilket gör valet svårt och tidskrävande. Detta arbete försöker därför skapa en beslutsmetod som kan förbättra beslutet genom att göra det snabbare och bättre anpassat för användningsområdet. Först valdes Analytical Hierarchy Process, en multikriterie-beslutsmetod, som grund till den framtagna beslutsmetoden. Beslutsmetoden utvecklades iterativt och validerades sedan genom en undersökning på Omegapoint. Undersökningen hade 27 respondenter, men 14 svar plockades bort då de var för inkonsekventa, vilket ledde till att 13 svar användes till slut. I undersökningen använde deltagarna en webb applikation, baserad på beslutsmetoden, och svarade sedan på några frågor och gav feedback om artefaktens resultat och process. Resultaten visade att det är möjligt att skapa en beslutsmetod som gör valet av datamodell snabbare och bättre anpassat för användningsområdet. Metoden anses vara träﬀsäker bland deltagarna i undersökningen, där 11 av 13 ansåg att resultatet var rimligt. Däremot kan arbetet inte dra några statistiska slutsatser om hur träﬀsäker metoden är generellt på grund av det låga antalet deltagare i undersökningen. Utöver en god tillförlitlighet, bidrar metoden till ett snabbare beslut, men detta kan endast bevisas för deltagargruppen i undersökningen. Givet resultaten kan vi dra slutsatsen att det är möjligt att skapa en beslutsmetod som gör valet av datamodell snabbare och bättre anpassat för användningsområdet. Detta kan däremot endast kan bevisas för deltagargruppen i undersökningen och därför föreslås att ett framtida arbete skulle kunna upprepa valideringen med en större deltagargrupp för att kunna fastslå modellens tillförlitlighet statistiskt.

APA, Harvard, Vancouver, ISO, and other styles

40

Zygta, Adane H. "Object category data model, a new data model for object-oriented database management systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0009/MQ52383.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Zygta, Adane H. (Adane Hadgu Carleton University Dissertation Computer Science. "Object category data model; a new data model for object-oriented database management systems." Ottawa, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

42

Garza, Melendez Modesto Ricardo. "The extended ELKA conceptual model : its structure and dynamic properties." Thesis, University of Sussex, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.262326.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Higa, Kunihiko. "End user logical database design: The structured entity model approach." Diss., The University of Arizona, 1988. http://hdl.handle.net/10150/184539.

Full text

Abstract:

We live in the Information Age. The effective use of information to manage organizational resources is the key to an organization's competitive power. Thus, a database plays a major role in the Information Age. A well designed database contains relevant, nonredundant, and consistent data. However, a well designed database is rarely achieved in practice. One major reason for this problem is the lack of effective support for logical database design. Since the late 1980s, various methodologies for database design have been introduced, based on the relational model, the functional model, the semantic database model, and the entity structure model. They all have, however, a common drawback: the successful design of database systems requires the experience, skills, and competence of a database analyst/designer. Unfortunately, such database analyst/designers are a scarce resource in organizations. The Structured Entity Model (SEM) method, as an alternative diagrammatic method developed by this research, facilitates the logical design phases of database system development. Because of the hierarchical structure and decomposition constructs of SEM, it can help a novice designer in performing top-down structured analysis and design of databases. SEM also achieves high semantic expressiveness by using a frame representation for entities and three general association categories (aspect, specialization, and multiple decomposition) for relationships. This also enables SEM to have high potential as a knowledge representation scheme for an integrated heterogeneous database system. Unlike most methods, the SEM method does not require designers to have knowledge of normalization theory in order to design a logical database. Thus, an end-user will be able to complete logical database design successfully using this approach. In this research, existing data models used for a logical database design were first studied. Second, the framework of SEM and the design approach using SEM were described and then compared with other data models and their use. Third, the effectiveness of the SEM method was validated in two experiments using novice designers and by a case analysis. In the final chapter of this dissertation, future research directions, such as the design of a logical database design expert system based on the SEM method and applications of this approach to other problems, such as the problems in integration of multiple databases and in an intelligent mail system, are discussed.

APA, Harvard, Vancouver, ISO, and other styles

44

Monk, Simon. "A model for schema evolution in object-oriented database systems." Thesis, Lancaster University, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359780.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Tsai, Eva Y. (Eva Yi-hua). "Inter-database data quality management : a relational-model based approach." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/40202.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Walk, Ellen Moore. "A generalized system performance model for object-oriented database applications." VCU Scholars Compass, 1995. https://scholarscompass.vcu.edu/etd/5613.

Full text

Abstract:

Although relational database systems have met many needs in traditional business applications, such technology is inadequate for non-traditional applications such as computer-aided design, computer-aided software engineering, and knowledge bases. Object-oriented database systems (OODB) enhance the data modeling power and performance of database management systems for these applications. Response time is an important issue facing OODB. However, standard measures of on-line transaction processing are irrelevant for OODB . Benchmarks compare alternative implementations of OODB system software, running a constant application workload. Few attempts have been made to characterize performance implications of OODB application design, given a fixed OODB and operating system platform. In this study, design features of the 007 Benchmark database application (Carey, DeWitt, and Naughton, 1993 ) were varied to explore the impact on response time to perform database operations Sensitivity to the degree of aggregation and to the degree of inheritance in the application were measured. Variability in response times also was measured, using a sequence of database operations to simulate a user transaction workload. Degree of aggregation was defined as the number of relationship objects processed during a database operation. Response time was linear with the degree of aggregation. The size of the database segment processed, compared to the size of available memory, affected the coefficients of the regression line. Degree of inheritance was defined as the Number of Children (Chidamber and Kemerer, 1994) in the application class definitions, and as the extent to which run-time polymorphism was implemented. In this study, increased inheritance caused a statistically significant increase in response time for the 007 Traversal 1 only, although this difference was not meaningful. In the simulated transaction workload of nine 007 operations, response times were highly variable. Response times per operation depended on the number of objects processed and the effect of preceding operations on memory contents. Operations that used disparate physical segments or had large working sets relative to the size of memory caused large increases in response time. Average response times and variability were reduced by removing these operations from the sequence (equivalent to scheduling these transactions at some time when the impact would be minimized).

APA, Harvard, Vancouver, ISO, and other styles

47

Ozgur, Nezihe Burcu. "An Intelligent Fuzzy Object-oriented Database Framework For Video Database Applications." Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608913/index.pdf.

Full text

Abstract:

Video database applications call for flexible and powerful modeling and querying facilities, which require an integration or interaction between database and knowledge base technologies. It is also necessary for many real life video database applications to incorporate uncertainty, which naturally occurs due to the complex and subjective semantic content of video data. In this thesis study, firstly, a fuzzy conceptual data model is introduced to represent the semantic content of video data. UML (Unified Modeling Language) is utilized and extended to represent uncertain information along with video specific properties at the conceptual level. Secondly, an intelligent fuzzy object-oriented database framework is presented for video database applications. The introduced fuzzy conceptual model is mapped to the presented framework, which is an adaptation of the previously proposed IFOOD architecture. The framework provides modeling and querying of complex and rich semantic content and knowledge of video data including uncertainty. Moreover, it allows (fuzzy) semantic, temporal, (fuzzy) spatial, hierarchical, regional and trajectory queries, based on the video data model. We think that the presented conceptual data model and framework can be adapted to any application domain related to video databases.

APA, Harvard, Vancouver, ISO, and other styles

48

Su, Jianmin. "A database management system to support the instance-based data model : design, implementation, and evaluation /." Internet access available to MUN users only, 2003. http://collections.mun.ca/u?/theses,218734.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Chandrasekaran, Arunkumar. "Building and Implementing an Inventory Database Model for the Bearcat BRAT Using Microsoft Access Database and C# Programming Language." University of Cincinnati / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1131657662.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Jackson, A. R. "Abstract data types and the integrated project support environment database." Thesis, University of York, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382958.

Full text

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!