Dissertations / Theses: 'Database'

1

Unnava, Vasundhara. "Query processing in distributed database systems." Connect to resource, 1992. http://rave.ohiolink.edu/etdc/view.cgi?acc%5Fnum=osu1261314105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

Abstract:

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, updating and deleting database objects. Each of these databases will be timed in order to measure which is capable of performing a particular function faster than the other.

APA, Harvard, Vancouver, ISO, and other styles

3

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Rashid, Awais. "A database evolution approach for object oriented databases." Thesis, Lancaster University, 2001. http://eprints.lancs.ac.uk/11951/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

Abstract:

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.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

6

Zhang, Hao. "Querying databases a tale of two C# approaches /." Click here for download, 2010. http://proquest.umi.com.ps2.villanova.edu/pqdweb?did=2019786971&sid=1&Fmt=2&clientId=3260&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Sun, Jimeng. "Analysis of predictive spatio-temporal queries /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20SUN.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

8

Areal, Bruno Miguel de Melo Gonçalves. "Building anonymised database samples." Master's thesis, Faculdade de Ciências e Tecnologia, 2011. http://hdl.handle.net/10362/7699.

Full text

Abstract:

Dissertação para obtenção do Grau de Mestre em Engenharia Informática
In this work we propose Anonym Database Sampler (ADS), a flexible and modular system capable of extracting an anonymised, consistent and representative sample from a relational database. ADS was envisioned for use in testing and development environments. To this end, a sample specification input is requested from the user, that is used by ADS’s sampling engine to perform a stratified random sample. Afterwards a First-choice hill climbing algorithm is applied to the sample, optimising the selected data towards the specified requisites. Finally, if some restrictions are still to be met, tuples and/or keys modifications are performed, ensuring that the final sample fully complies with the initial sample specification. While having a representative and sound database that developers can use in these environments can be a great advantage, we assume that this representativeness does not need to comply with a truly statistical representativity, which would be much harder to obtain. Thereby, ADS samples are not appropriate for any kind of statistical data analysis. After the sample being successfully extracted, due to the sensitivity of the data contained in most organisation databases, a data anonymisation step is performed. The sampled data is consistently enciphered and masked, preventing data privacy breaches that could occur by delivering to developers a database containing some real operational data.

APA, Harvard, Vancouver, ISO, and other styles

9

Xie, Dongqing. "A Web database builder system WEBDB /." [Gainesville, Fla.] : University of Florida, 2001. http://purl.fcla.edu/fcla/etd/UFE0000365.

Full text

Abstract:

Thesis (M.S.)--University of Florida, 2001.
Title from title page of source document. Document formatted into pages; contains xi, 62 p.; also contains graphics. Includes vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

10

Chen, Lijun. "A Web-based database application builder." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1000113.

Full text

Abstract:

Thesis (M.S.)--University of Florida, 2002.
Title from title page of source document. Document formatted into pages; contains ix, 64 p.; also contains graphics. Includes vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

11

Chung, Sun S. "Anti-Tamper Databases: Querying Encrypted Databases." online version, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=case1136677144.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Rehn, Marcus, and Emil Sunesson. "Main-memory database VS Traditional database." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2801.

Full text

Abstract:

There has been a surge of new databases in recent years. Applications today create a higher demand on database performance than ever before. Main-memory databases have come into the market quite recently and they are just now catching a lot of interest from many different directions. Main-memory databases are a type of database that stores all of its data in the primary memory. They provide a big increase in performance to a lot of different applications. This work evaluates the difference in performance between two chosen candidates. To represent main memory databases we chose VoltDB and to represent traditional databases we chose MySQL. We have performed several tests on those two databases. We point out differences in functionality, performance and design choices. We want to create a reference where anyone that considers changing from a traditional database to a main memory database, can find support for their decision. What are the advantages and what are the disadvantages of using a main-memory database, and when should we switch from our old database to a newer technology.

APA, Harvard, Vancouver, ISO, and other styles

13

Coats, Sidney M. (Sidney Mark). "The Object-Oriented Database Editor." Thesis, University of North Texas, 1989. https://digital.library.unt.edu/ark:/67531/metadc500921/.

Full text

Abstract:

Because of an interest in object-oriented database systems, designers have created systems to store and manipulate specific sets of abstract data types that belong to the real world environment they represent. Unfortunately, the advantage of these systems is also a disadvantage since no single object-oriented database system can be used for all applications. This paper describes an object-oriented database management system called the Object-oriented Database Editor (ODE) which overcomes this disadvantage by allowing designers to create and execute an object-oriented database that represents any type of environment and then to store it and simulate that environment. As conditions within the environment change, the designer can use ODE to alter that environment without loss of data. ODE provides a flexible environment for the user; it is efficient; and it can run on a personal computer.

APA, Harvard, Vancouver, ISO, and other styles

14

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Robinson, H. M. "The capture of meaning in database administration." Thesis, University of Hertfordshire, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.234361.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Guo, Pinglei. "Benchhub| Store Database Benchmark Result in Database." Thesis, University of California, Santa Cruz, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10749082.

Full text

Abstract:

Benchmark is an essential part of evaluating database performance. However, the procedure of setting up the environment and collecting result is time-consuming and not well defined. The uncertainty in benchmark procedure leads to low reproducibility. Furthermore, many benchmark results are highly compressed and only published in unstructured formats like document and graph. Without a structural format and the context of a benchmark, comparing benchmark results across sources is time-consuming and often biased.

In this thesis, BenchHub is presented to remedy those problems. It defines a job specification that covers the life cycle of running database benchmark in a distributed environment. A reference implementation of infrastructure is provided and will be hosted as a public service. Using this service, database developers can focus on analyzing benchmark result instead of getting them. BenchHub stores metrics like latency in time series databases and puts aggregated results along with benchmark context in relational databases. Users can query results directly using SQL and compare results across sources without extra preprocessing.

BenchHub integrates time series workloads like Xephon-B and standard database workloads like TPC-C. Comparisons between open source databases are made to demonstrate its usability. BenchHub is open sourced under MIT license and hosted on GitHub.

APA, Harvard, Vancouver, ISO, and other styles

17

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

18

Hon, Wing-Keung. "The next generation of database : object-oriented database." Virtual Press, 1994. http://liblink.bsu.edu/uhtbin/catkey/917035.

Full text

Abstract:

As some new computer applications, such as computer-aided design, multimedia systems, and knowledge-based systems, require more complex data structures, the traditional database system seems to be unable to support these new requirements. A recently developed database technology, object-oriented database, provides a solution to these problems.The purpose of this thesis is to investigate what is object-oriented database, especially in its internal organization such as object persistency. Two object-oriented database systems, EXODUS and ODE, are discussed in detail. In addition, a comparison between the relational databases and object-oriented databases is made.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

19

Quarles, April Michelle. "An analysis of database design transformations as applied to the Advanced Education Database System." Master's thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-04272010-020138/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Klapač, Milan. "Výhody a nevýhody relačních a nerelačních (noSQL) databází pro analytické úlohy." Master's thesis, Vysoká škola ekonomická v Praze, 2015. http://www.nusl.cz/ntk/nusl-193931.

Full text

Abstract:

This work focuses on NoSQL databases, their use for analytical tasks and on comparison of NoSQL databases with relational and OLAP databases. The aim is to analyse the benefits of NoSQL databases and their use for analytical purposes. The first part presents the basic principles of Business Intelligence, Data Warehousing, and Big Data. The second part deals with the key features of relational and NoSQL databases. The last part of the thesis describes the properties of four basic types of NoSQL databases, analyses their advantages, disadvantages and areas of application. The end of this part in-cludes specific examples of the use of NoSQL databases, together with the reasons for the selection of those solutions.

APA, Harvard, Vancouver, ISO, and other styles

21

Oh, Yong-Chul. "Secure database modeling and design." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/13043.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

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

23

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

24

Long, Shitian. "Database syncrhonization between devices : A new synchronization protocol for SQLite databases." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-46712.

Full text

Abstract:

Today people have multiple personal computers, personal digital assistants and smart phones. Today's advanced handheld devices have powerful processors, with a process frequency of up to 1 GHz, huge storage capacities, flash storage capacities up to 32 GB, a large (multi) touch screen, and a user-friendly user interface. Additionally, the device may have various input and output devices, thus leading to people utilizing different devices for different use cases. In order to provide the latest information to the users via any of their devices, data synchronization becomes a requirement for users. There are many data synchronization solutions for synchronizing database records and files. In the current database synchronization solutions, there is no clear source and target. For example, consider the case where a PDA synchronizes with a PC; the record could have been edited (changed) on both the PDA and PC. In this case it is not clear which should be synchronized with what should be the source for the value. In contrast, a files synchronization system has a clearly specified synchronizatiom sourse and destination structure. In this case the client Synchronizes their files with that of the server. In a version control system the client synchronize files with a repository acting as a version control server. There are many synchronizing protocols and each has been designed for different purpose. Protocols for synchronizing database records often provide continuous synchronization, leading to a lot of data being exchanging during the synchronization process, as a result the synchronization process takes a longer period of time, but maintains the semantics of the database updates (either a complete transaction completes or it must be rolled back). On the other hand, protocols for synchronizing files may require a short synchronization time, as the whole file transferred and replaces the previous version of the file at the destination. Note file synchronization may also transfer only the differences between the files, with a local transformation of an existing file copy of the by applying these differences as updates to the files. Sending only the updates to a file enables large files with a small number of changes to be quickly updated. However, file based updated does not efficiently support record level updates of a database. In this thesis we designed a new synchronization protocol for synchronizing two SQLite databases. This synchronization protocol borrows from (and hence offers the advantages of) a version control system in order to rapidly perform SQLite database synchronization. Moreover, this solution brings SQLite database additional functions, for example supporting multiple-user, transaction logs, and data roll-back.

APA, Harvard, Vancouver, ISO, and other styles

25

Wang, Qing [Verfasser]. "Logical foundations of database transformations for complex-value databases / Qing Wang." Kiel : Universitätsbibliothek Kiel, 2010. http://d-nb.info/1020001461/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Ge, Shen, and 葛屾. "Advanced analysis and join queries in multidimensional spaces." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B49799332.

Full text

Abstract:

Multidimensional data are ubiquitous and their efficient management and analysis is a core database research problem. There are lots of previous works focusing on indexing, analyzing and querying multidimensional data. In this dissertation, three challenging advanced analysis and join problems in multidimensional spaces are proposed and studied, providing efficient solutions to their related applications. First, the problem of generalized budget constrained optimization query (Gen-BOQ) is studied. In real life, it is often difficult for manufacturers to create new products dominating their competitors, due to some constraints. These constraints can be modeled by constraint functions, and the problem is then to decide the best possible regions in multidimensional spaces where the features of new products could be placed. Using the number of dominating and dominated objects, the profitability of these regions can be evaluated and the best areas are then returned. Although GenBOQ computation is challenging due to its high complexity, an efficient divide-and-conquer based framework is offered for this problem. In addition, an approximation method is proposed, making tradeoffs between the result quality and the query cost. Next, the efficient evaluation of all top-k queries (ATOPk) in multidimensional spaces is investigated, which compute the top ranked objects for a group of preference functions simultaneously. As an application of such a query, consider an online store, which needs to provide recommendations for a large number of users simultaneously. This problem is somewhat overlooked by past research; in this thesis, batch algorithms are proposed instead of naïvely evaluating top-k queries individually. Similar preferences are grouped together, and two algorithms are proposed, using block indexed nested loops and a view-based thresholding strategy. The optimized view-based threshold algorithm is demonstrated to be consistently the best. Moreover, an all top-k query helps to evaluate other queries relying on the results of multiple top-k queries, such as reverse top-k queries and top-m influential queries proposed in previous works. It is shown that applying the view-based approach to these queries can improve the performance of the current state-of-the-art by orders of magnitude. Finally, the problem of spatio-textual similarity joins (ST-SJOIN) on multidimensional data is considered. Given both spatial and textual information, ST-SJOIN retrieves pairs of objects which are both spatially close and textually similar. One possible application of this query is friendship recommendation, by matching people who not only live nearby but also share common interests. By combining the state-of-the-art strategies of spatial distance joins and set similarity joins, efficient query processing algorithms are proposed, taking both spatial and textual constraints into account. A batch processing strategy is also introduced to boost the performance, which is also effective for the original textual-only joins. Using synthetic and real datasets, it is shown that the proposed techniques outperform the baseline solutions.
published_or_final_version
Computer Science
Doctoral
Doctor of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

30

Vargas, Herring Luis Carlos. "Integrating databases and publish/subscribe." Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609151.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Garcia, Hong-Mei Chen. "A semantics-based methodology for integrated distributed database design: Toward combined logical and fragmentation design and design automation." Diss., The University of Arizona, 1992. http://hdl.handle.net/10150/185936.

Full text

Abstract:

The many advantages of Distributed Database (DDB) systems can only be achieved through proper DDB designs. Since designing a DDB is very difficult and expert designers are relatively few in number, "good" DDB design methodologies and associated computer-aided design tools are needed to help designers cope with design complexity and improve their productivity. Unfortunately, previous DDB design research focused on solving subproblems of data distribution design in isolation. As a result, past research on a general DDB design methodology offered only methodological frameworks that, at best, aggregate a set of non-integrated design techniques. The conventional separation of logical design from fragmentation design is problematic, but has not been fully analyzed. This dissertation presents the SEER-DTS methodology developed for the purposes of overcoming the methodological inadequacies of conventional design methodologies, resolving the DDB design problem in an integrated manner and facilitating design automation. It is based on a static semantic data model, SEER (Synthesized Extended Entity-Relationship Model) and a dynamic data model, DTS (Distributed Transaction Scheme), which together provide complete and consistent modeling mechanisms for acquiring/representing DDB design inputs and facilitating DDB schema design. In this methodology, requirement/distribution analysis and conceptual design are integrated and logical and fragmentation designs are combined. "Semantics-based" design techniques have been developed to allow for end-user design specifications and seamless design schema transformations, thereby simplifying design tasks. Towards our ultimate goal of design automation, an architectural framework for a computer-aided DDB design system, Auto-DDB, was formulated and the system was prototyped. As part of the developmental effort, a real-world DDB design case study was conducted to verify the applicability of the SEER-DTS methodology in a manual design mode. The results of a laboratory experiment showed that the SEER-DTS methodology produced better design outcomes (in terms of design effectiveness and efficiency) than a Conventional Best methodology performed by non-expert designers in an automated design mode. However, no statistically significant difference was found in user-perceived ease of use.

APA, Harvard, Vancouver, ISO, and other styles

33

Shou, Yutao Sindy, and 壽玉濤. "Efficient query processing for spatial and temporal databases." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29853655.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Lee, J. J. "The object-oriented database and processing of electronic warfare data." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1996. http://handle.dtic.mil/100.2/ADA303112.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Conway, Kyle. "Bioinformatics and Biological Databases: 1) Sigma-54 Promoter Database – A Database of Sigma-54 Promoters Covering a Wide Range of Bacterial Genomes 2) ClusterMine360 – A Database of PKS/NRPS Biosynthesis." Thèse, Université d'Ottawa / University of Ottawa, 2013. http://hdl.handle.net/10393/23648.

Full text

Abstract:

The Sigma-54 Promoter Database contains computationally predicted sigma-54 promoters from over 60 prokaryotic species. Organisms from all major phyla were analysed and results were made available online at http://www.sigma54.ca. This database is particularly unique due to its inclusion of intragenic regions, grouping of data by COG and COG category, and the ability to summarize results either by phylum or database-wide. ClusterMine360 (http://www.clustermine360.ca/) is a database of microbial polyketide and nonribosomal peptide gene clusters. It takes advantage of crowd-sourcing by allowing members of the community to make contributions while automation is used to help achieve high data consistency and quality. The database currently has over 200 gene clusters from over 185 compound families. It also features a unique sequence repository containing over 10,000 PKS/NRPS domains. The sequences are filterable and downloadable as individual or multiple sequence FASTA files. This database will be a useful resource for members of the PKS/NRPS research community enabling them to keep up with the growing number of sequenced gene clusters and rapidly mine these clusters for functional information.

APA, Harvard, Vancouver, ISO, and other styles

36

Lo, Chi Lik Eric. "Test automation for database management systems and database applications /." Zürich : ETH, 2007. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17271.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

McGhee, Deborah A. "Database creation and/or reorganization over multiple database backends." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/25800.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Holton, William Jordan. "Translating database queries to English for enhancing database education." Thesis, Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/54339.

Full text

Abstract:

The thesis of this research is that database queries can be translated to corresponding English descriptions for the use in applications in intelligent tutoring (in particular, problem generation and feedback generation) for the subject domain of database query construction. To demonstrate this thesis, a rule-based graph-rewriting algorithm and a concrete set of rules for systematically transforming queries in a subset of SQL to English descriptions are presented. Further, through an implementation of this technique, this study demonstrates an evaluation of its performance on SQL queries from database textbooks.

APA, Harvard, Vancouver, ISO, and other styles

39

Wheeler, Jared Thomas. "Extracting a Relational Database Schema from a Document Database." UNF Digital Commons, 2017. http://digitalcommons.unf.edu/etd/730.

Full text

Abstract:

As NoSQL databases become increasingly used, more methodologies emerge for migrating from relational databases to NoSQL databases. Meanwhile, there is a lack of methodologies that assist in migration in the opposite direction, from NoSQL to relational. As software is being iterated upon, use cases may change. A system which was originally developed with a NoSQL database may accrue needs which require Atomic, Consistency, Isolation, and Durability (ACID) features that NoSQL systems lack, such as consistency across nodes or consistency across re-used domain objects. Shifting requirements could result in the system being changed to utilize a relational database. While there are some tools available to transfer data between an existing document database and existing relational database, there has been no work for automatically generating the relational database based upon the data already in the NoSQL system. Not taking the existing data into account can lead to inconsistencies during data migration. This thesis describes a methodology to automatically generate a relational database schema from the implicit schema of a document database. This thesis also includes details of how the methodology is implemented, and what could be enhanced in future works.

APA, Harvard, Vancouver, ISO, and other styles

40

Hall, Neil Scott. "Impact of data modeling and database implementation methods on the optimization of conceptual aircraft design." Thesis, Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/16847.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

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

42

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

43

Lloyd, Peter James. "Database use in the primary school : format-free databases and knowledge construction." Thesis, Queensland University of Technology, 1996. https://eprints.qut.edu.au/36518/1/36518_Lloyd_1996.pdf.

Full text

Abstract:

The use of computer based learning and specifically the use of databases has many positive benefits for the learning process in primary schools. The construction _of meaning, the focus on the learner and the development of self-regulatory, problem solving skills can all be enhanced through the use of databases. This study sought to evaluate the use of format-free data structures to consider their usefulness and appropriateness for knowledge construction in the primary school. The study demonstrated that the development of format-free databases was a motivational learning activity which encouraged students to develop positive educational outcomes such as reflective practices, higher order thinking skills as well as the development of students' personal knowledge bases.

APA, Harvard, Vancouver, ISO, and other styles

44

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.

Full text

Abstract:

Thesis (M.S. in Information Systems)--Naval Postgraduate School, June 1990.
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, and other styles

45

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

46

Kern, Deborah R. "Design and implementation of the acoustic database and acoustic trainer modules for "ARGOS"." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA232052.

Full text

Abstract:

Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 1990.
Thesis Advisor(s): Wu, C. Thomas. Second Reader: Lum, Vincent Y. "June 1990." Description based on signature page. DTIC Identifier(s): Software engineering, event driven multimedia database, acoustic database. Author(s) subject terms: Software engineering, event driven multimedia database, acoustic database. Includes bibliographical references (p. 96). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

47

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

48

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Willshire, Mary Jane. "The effects of inheritance on the properties of physical storage models in object oriented databases." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/9236.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Jakobovits, Rex M. "The Web interfacing repository manager : a framework for developing web-based experiment management systems /." Thesis, Connect to this title online; UW restricted, 1999. http://hdl.handle.net/1773/7007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Database'

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