Dissertations / Theses: 'Relational database system'

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

3

Moolman, G. Chris. "A relational database management systems approach to system design /." This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-07102009-040421/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Moolman, George Christiaan. "A relational database management systems approach to system design." Thesis, Virginia Tech, 1992. http://hdl.handle.net/10919/43628.

Full text

Abstract:

Systems are developed to fulfill certain requirements. Several system design configurations usually can fulfill the technical requirements, but at different equivalent life-cycle costs. The problem is how to manipulate and evaluate different system configurations so that the required system effectiveness can be achieved at a minimum equivalent cost. It is also important to have a good definition of all the major consequences of each design configuration. For each alternative configuration considered, it is useful to know the number of units to deploy, the inventory and other logistic requirements, as well as the sensitivity of the system to changes in input variable values. An intelligent relational database management system is defined to solve the problem described. Table structures are defined to maintain the required data elements and algorithms are constructed to manipulate the data to provide the necessary information. The methodology is as follows: Customer requirements are analyzed in functional terms. Feasible design alternatives are considered and defined as system design configurations. The reliability characteristics of each system configuration are determined, initially from a system-level allocation, and later determined from test and evaluation data. A maintenance analysis is conducted to determine the inventory requirements (using reliability data) and the other logistic requirements for each design configuration. A vector of effectiveness measures can be developed for each customer, depending on objectives, constraints, and risks. These effectiveness measures, consisting of a combination of performance and cost measures, are used to aid in objectively deciding which alternative is preferred. Relationships are defined between the user requirements, the reliability and maintainability of the system, the number of units deployed, the inventory level, and other logistic characteristics of the system. A heuristic procedure is developed to interactively manipulate these parameters to obtain a good solution to the problem with technical performance and cost measures as criteria. Although it is not guaranteed that the optimal solution will be found, a feasible solution close to the optimal will be found. Eventually the user will have, at any time, the ability to change the value of any parameter modeled. The impact on the total system will subsequently be made visible.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

5

Long, J. A. "Implementing a heterogeneous relational database node." Thesis, University of Bristol, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.355094.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ma, Xuesong 1975. "Data mining using relational database management system." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=98757.

Full text

Abstract:

With the wide availability of huge amounts of data and the imminent demands to transform the raw data into useful information and knowledge, data mining has become an important research field both in the database area and the machine learning areas. Data mining is defined as the process to solve problems by analyzing data already present in the database and discovering knowledge in the data. Database systems provide efficient data storage, fast access structures and a wide variety of indexing methods to speed up data retrieval. Machine learning provides theory support for most of the popular data mining algorithms. Weka-DB combines properties of these two areas to improve the scalability of Weka, which is an open source machine learning software package. Weka implements most of the machine learning algorithms using main memory based data structure, so it cannot handle large datasets that cannot fit into main memory. Weka-DB is implemented to store the data into and access the data from DB2, so it achieves better scalability than Weka. However, the speed of Weka-DB is much slower than Weka because secondary storage access is more expensive than main memory access. In this thesis we extend Weka-DB with a buffer management component to improve the performance of Weka-DB. Furthermore, we increase the scalability of Weka-DB even further by putting further data structures into the database, which uses a buffer to access the data in database. Furthermore, we explore another method to improve the speed of the algorithms, which takes advantage of the data access properties of machine learning algorithms.

APA, Harvard, Vancouver, ISO, and other styles

7

NAZARETH, LEANDRO DOS SANTOS. "SYSTEM FOR KEYWORD SEARCH IN RELATIONAL DATABASE." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=13816@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
Esta dissertação descreve um sistema desenvolvido que permite a criação e execução de consultas a partir de palavras-chave sobre um banco de dados relacional. O sistema recebe palavras-chave quaisquer e tenta criar consultas que podem ser executadas em um Sistema de Gerenciamento de Banco de dados (SGBD). Para realizar esta geração automática de consultas o sistema utiliza os dados do catálogo da base de origem. O sistema permite assim efetuar consultas em um SGBD sem o conhecimento de uma linguagem de consultas, como SQL, e sem conhecimento do modelo do banco de dados.
This dissertation describes a developed system that allows the creation and execution of searches from keywords in a relational database. The system receives any keywords and tries to create queries that can be executed in database. To perform this automatic generation of queries the system uses the information of the catalogue of the source database. The system allows to make queries in a database without the knowledge of a language queries, like SQL, and the model from the database.

APA, Harvard, Vancouver, ISO, and other styles

8

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

9

Lepinioti, Konstantina. "Data mining and database systems : integrating conceptual clustering with a relational database management system." Thesis, Bournemouth University, 2011. http://eprints.bournemouth.ac.uk/17765/.

Full text

Abstract:

Many clustering algorithms have been developed and improved over the years to cater for large scale data clustering. However, much of this work has been in developing numeric based algorithms that use efficient summarisations to scale to large data sets. There is a growing need for scalable categorical clustering algorithms as, although numeric based algorithms can be adapted to categorical data, they do not always produce good results. This thesis presents a categorical conceptual clustering algorithm that can scale to large data sets using appropriate data summarisations. Data mining is distinguished from machine learning by the use of larger data sets that are often stored in database management systems (DBMSs). Many clustering algorithms require data to be extracted from the DBMS and reformatted for input to the algorithm. This thesis presents an approach that integrates conceptual clustering with a DBMS. The presented approach makes the algorithm main memory independent and supports on-line data mining.

APA, Harvard, Vancouver, ISO, and other styles

10

Mnushkin, Ellen. "Inheritance in a relational object-oriented database system." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61083.

Full text

Abstract:

This thesis shows that major object-oriented features can be implemented in a relational database to improve its ease of use. Such object-oriented features as class hierarchy, inheritance of attributes and methods, polymorphism, and collections of classes, are captured by three meta-relations in which the relationships between classes, association of methods with classes, and the composition of collections, are recorded. Each of these meta-relations implies a modification of the relational algebra operators so that they can be applied both to the independent relations and to the relations which are part of the class hierarchy.
We describe the relational algebra implementation of all the modifications to the relational operators necessary to accommodate the object-oriented features mentioned above. New syntax is suggested when these modifications are not sufficient.

APA, Harvard, Vancouver, ISO, and other styles

11

Eide, Eirik, and Odin Hole Standal. "PORDaS : Peer-to-peer Object Relational Database System." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2006. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10096.

Full text

Abstract:

This master thesis presents PORDaS, the Peer-to-peer Object Relational Database System. It is a continuation of work done in a project of fall 2005, where the foundation for the thesis was laid down. The focus of the work is on distributed query processing between autonomous databases in a structured peer-to-peer network. A great deal of effort has gone into compiling the theoretical foundation for the project, which served as a basis for assessing alternative approaches to introducing a query processor in a peer-to-peer database. The old PORDaS version was extended to include a simplified, pipelined query processor capable of joining tables. The query processor had two different execution strategies, the first was performing join operators at the requesting node and the second was performing join operators parallel among the nodes participating in the query. Experiments which ran PORDaS on a cluster of 36 computers showed that there are room for improvements even though the system was able to perform all the tests.

APA, Harvard, Vancouver, ISO, and other styles

12

Sawyer, Gregory R. "Managing sound in a relational multimedia database system." Thesis, Monterey, California. Naval Postgraduate School, 1988. http://hdl.handle.net/10945/23068.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Spear, Ronald L. "A relational/object-oriented database management system : R/OODBMS." Thesis, Monterey, California. Naval Postgraduate School, 1992. http://hdl.handle.net/10945/24026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Hsu, Edward I. (Edward I.-Hui) 1975. "A relational database synchronization system for the Process Handbook." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80069.

Full text

Abstract:

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
Includes bibliographical references (leaf 52).
by Edward I. Hsu.
S.B.and M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

15

Saleh, Kassem Afif. "A graphical system for logical relational database design, GLORD." Thesis, University of Ottawa (Canada), 1986. http://hdl.handle.net/10393/5360.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

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.

Full text

Abstract:

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 database system. We propose a new ranking formula by adapting existing IR techniques on a natural notion of ???virtual document???. Compared with previous approaches, our new ranking method is simple yet effective, and agrees with human being???s perception better. We also study efficient query processing methods based on the new ranking method, and propose algorithms that have minimal accesses to the database. We have conducted extensive experiments on large-scale real databases using two popular RDBMSs. The experimental results demonstrate significant improvement to the alternative approaches in terms of both retrieval effectiveness and efficiency. We build a prototype of SPARK system on top of popular RDBMS based on these new techniques to satisfy different kinds of users and to support various query modes.

APA, Harvard, Vancouver, ISO, and other styles

17

Urea, Luis. "Storing and Searching Scientific Data with a Relational Database System." Thesis, Uppsala University, Department of Information Technology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-98276.

Full text

Abstract:

Working with scientific data involves analyzing large amounts of data. For High Energy Physics research, one is interested in analyzing series of different events that occur when particles collide and filter those that fulfill predefined conditions. With the proposed approach the conditions are expressed using numerical formulas expressed as SQL queries in a relational database (RDBMS). Different kinds of database representations were designed, studied, and compared in order to get the most efficient and scalable way to store and access the data for the application.

APA, Harvard, Vancouver, ISO, and other styles

18

Tsakalis, Maria. "Implementing QT-selectors and updates for a primary memory version of Aldat." Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66106.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

McDonald, Rory Morgan. "Recycled Materials Relational Database: Design and Implementation Aspects." [Tampa, Fla.] : University of South Florida, 2004. http://purl.fcla.edu/fcla/etd/SFE0000388.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Tanaka, Mitsuru. "Classifier System Learning of Good Database Schema." ScholarWorks@UNO, 2008. http://scholarworks.uno.edu/td/859.

Full text

Abstract:

This thesis presents an implementation of a learning classifier system which learns good database schema. The system is implemented in Java using the NetBeans development environment, which provides a good control for the GUI components. The system contains four components: a user interface, a rule and message system, an apportionment of credit system, and genetic algorithms. The input of the system is a set of simple database schemas and the objective for the classifier system is to keep the good database schemas which are represented by classifiers. The learning classifier system is given some basic knowledge about database concepts or rules. The result showed that the system could decrease the bad schemas and keep the good ones.

APA, Harvard, Vancouver, ISO, and other styles

21

Gu, Qing. "Integration of face processing functionalities into relational database system Mimer SQL." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-176385.

Full text

Abstract:

In a relational database it is possible to store a multitude of different types of data. It would be an advantageous if the database manager provides functionality for handling specialized data (e.g. images and sounds). Currently, an increasing number of commercial relational databases provide functionalities to support clients and manipulate images. This master’s thesis project is a prototype of larger project at Mimer Information Technology AB. And the project has the goal to implement a general framework for adding multimedia functionalities to Mimer SQL. This project in Mimer SQL focused mainly on face detection and face recognitions instead of general image processing, which is the common focus of its major competitors. This project made use of external image libraries to implement image functionalities, such as face detection and face recognition, into the Mimer relational database. A User-defined-type Image with built-in image functionality methods was designed and implemented to make face detection and face recognition available in Mimer SQL for users with the use of standard SQL language. And this project set up a solid foundation for the future multimedia extensions in Mimer SQL.

APA, Harvard, Vancouver, ISO, and other styles

22

Dindar, Nihal. "Pattern matching over sequences of rows in a relational database system." Zürich : ETH, Swiss Federal Institute of Technology Zurich, Department of Computer Science, Systems Group, 2008. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=418.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Thiagarajan, Arvind. "Representing and querying regression models in a relational database management system." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/42254.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
Includes bibliographical references (p. 77-79).
Curve fitting is a widely employed, useful modeling tool in several financial, scientific, engineering and data mining applications, and in applications like sensor networks that need to tolerate missing or noisy data. These applications need to both fit functions to their data using regression, and pose relational-style queries over regression models. Unfortunately, existing DBMSs are ill suited for this task because they do not include support for creating, representing and querying functional data, short of brute-force discretization of functions into a collection of tuples. This thesis describes FunctionDB, a novel DBMS that extends the state of the art. FunctionDB treats functions output by regression as first-class citizens that can be queried declaratively and manipulated like traditional database relations. The key contributions of FunctionDB are a compact, algebraic representation for regression models as piecewise functions, and an algebraic query processor that executes declarative queries directly on this representation as combinations of algebraic operations like function inversion, zero finding and symbolic integration. FunctionDB is evaluated on two real world data sets: measurements from a temperature sensor network, and traffic traces from cars driving on Boston roads. The results show that operating in the functional domain has substantial accuracy advantages (over 15% for some queries) and order of magnitude (10x-100x) performance gains over existing approaches that represent models as discrete collections of points. The thesis also describes an algorithm to maintain regression models online, as new raw data is inserted into the system. The algorithm supports a sustained insertion rate of the order of a million records per second, while generating models no less compact than a clairvoyant (offline) strategy.
by Arvind Thiagarajan.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

24

Fink, Robert D. "Evaluation of relational algebra queries on probabilistic databases : tractability and approximation." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:b2188d19-ce55-44ae-bd20-7d50ea6f519b.

Full text

Abstract:

Query processing is a core task in probabilistic databases: Given a query and a database that encodes uncertainty in data by means of probability distributions, the problem is to compute possible query answers together with their respective probabilities of being correct. This thesis advances the state of the art in two aspects of query processing in probabilistic databases: complexity analysis and query evaluation techniques. A dichotomy is established for non-repeating, con- junctive relational algebra queries with negation that separates #P-hard queries from those with PTIME data complexity. A framework for computing proba- bilities of relational algebra queries is presented; the probability computation algorithm is based on decomposition methods and provides exact answers in the case of exhaustive decompositions, or anytime approximate answers with absolute or relative error guarantees in the case of partial decompositions. The framework is extended to queries with aggregation operators. An experimental evaluation of the proposed algorithms’ implementations within the SPROUT query engine complements the theoretical results. The SPROUT² system uses this query engine to compute answers to queries on uncertain, tabular Web data.

APA, Harvard, Vancouver, ISO, and other styles

25

Edemar, Fredrik. "The Performance of a Relational Database System for a Data Stream Management System Benchmark." Thesis, Uppsala University, Department of Information Technology, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-122642.

Full text

Abstract:

In recent years the interest in data stream management systems (DSMS) has grown. They are characterized by the processing of continuous, high-volume, and possibly time-varying data streams. Linear Road Benchmark (LRB) is an example of a datastream benchmark application that handles variable toll charges in highways in a fictional traffic system.

In this Thesis the performance of LRB implemented using the relational database MySQL is investigated. The implementation is called SCSQ-MySQL and is executed from the DSMS SCSQ. In LRB the L-rating stands for how many highways a benchmarked DSMS can handle and is used to compare the performance of DSMSs. L=0.5 (one highway in one direction) was achieved with SCSQ-MySQL executed on a single node.

APA, Harvard, Vancouver, ISO, and other styles

26

Burghardt, Josef. "Database system for teaching German." Virtual Press, 1992. http://liblink.bsu.edu/uhtbin/catkey/834506.

Full text

Abstract:

It is not revolutionary to say that repetition and practical experience is a very important aspect in learning about and understanding a topic. This is especially true for languages, particularly from the point of view of vocabulary.Like in many other processes that deal with gaining knowledge, studying foreign words involves a lot of side work: For instance the selection of words, or their presentation for the actual training.The purpose of this thesis is to automate the study of vocabulary. To do so, an intelligent software package was developed. Divided into three parts the project takes into account the aspects from the language point of view, from the studying point of view, and from the computer science point of view.The fundamental idea to accomplish the goal is a relational database system. It is utilized by software programs that solve their tasks in respect to data management, data manipulation, storage and retrieval, in an efficient way.The system is developed for English speaking persons studying German as a foreign language. And with every language having its own nature, it naturally influences all levels and aspects of design and utilization of the database.l:
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

27

Fung, Charles. "An extended relational data base management system for engineering design /." Online version of thesis, 1986. http://hdl.handle.net/1850/8807.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Salitsky, George J. "A prototype semantic integrity front end expert system for a relational database." Thesis, Monterey, California. Naval Postgraduate School, 1991. http://hdl.handle.net/10945/26716.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Ramani, Ramasubramanian. "A toolkit for managing XML data with a relational database management system." [Gainesville, Fla.] : University of Florida, 2001. http://etd.fcla.edu/etd/uf/2001/anp1308/Thesis.pdf.

Full text

Abstract:

Thesis (M.S.)--University of Florida, 2001.
Title from first page of PDF file. Document formatted into pages; contains x, 54 p.; also contains graphics. Vita. Includes bibliographical references (p. 50-53).

APA, Harvard, Vancouver, ISO, and other styles

30

Brand, Jacobus Edwin. "An instrument analysis system based on a modern relational database and distributed software architecture." Thesis, Stellenbosch : Stellenbosch University, 2003. http://hdl.handle.net/10019.1/53269.

Full text

Abstract:

Thesis (MBA)--Stellenbosch University, 2003.
ENGLISH ABSTRACT: This document discusses the development of a personal computer based financial instrument analysis system, based on the information from a relatively old sequential file based data source. The aim is to modernise the system to use the latest software and data storage technology. The principles used for the design of the system are discussed in Chapter 2. Principles for the development of relational databases are discussed, where after the development of personal computer based software architecture is discussed, to explain the choices made in the design of the system. Chapter 3 discusses the design and implementation of the system in more detail, based on the principles discussed in Chapter 2. Recommendations include a possible shift in architectural layout as well as recommendations for expansion of both the data stored and the analysis performed on the information.
AFRIKAANSE OPSOMMING: Hierdie dokument bespreek die ontwikkeling van ‘n persoonlike rekenaar gebaseerde finansiële instrument analise stelsel, gebaseer op inligting uit ‘n relatiewe ou sekwensiële leêr gebaseerde databron. Die doel is om die stelsel te moderniseer om sodoende van die nuutste sagteware en hardeware tegnologie gebruik te maak. Die beginsels wat gebruik is vir die ontwerp van die stelsel word kortliks in Hoofstuk 2 bespreek. Die beginsels vir die ontwerp van ‘n relasionele databasis word bespreek. Hierna word die ontwikkeling van persoonlike rekenaar gebaseerde sagteware argitektuur bespreek om meer lig te werp op die keuses wat geneem is met ontwerp van die stelsel se argitektuur. Hoofstuk 3 bespreek die ontwerp en implementering van die stelsel in meer detail, gebaseer op die beginsels bespreek in Hoofstuk 2. Voorstelle vir verbetering van die stelsel sluit in detail veranderings aan die argitektuur van die stelsel, sowel as voorstelle vir die uitbreiding van die stelsel wat betref tipe data wat gestoor word en en die analitiese vermoëns van die stelsel.

APA, Harvard, Vancouver, ISO, and other styles

31

Johnson, Daryl G. "An image storage system using a relational database management system to facilitate picture data handling /." Online version of thesis, 1987. http://hdl.handle.net/1850/10182.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Colón, Kevin. "Development of a prototype relational database system for managing Fleet Battle Experiment data /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA380771.

Full text

Abstract:

Thesis (M.S. in Information Technology Management)--Naval Postgraduate School, June 2000.
Thesis advisors: Sengupta, Kishore ; Kamel, Magdi N. "June 2000." Includes bibliographical references (p. 239). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

33

Colón, Kevin. "Development of a Prototype Relational Database System for Managing Fleet Battle Experiment Data." Thesis, Monterey, California. Naval Postgraduate School, 2000. http://hdl.handle.net/10945/14840.

Full text

Abstract:

Approved for public release; distribution is unlimited.
This research develops a prototype relational database system for storing and managing Fleet Battle Experiment (FBE) data. It is the first step in constructing a knowledge-base system for such data. The objective is to create a relational database capable of generating information from past experiments for analysis and lessons learned to benefit future experiments. Research methodology included literature research of application development methodologies and database systems, as well as observing a FBE and gathering system requirements information from personnel that plan, configure, and participate in FBEs and war games. Development of the system involved designing a schema (data model) that consists of entities, attributes, and relationships of the FBE environment. The data model is transaction- (event-) based and concentrates on information flow in order to categorize and store the data. These events provide the logical links between the identified entities and the capability to query the system for desired information. Finally, a prototype application against the data model was developed to facilitate data entry, modification, and querying.

APA, Harvard, Vancouver, ISO, and other styles

34

Shah, Hanifa Unisa. "The implementation of a functional query language front-end to a relational database system." Thesis, Aston University, 1989. http://publications.aston.ac.uk/10652/.

Full text

Abstract:

Database systems have a user interface one of the components of which will normally be a query language which is based on a particular data model. Typically data models provide primitives to define, manipulate and query databases. Often these primitives are designed to form self-contained query languages. This thesis describes a prototype implementation of a system which allows users to specify queries against the database in a query language whose primitives are not those provided by the actual model on which the database system is based, but those provided by a different data model. The implementation chosen is the Functional Query Language Front End (FQLFE). This uses the Daplex functional data model and query language. Using FQLFE, users can specify the underlying database (based on the relational model) in terms of Daplex. Queries against this specified view can then be made in Daplex. FQLFE transforms these queries into the query language (Quel) of the underlying target database system (Ingres). The automation of part of the Daplex function definition phase is also described and its implementation discussed.

APA, Harvard, Vancouver, ISO, and other styles

35

Nayeem, Fatima, and M. Vijayakamal. "Policies Based Intrusion Response System for DBMS." IJCSN, 2012. http://hdl.handle.net/10150/271494.

Full text

Abstract:

Relational databases are built on Relational Model proposed by Dr. E. F. Codd. The relational model has become a consistent and widely used DBMS in the world. The databases in this model are efficient in storing and retrieval of data besides providing authentication through credentials. However, there might be many other attacks apart from stealing credentials and intruding database. Adversaries may always try to intrude into the relational database for monetary or other gains [1]. The relational databases are subjected to malicious attacks as they hold the valuable business data which is sensitive in nature. Monitoring such database continuously is a task which is inevitable keeping the importance of database in mind. This is a strategy that is in top five database strategies as identified by Gartner research which are meant for getting rid of data leaks in organizations [2]. There are regulations from governments like US with respect to managing data securely. The data management like HIAPP, GLBA, and PCI etc. is mentioned in the regulations as examples.
Intrusion detection systems play an important role in detecting online intrusions and provide necessary alerts. Intrusion detection can also be done for relational databases. Intrusion response system for a relational database is essential to protect it from external and internal attacks. We propose a new intrusion response system for relational databases based on the database response policies. We have developed an interactive language that helps database administrators to determine the responses to be provided by the response system based on the malicious requests encountered by relational database. We also maintain a policy database that maintains policies with respect to response system. For searching the suitable policies algorithms are designed and implemented. Matching the right policies and policy administration are the two problems that are addressed in this paper to ensure faster action and prevent any malicious changes to be made to policy objects. Cryptography is also used in the process of protecting the relational database from attacks. The experimental results reveal that the proposed response system is effective and useful.

APA, Harvard, Vancouver, ISO, and other styles

36

Hylock, Ray Hales. "Beyond relational: a database architecture and federated query optimization in a multi-modal healthcare environment." Diss., University of Iowa, 2013. https://ir.uiowa.edu/etd/2526.

Full text

Abstract:

Over the past thirty years, clinical research has benefited substantially from the adoption of electronic medical record systems. As deployment has increased, so too has the number of researchers seeking to improve the overall analytical environment by way of tools and models. Although much work has been done, there are still many uninvestigated areas; two of which are explored in this dissertation. The first pertains to the physical storage of the data itself. There are two generally accepted storage models: relational and entity-attribute-value (EAV). For clinical data, EAV systems are preferred due to their natural way of managing many-to-many relationships, sparse attributes, and dynamic processes along with minimal conversion effort and reduction in federation complexities. However, the relational database management systems on which they are implemented, are not intended to organize and retrieve data in this format; eroding their performance gains. To combat this effect, we present the foundation for an EAV Database Management System (EDBMS). We discuss data conversion methodologies, formulate the requisite metadata and partitioned type-sensing index structures, and provide detailed runtime and experimental analysis with five extant methods. Our results show that the prototype, EAVDB, reduces space and conversion requirements while enhancing overall query performance. The second topic concerns query performance in a federated environment. One method used to decrease query execution time, is to pre-compute and store "beneficial" queries (views). The View Selection Problem (VSP) identifies these views subject to resource constraints. A federated model, however, has yet to be developed. In this dissertation, we submit three advances in view materialization. First, a more robust optimization function, the Minimum-Maintenance View Selection Problem (MMVSP), is derived by combining existing approaches. Second, the Federated View Selection Problem (FVSP), built upon the MMVSP, and federated data cube lattice are formalized. The FVSP allows for multiple querying nodes, partial and full materialization, and data propagation constriction. The latter two are shown to greatly reduce the overall number of valid solutions within the solution space and thus a novel, multi-tiered approach is given. Lastly, EAV materialization, which is introduced in this dissertation, is incorporated into an expanded, multi-modal variant of the FVSP. As models and heuristics for both the federated and EAV VSP, to the best of our knowledge, do not exist, this research defines two new branches of data warehouse optimization. Coupled with our EDBMS design, this dissertation confronts two main challenges associated with clinical data warehousing and federation.

APA, Harvard, Vancouver, ISO, and other styles

37

Walldén, Marcus, and Aylin Özkan. "A graph database management system for a logistics-related service." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-205184.

Full text

Abstract:

Higher demands on database systems have lead to an increased popularity of certain database system types in some niche areas. One such niche area is graph networks, such as social networks or logistics networks. An analysis made on such networks often focus on complex relational patterns that sometimes can not be solved efficiently by traditional relational databases, which has lead to the infusion of some specialized non-relational database systems. Some of the database systems that have seen a surge in popularity in this area are graph database systems. This thesis presents a prototype of a logistics network-related service using a graph database management system called Neo4j, which currently is the most popular graph database management system in use. The logistics network covered by the service is based on existing data from PostNord, Sweden’s biggest provider of logistics solutions, and primarily focuses on customer support and business to business. By creating a prototype of the service this thesis strives to indicate some of the positive and negative aspects of a graph database system, as well as give an indication of how a service using a graph database system could be created. The results indicate that Neo4j is very intuitive and easy to use, which would make it optimal for prototyping and smaller systems, but due to the used evaluation method more research in this area would need to be carried out in order to confirm these conclusions.
Högre krav på databassystem har lett till en ökad popularitet för vissa databassystemstyper i några nischområden. Ett sådant nischområde är grafnätverk, såsomsociala nätverk eller logistiknätverk. Analyser på grafnätverk fokuserar ofta påkomplexa relationsmönster som ibland inte kan lösas effektivt av traditionella relationsdatabassystem, vilket har lett till att vissa specialiserade icke-relationella databassystem har blivit populära alternativ. Många av de populära databassystemen inom detta område är grafdatabassystem. Detta arbete presenterar en prototyp av en logistiknätverksrelaterad tjänst som använder sig av ett grafdatabashanteringssystem som heter Neo4j, vilket är det mest använda grafdatabashanteringssystemet. Logistiknätverket som täcks av tjänsten är baserad på existerande data från PostNord, Sveriges ledande leverantör av logistiklösningar, och fokuserar primärt på kundsupport och företagsrelaterad analys. Genom att skapa en prototyp av tjänsten strävar detta arbete efter att uppvisa vissa av de positiva och negativa aspekterna av ett grafdatabashanteringssystem samt att visa hur en tjänst kan skapas genom att använda ett grafdatabashanteringssystem. Resultaten indikerar att Neo4j är väldigt intuitivt och lättanvänt, vilket skulle göra den optimal för prototyping och mindre system, men på grund av den använda evalueringsmetoden så behöver mer forskning inom detta område utföras innan dessa slutsatser kan bekräftas.

APA, Harvard, Vancouver, ISO, and other styles

38

Hargrove, James Phillip, and C. Thomas Wu. "Design and implementation of an interface editor for the Amadeus multi-relational database front-end system." Thesis, Monterey, California: Naval Postgraduate School, 1993. http://hdl.handle.net/10945/24147.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Lai, Sen-Hao. "CLIPSBase--a real-time relational database for the "principal investigator-in-a-box" (PI) expert system." Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/42480.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Jia, Hao. "A web application for Medasolution Healthcare Company customer service system." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2612.

Full text

Abstract:

Medasolution is a virtual company designed by the author to handle Medicare insurance business. The web application (which uses ASP.net and SQL Server 2000) facilitates communication between Medasolution and all its clients: members, employers, brokers, and medicare providers through separate web pages based on their category levels. The program incorporates security so that it follows government privacy rules regarding client information.

APA, Harvard, Vancouver, ISO, and other styles

41

Hodgkins, Richard E. "The design and implementation of ZTRAX : a training, readiness and flight hour relational database management tracking system." Thesis, Monterey, California. Naval Postgraduate School, 1992. http://hdl.handle.net/10945/23855.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Johnston, Richard Karl. "The relational-to-object-oriented cross-model accessing capability in a multi-model and multi-lingual database system." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from the National Technical Information Service, 1993. http://handle.dtic.mil/100.2/ADA264911.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Macák, Martin. "Editor relačních tabulek." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2008. http://www.nusl.cz/ntk/nusl-412810.

Full text

Abstract:

This thesis deals with aspects of using the common, universal relational table editor as a simple information system, which would be fully independent on the underlying database system and partially independent on the underlying's database schema. One part of this thesis deals with potential of using such universal information system to create a framework to allow fast and easy development of small and medium information systems. The practical part of this thesis is the application, which implements the basics of simple relational table editor, which is fully independent on the underlying database provider and schema and servers as the demonstrative table editor.

APA, Harvard, Vancouver, ISO, and other styles

44

Vařacha, Jan. "Návrh systému pro účely administrativy fotbalového svazu." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2015. http://www.nusl.cz/ntk/nusl-224864.

Full text

Abstract:

This master’s thesis aims to design a suitable system based on a relational database for the purposes of administrative activities of the District Football Association. The created relational database should be managed primarily by the association secretary, to a lesser extent by members of association specialist committees. The database should be able to contain all the information and records which have been dealing with the paper form so far (match fixtures, awarding fines, clubs’ fees, players’ punishments, etc.). Routine administrative work, such as reading, inserting, deleting and updating the data will be carried out through the web interface and should not place any special demands on the level of users computer skills.

APA, Harvard, Vancouver, ISO, and other styles

45

Štulpa, Adam. "Úložiště Gentoo Portage jako souborový systém založený na relační databázi." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237167.

Full text

Abstract:

The thesis deals with implementation of a program which can, through the use of FUSE library, make data accessible in the relational database like the classical Gentoo Portage storage. First, the reader of the thesis becomes familiar with FUSE library itself. After that, the new data model is built based on the analysis of the Portage structure. The new model emphasizes especially dependencies of packages. The key implementation issues are also described in the next part. Finally, the thesis assesses outcomes achieved including comparison with standard Portage implementation and classical file system. The other possibilities of the project development are considered as well.

APA, Harvard, Vancouver, ISO, and other styles

46

Nečas, Jaroslav. "Využití systémového katalogu pro správu databází." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217512.

Full text

Abstract:

The purpose of this project is to create a design and subsequently the web application for a database management which uses the system catalogue of the Microsoft SQL database system. The introduction deals with the principle of the relational databases and includes the list of the most widespread database systems. The next chapter of the theoretical part describes the syntax of the SQL query language, and the next chapter deals with the properties of the system catalogue which were utilized. Finally, the last of the theoretical chapters is centred on the .NET platform and its technologies – particularly the ASP.NET and the ADO.NET technologies. The former is used for creating dynamical web pages, and the latter is an object library used for the data access. The practical part of this work comprises the web application scheme on which is the final web application based. The most emphasized issues in this part are the security and the supposed program design of the web application. The final part of the work contains a description of the finished web application, especially the configuration and the functions which the application provides to a user. And finally, the whole project is briefly evaluated in the conclusion.

APA, Harvard, Vancouver, ISO, and other styles

47

Lochner, Jan-Hendrik [Verfasser], Joachim [Akademischer Betreuer] Biskup, and Gabriele [Gutachter] Kern-Isberner. "An Effective and Efficient Inference Control System for Relational Database Queries / Jan-Hendrik Lochner. Betreuer: Joachim Biskup. Gutachter: Gabriele Kern-Isberner." Dortmund : Universitätsbibliothek Dortmund, 2011. http://d-nb.info/1103472437/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Mešková, Lucia. "Návrh systému pro evidenci požárů." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2016. http://www.nusl.cz/ntk/nusl-241494.

Full text

Abstract:

The aim of this thesis is to design a system for the purposes of registry of fires of the Fire and rescue department of the Slovak Republic. System should serve to members of the department for administration of records about all fires within the Žilina Region and it should work through the web interface. Emphasis will be placed on using frameworks with the aim to simplify the process of development of the system.

APA, Harvard, Vancouver, ISO, and other styles

49

Solihin, Wawan. "A simplified BIM data representation using a relational database schema for an efficient rule checking system and its associated rule checking language." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/54831.

Full text

Abstract:

Efforts to automate building rule checking have not brought us anywhere near to the ultimate goal to fully automate the rule checking process. With the advancement in BIM and the latest tools and computing capability, we have what is necessary to achieve it. And yet challenges still abound. This research takes a holistic approach to solve the issue by first examining the rule complexity and its logic structure. Three major aspects of the rules are addressed in this research. The first is a new approach to transform BIM data into a simple database schema and to make it easily query-able by adopting the data warehouse approach. Geometry and spatial operations are also commonly needed for automating rules, and therefore the second approach is to integrate these into a database in the form of multiple representations. The third is a standardized rule language that leverages the database query integrated with its geometry and spatial query capability, called BIMRL. It is designed for a non-programmatic approach to the rule definitions that is suitable for typical rule experts. The rule definition takes a form of triplet command: CHECK – EVALUATE – ACTION statement that can be chained to support more complex rules. A prototype system has been developed as a proof-of-concept using selected rules taken from various sources to demonstrate the validity of the approach to solve the challenges of automating the building rule checking.

APA, Harvard, Vancouver, ISO, and other styles

50

Matus, Castillejos Abel, and n/a. "Management of Time Series Data." University of Canberra. Information Sciences & Engineering, 2006. http://erl.canberra.edu.au./public/adt-AUC20070111.095300.

Full text

Abstract:

Every day large volumes of data are collected in the form of time series. Time series are collections of events or observations, predominantly numeric in nature, sequentially recorded on a regular or irregular time basis. Time series are becoming increasingly important in nearly every organisation and industry, including banking, finance, telecommunication, and transportation. Banking institutions, for instance, rely on the analysis of time series for forecasting economic indices, elaborating financial market models, and registering international trade operations. More and more time series are being used in this type of investigation and becoming a valuable resource in today�s organisations. This thesis investigates and proposes solutions to some current and important issues in time series data management (TSDM), using Design Science Research Methodology. The thesis presents new models for mapping time series data to relational databases which optimise the use of disk space, can handle different time granularities, status attributes, and facilitate time series data manipulation in a commercial Relational Database Management System (RDBMS). These new models provide a good solution for current time series database applications with RDBMS and are tested with a case study and prototype with financial time series information. Also included is a temporal data model for illustrating time series data lifetime behaviour based on a new set of time dimensions (confidentiality, definitiveness, validity, and maturity times) specially targeted to manage time series data which are introduced to correctly represent the different status of time series data in a timeline. The proposed temporal data model gives a clear and accurate picture of the time series data lifecycle. Formal definitions of these time series dimensions are also presented. In addition, a time series grouping mechanism in an extensible commercial relational database system is defined, illustrated, and justified. The extension consists of a new data type and its corresponding rich set of routines that support modelling and operating time series information within a higher level of abstraction. It extends the capability of the database server to organise and manipulate time series into groups. Thus, this thesis presents a new data type that is referred to as GroupTimeSeries, and its corresponding architecture and support functions and operations. Implementation options for the GroupTimeSeries data type in relational based technologies are also presented. Finally, a framework for TSDM with enough expressiveness of the main requirements of time series application and the management of that data is defined. The framework aims at providing initial domain know-how and requirements of time series data management, avoiding the impracticability of designing a TSDM system on paper from scratch. Many aspects of time series applications including the way time series data are organised at the conceptual level are addressed. The central abstraction for the proposed domain specific framework is the notions of business sections, group of time series, and time series itself. The framework integrates comprehensive specification regarding structural and functional aspects for time series data management. A formal framework specification using conceptual graphs is also explored.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Relational database system'

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