Relevant bibliographies by topics / Relational database management systems / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Relational database management systems.

Dissertations / Theses on the topic 'Relational database management systems'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 February 2022

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Relational database management systems.'

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

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

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

1

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
2

Zou, Beibei 1974. "Data mining with relational database management systems." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82456.

Full text
Abstract:
With the increasing demands of transforming raw data into information and knowledge, data mining becomes an important field to the discovery of useful information and hidden patterns in huge datasets. Both machine learning and database research have made major contributions to the field of data mining. However, there is still little effort made to improve the scalability of algorithms applied in data raining tasks. Scalability is crucial for data mining algorithms, since they have to handle large datasets quite often. In this thesis we take a step in this direction by extending a popular machine learning software, Weka3.4, to handle large datasets that can not fit into main memory by relying on relational database technology. Weka3.4-DB is implemented to store the data into and access the data from DB2 with a loose coupling approach in general. Additionally, a semi-tight coupling is applied to optimize the data manipulation methods by implementing core functionalities within the database. Based on the DB2 storage implementation, Weka3.4-DB achieves better scalability, but still provides a general interface for developers to implement new algorithms without the need of database or SQL knowledge.
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

Ibrahim, Karim. "Management of Big Annotations in Relational Database Management Systems." Digital WPI, 2014. https://digitalcommons.wpi.edu/etd-theses/272.

Full text
Abstract:
Annotations play a key role in understanding and describing the data, and annotation management has become an integral component in most emerging applications such as scientific databases. Scientists need to exchange not only data but also their thoughts, comments and annotations on the data as well. Annotations represent comments, Lineage of data, description and much more. Therefore, several annotation management techniques have been proposed to efficiently and abstractly handle the annotations. However, with the increasing scale of collaboration and the extensive use of annotations among users and scientists, the number and size of the annotations may far exceed the size of the original data itself. However, current annotation management techniques don’t address large scale annotation management. In this work, we propose three chapters to that tackle the Big annotations from three different perspectives (1) User-Centric Annotation Propagation, (2) Proactive Annotation Management and (3) InsightNotes Summary-Based Querying. We capture users' preferences in profiles and personalizes the annotation propagation at query time by reporting the most relevant annotations (per tuple) for each user based on time plan. We provide three Time-Based plans, support static and dynamic profiles for each user. We support a proactive annotation management which suggests data tuples to be annotated in case new annotation has a reference to a data value and user doesn’t annotate the data precisely. Moreover, we provide an extension on the InsightNotes: Summary-Based Annotation Management in Relational Databases by adding query language that enable the user to query the annotation summaries and add predicates on the annotation summaries themselves. Our system is implemented inside PostgreSQL.
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
Abstract:
This thesis is concerned with the design and im plementation of a Relational Multimedia Database System, in short RMDBS. RMDBS is designed to efficiently use storage space and manipulate various kinds of data; attribute data, bit-m apped pictures, and program s in binary code. RMDBS is an integrated system which enables the user to manage and control operations on the different forms of data in a user friendly manner. This means that even nonexperienced users can work with the system. The work described in this thesis is novel in that a true multimedia database has been implemented within the framework of a traditional relational DBMS. Previous work in this area has concentrated either in building data base management systems for storing picture-based data or multimedia databases which are not true data base management systems. RMDBS is implemented using the Revelation data base management system.
APA, Harvard, Vancouver, ISO, and other styles
7

Sayli, Ayla. "Semantic query optimization in relational database management systems." Thesis, University of Essex, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.284608.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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
9

Floratos, Sofoklis. "High Performance Iterative Processing in Relational Database Management Systems." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1605909940057503.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kolonko, Kamil. "Performance comparison of the most popular relational and non-relational database management systems." Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-16112.

Full text
Abstract:
Context. Database is an essential part of any software product. With an emphasis on application performance, database efficiency becomes one of the key factors to analyze in the process of technology selection. With a development of new data models and storage technologies, the necessity for a comparison between relational and non-relational database engines is especially evident in the software engineering domain. Objectives. This thesis investigates current knowledge on database performance measurement methods, popularity of relational and non-relational database engines, defines characteristics of databases, approximates their average values and compares the performance of two selected database engines.Methods. In this study a number of research methods are used, including literature review, a review of Internet sources, and an experiment. Literature datasets used in the research incorporate over 100 sources including IEEE Xplore and ACM Digital Library. YCSB Benchmark was used as a direct performance comparison method in an experiment to compare OracleDB’s and MongoDB’s performance. Results. A list of database performance measurement methods has been defined as a result of the literature review. Two most popular database management engines, one relational and one non-relational has been identified. A set of database characteristics and a database performance comparison methodology has been identified. Performance of two selected database engines has been measured and compared. Conclusions. Performance comparison between two selected database engines indicated superior results for MongoDB under the experimental conditions. This database proved to be more efficient in terms of average operation latency and throughput for each of the measured workloads. OracleDB however, presented stable results in each of the category leaving the final choice of database to the specifics of a software engineering project. Activities required for the definition of database performance comparison methodology proved to be challenging and require study extension.
APA, Harvard, Vancouver, ISO, and other styles
11

Nguyen, Long Phi M. Eng Massachusetts Institute of Technology. "Exploring learned join algorithm selection in relational database management systems." Thesis, Massachusetts Institute of Technology, 2021. https://hdl.handle.net/1721.1/130706.

Full text
Abstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, February, 2021
Cataloged from the official PDF of thesis.
Includes bibliographical references (page 81).
Query optimizers, crucial components of relational database management systems, are responsible for generating efficient query execution plans. Despite many advances in the database community over the last few decades, most popular relational database management systems today still use cost-based optimizers that do not always model the underlying data's characteristics accurately. These cost-based optimizers brutally slow down a query if they make even one gross underestimate of a database table's cardinality. In this work, we improve on native cost-based optimizer performance by identifying the most ideal join algorithms for query execution plans in two popular relational database management systems, PostgreSQL and Microsoft SQL. First, we gather baseline query execution times for the entire IMDb Join Order Benchmark under different subsets of usable join algorithms to show that no subset yields high performance across all queries. We then show that it is feasible to use deep reinforcement learning to choose one of these subsets for each query seen and achieve far better performance on the intensive JOB queries. Finally, we introduce the idea of k-edits, showing results that indicate that for some queries, isolating just 1 "bad" join and changing its join algorithm can yield better performance. Our work suggests that reinforcement learning with both coarse and fine decisions shows huge potential for the future of query optimization and relational database management systems.
by Long Phi Nguyen.
M. Eng.
M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
APA, Harvard, Vancouver, ISO, and other styles
12

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
13

Trissl, Silke. "Cost-based optimization of graph queries in relational database management systems." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2012. http://dx.doi.org/10.18452/16544.

Full text
Abstract:
Graphen sind in vielen Bereichen des Lebens zu finden, wobei wir speziell an Graphen in der Biologie interessiert sind. Knoten in solchen Graphen sind chemische Komponenten, Enzyme, Reaktionen oder Interaktionen, die durch Kanten miteinander verbunden sind. Eine effiziente Ausführung von Graphanfragen ist eine Herausforderung. In dieser Arbeit präsentieren wir GRIcano, ein System, das die effiziente Ausführung von Graphanfragen erlaubt. Wir nehmen an, dass Graphen in relationalen Datenbankmanagementsystemen (RDBMS) gespeichert sind. Als Graphanfragesprache schlagen wir eine erweiterte Version der Pathway Query Language (PQL) vor. Der Hauptbestandteil von GRIcano ist ein kostenbasierter Anfrageoptimierer. Diese Arbeit enthält Beiträge zu allen drei benötigten Komponenten des Optimierers, der relationalen Algebra, Implementierungen und Kostenmodellen. Die Operatoren der relationalen Algebra sind nicht ausreichend, um Graphanfragen auszudrücken. Daher stellen wir zuerst neue Operatoren vor. Wir schlagen den Erreichbarkeits-, Distanz-, Pfadlängen- und Pfadoperator vor. Zusätzlich geben wir Regeln für die Umformung von Ausdrücken an. Des Weiteren präsentieren wir Implementierungen für jeden vorgeschlagenen Operator. Der Hauptbeitrag ist GRIPP, eine Indexstruktur, die die effiziente Ausführung von Erreichbarkeitsanfragen auf sehr großen Graphen erlaubt. Wir zeigen, wie GRIPP und die rekursive Anfragestrategie genutzt werden können, um Implementierungen für alle Operatoren bereitzustellen. Die dritte Komponente von GRIcano ist das Kostenmodell, das Kardinalitätsabschätzungen der Operatoren und Kostenfunktionen für die Implementierungen benötigt. Basierend auf umfangreichen Experimenten schlagen wir in dieser Arbeit Funktionen dafür vor. Der neue Ansatz unserer Kostenmodelle ist, dass die Funktionen nur Kennzahlen der Graphen verwenden. Abschließend zeigen wir die Wirkungsweise von GRIcano durch Beispielanfragen auf echten biologischen Graphen.
Graphs occur in many areas of life. We are interested in graphs in biology, where nodes are chemical compounds, enzymes, reactions, or interactions that are connected by edges. Efficiently querying these graphs is a challenging task. In this thesis we present GRIcano, a system that efficiently executes graph queries. For GRIcano we assume that graphs are stored and queried using relational database management systems (RDBMS). We propose an extended version of the Pathway Query Language PQL to express graph queries. The core of GRIcano is a cost-based query optimizer. This thesis makes contributions to all three required components of the optimizer, the relational algebra, implementations, and cost model. Relational algebra operators alone are not sufficient to express graph queries. Thus, we first present new operators to rewrite PQL queries to algebra expressions. We propose the reachability, distance, path length, and path operator. In addition, we provide rewrite rules for the newly proposed operators in combination with standard relational algebra operators. Secondly, we present implementations for each proposed operator. The main contribution is GRIPP, an index structure that allows us to answer reachability queries on very large graphs. GRIPP has advantages over other existing index structures, which we review in this work. In addition, we show how to employ GRIPP and the recursive query strategy as implementation for all four proposed operators. The third component of GRIcano is the cost model, which requires cardinality estimates for operators and cost functions for implementations. Based on extensive experimental evaluation of our proposed algorithms we present functions to estimate the cardinality of operators and the cost of executing a query. The novelty of our approach is that these functions only use key figures of the graph. We finally present the effectiveness of GRIcano using exemplary graph queries on real biological networks.
APA, Harvard, Vancouver, ISO, and other styles
14

Holze, Marc Verfasser], and Norbert [Akademischer Betreuer] [Ritter. "Self-Management Concepts for Relational Database Systems / Marc Holze. Betreuer: Norbert Ritter." Hamburg : Staats- und Universitätsbibliothek Hamburg, 2012. http://d-nb.info/1020931094/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Dudgikar, Mahesh. "A layered optimizer for mining association rules over relational database management systems." [Florida] : State University System of Florida, 2000. http://etd.fcla.edu/etd/uf/2000/ana6135/Master.pdf.

Full text
Abstract:
Thesis (M.S.)--University of Florida, 2000.
Title from first page of PDF file. Document formatted into pages; contains xiii, 94 p.; also contains graphics. Vita. Includes bibliographical references (p. 92-93).
APA, Harvard, Vancouver, ISO, and other styles
16

Frost, R. A. "The binary-relational view and aspects of database and knowledge base systems work." Thesis, University of Strathclyde, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.381496.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Pinto, Paulo Jorge Gonçalves. "Definition of cross-domain indexes and ordering functions in relational algebra and its usage in relational database management systems." Thesis, De Montfort University, 2010. http://hdl.handle.net/2086/6528.

Full text
Abstract:
In this thesis, a mathematical model that describes a “Unique Constraint Domain” is defined. Following, the “Ordered Unique Constraint Domain” is also mathematically defined. With those definitions, a cross-domain ordering is also defined. Then it is shown that relationships between tables in a Relational Database Management System can be defined in other forms than the usual ways, using cross-domain indexes, based in cross-domain ordering. It is shown that all foreign keys in a database can be transformed in indexes with the benefit of speeding data access. It is also shown that this technique is consistent with actual modeling techniques. It is shown how the index structure, with indexes defined as functions, can provide support for relationship roles. In addition, it is also shown how this can provide support for more than two tables in one relationship and for supporting special sorting order. The addition of a mathematical function to a relation that could sort that relation, demonstrating that the closure property of relations are still kept, shows that this mathematical model can be used as extension of the base relational model. Next, it is shown that with this new technique, commercial database engines should not degrade performance because all supporting structures are already present and, in some cases, a better performance might be achieved. Code for a prototype based in a Commercial Database Engine has been added, as an annex, to show how this new technique can be used.
APA, Harvard, Vancouver, ISO, and other styles
18

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
19

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

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

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

Chao, Tian-Jy. "Estimating temporary file sizes for query graphs in distributed relational database systems." Thesis, Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/90921.

Full text
Abstract:
This thesis implements a part of the front-end software, the Optimizer, of the distributed database system being developed at Virginia Tech. The Optimizer generates a strategy for optimal query processing, and it presents and analyzes a given query by means of query trees and query graphs. This thesis develops PASCAL procedures that implement quantitative and qualitative rules to select query graphs requiring minimum communication costs. To develop the rules, the size of the temporary files generated after performing each required operation is estimated. The focus of this work is on the implementation of a new technique for estimating the temporary file sizes. Detailed discussion of this implementation is presented and illustrated with a complete example, followed by a comparison with one of the existing methods proposed by Dwyer.
M.S.
APA, Harvard, Vancouver, ISO, and other styles
22

Fullerton, Godon. "The Development and Implementation of a Benchmark Process for Distributed Relational Database Management Systems." NSUWorks, 1990. http://nsuworks.nova.edu/gscis_etd/530.

Full text
Abstract:
Significant portions of the business oriented information processing performed in the commercial market place are headed towards (or already arrived at) a heavy dependence on Database Management Systems. With that movement under way, our ability to measure, evaluate, and compare different Database Management Systems is dramatically limited. This paper examines the underlying design considerations in developing a system and the current as well as previous attempts at measuring performance in this area. Then an evaluation methodology design to measure and compare distributed system is proposed and tested. The methodology developed will support evaluations and comparisons of entire Distributed Relational Database Management Systems or evaluations of the design and performance of various individual components of those systems.
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

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
25

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
26

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
27

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
28

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
29

Stoler, Moshe. "Query processing optimization for distributed relational database systems: an implementation of a heuristic based algorithm." Master's thesis, Virginia Polytechnic Institute and State University, 1987. http://hdl.handle.net/10919/64491.

Full text
Abstract:
The first step of the program is to input the statistical information concerning the relations of th· database. This information is stored in the log file and the file matrix data structures. Next, the query itself is read and stored in an array called the query matrix. The program examines the various fields of this matrix and decides which relations in the database are necessary to answer the query. For these relations it determines those attributes which should be eliminated and those which should be preserved for further processing. The key attributes are identified and are projected along with the other attributes. After the initial projection is completed the sizes of the new temporary relations are evaluated and stored in the appropriate fields of the file matrix structure. The program then examines that part of the query which contains the various restrictions on the attributes. The values of the attributes are sorted and those values which do not match the restrictions are eliminated from the log file. Again, the sizes of the new relations are estimated according to the method described by Egyhazy et al. [6]. A second projection is performed to eliminate attributes which were required by the selection phase but are not part of the final answer to the query. The remaining relations are those relations which need to be joined to form a relation with the required information. In order to decide upon which relations to join, a special table, the join matrix, is created. This table contains pairs of relations which have common attributes and common values and therefore are joinable. The LP algorithm is used to determine the least expensive join out of all the possible joins. This process is repeated until all of the relations are joined to form a single relation which answers the query. As in the case of projection and selection the size of the temporary relations after each join is estimated. As a last step, we remove the key attributes which helped in joining the files but are not part of the answer to the query.
Master of Engineering
APA, Harvard, Vancouver, ISO, and other styles
30

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
31

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
32

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
33

Buker, David Gordon. "An interface between the GRASS geographic information system and ORACLE relational detabase management system." FIU Digital Commons, 1993. http://digitalcommons.fiu.edu/etd/1819.

Full text
Abstract:
A query and display interface has been developed between the GRASS geographic information system and the SQL-based ORACLE relational database management system (DBMS) . This interface enables multiple non-spatial attributes of GRASS map features to be maintained with the DBMS. GRASS alone is capable of storing only one attribute per feature. The interface allows the user to provide both spatial (GRASS) and non-spatial (SQL) selection criteria for any query. Spatial selection methods include picking items from the GRASS map with a mouse, and specifying areas of interest with user-drawn (via a mouse) polygons and transects. The results of the combined query are displayed both graphically (the selected GRASS map features are highlighted in a graphics window) and textually (the DBMS attribute data are shown in a text display window). Options include creating reclassified maps based on the DBMS output, and updating the attributes retrieved by a query.
APA, Harvard, Vancouver, ISO, and other styles
34

Pieringer, Roland. "Modeling and implementing multidimensional hierarchically structured data for data warehouses in relational database management systems and the implementation into transbase." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=969373791.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Voigt, Hannes. "Flexibility in Data Management." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-136681.

Full text
Abstract:
With the ongoing expansion of information technology, new fields of application requiring data management emerge virtually every day. In our knowledge culture increasing amounts of data and work force organized in more creativity-oriented ways also radically change traditional fields of application and question established assumptions about data management. For instance, investigative analytics and agile software development move towards a very agile and flexible handling of data. As the primary facilitators of data management, database systems have to reflect and support these developments. However, traditional database management technology, in particular relational database systems, is built on assumptions of relatively stable application domains. The need to model all data up front in a prescriptive database schema earned relational database management systems the reputation among developers of being inflexible, dated, and cumbersome to work with. Nevertheless, relational systems still dominate the database market. They are a proven, standardized, and interoperable technology, well-known in IT departments with a work force of experienced and trained developers and administrators. This thesis aims at resolving the growing contradiction between the popularity and omnipresence of relational systems in companies and their increasingly bad reputation among developers. It adapts relational database technology towards more agility and flexibility. We envision a descriptive schema-comes-second relational database system, which is entity-oriented instead of schema-oriented; descriptive rather than prescriptive. The thesis provides four main contributions: (1)~a flexible relational data model, which frees relational data management from having a prescriptive schema; (2)~autonomous physical entity domains, which partition self-descriptive data according to their schema properties for better query performance; (3)~a freely adjustable storage engine, which allows adapting the physical data layout used to properties of the data and of the workload; and (4)~a self-managed indexing infrastructure, which autonomously collects and adapts index information under the presence of dynamic workloads and evolving schemas. The flexible relational data model is the thesis\' central contribution. It describes the functional appearance of the descriptive schema-comes-second relational database system. The other three contributions improve components in the architecture of database management systems to increase the query performance and the manageability of descriptive schema-comes-second relational database systems. We are confident that these four contributions can help paving the way to a more flexible future for relational database management technology.
APA, Harvard, Vancouver, ISO, and other styles
36

Schiller, Oliver [Verfasser], and Bernhard [Akademischer Betreuer] Mitschang. "Supporting multi-tenancy in Relational Database Management Systems for OLTP-style software as a service applications / Oliver Schiller. Betreuer: Bernhard Mitschang." Stuttgart : Universitätsbibliothek der Universität Stuttgart, 2015. http://d-nb.info/1077479506/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Trißl, Silke [Verfasser], Ulf [Akademischer Betreuer] Leser, Johann-Christoph [Akademischer Betreuer] Freytag, and Thorsten [Akademischer Betreuer] Grust. "Cost-based optimization of graph queries in relational database management systems / Silke Trißl. Gutachter: Ulf Leser ; Johann-Christoph Freytag ; Thorsten Grust." Berlin : Humboldt Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2012. http://d-nb.info/1024311309/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

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
39

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
40

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
41

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
42

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
43

Hou, Pingyu. "Customer relationship management for banking system." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2635.

Full text
Abstract:
The purpose of this project is to design, build, and implement a Customer Relationship Management (CRM) system for a bank. CRM BANKING is an online application that caters to strengthening and stabilizing customer relationships in a bank.
APA, Harvard, Vancouver, ISO, and other styles
44

Salap, Seda. "Development Of A Gis-based Monitoring And Management System For Underground Mining Safety." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/3/12609815/index.pdf.

Full text
Abstract:
Mine safety is of paramount concern to the mining industry. The generation of a Geographic Information Systems (GIS) which can administrate relevant spatial data and metadata of underground mining safety efficiently is a very vital issue in this sense. In an effort to achieve a balance of safety and productivity, GIS can contribute to the creation of a safe working environment in underground (U/G) mining. Such a system should serve to a continuous risk analysis and be designed for applications in case of emergency. Concept for safety should require three fundamental components, namely (i) constructive safety
(ii) surveillance and maintenance
and (iii) emergency. The implementation has to be carried out in a Web-Based Geographic Information System. The process comprises first the safety concept as the application domain model and then a conceptual model was generated in terms of Entity- Relationship Diagrams. After the implementation of the logical model a user interface was developed and GIS was tested. Finally, one should deal with the question if it is possible to extend the method of resolution used to a national GIS infrastructure.
APA, Harvard, Vancouver, ISO, and other styles
45

Malaney, Gary Douglas. "The coordination of information in a highly differentiated organization : use of a computerized relational data base system as an integrating device for monitoring graduate education /." The Ohio State University, 1985. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487261919113367.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

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
47

Benbouzid, Chérif. "Integrite semantique et reprise apres panne dans le sgbd rim." Clermont-Ferrand 2, 1988. http://www.theses.fr/1988CLF2D215.

Full text
Abstract:
Etude et implementation des contraintes d'integrite semantiques dans le sgbd relationnel rim. L'accent a ete mis sur les possibilites de specification et de reduction du cout de verification de certains types de contraintes d'integrite. Dans une deuxieme partie, le mecanisme de reprise apres panne est etudie. Dans la version centralisee, il a ete choisi de mettre en place une solution traditionnelle basee sur la journalisation des transactions. En version repartie, une solution originale a ete definie, tenant compte de la particularite de la repartition des donnees, dans le sgbd rim, a savoir la duplication de la derniere photographie sur les differents sites
APA, Harvard, Vancouver, ISO, and other styles
48

Baker, Elizabeth White. "The Impact of Relational Model Bases on Organizational Decision Making: Cases in E-Commerce and Ecological Economics." VCU Scholars Compass, 2006. http://hdl.handle.net/10156/1399.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Gavryliuk, Olga. "Nástroj pro správu dokumentů v managementu projektů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2019. http://www.nusl.cz/ntk/nusl-403822.

Full text
Abstract:
This work deals with electronic document management systems (EDMS) from the perspective of selected knowledge areas of project management processes. The aim of this thesis was to create an EDM system based on an appropriately selected EDM model, which would assist in the management of documents that arise during management processes in selected areas of project management (quality, human resources and communication within the project) with the possibility of extending to other knowledge areas.
APA, Harvard, Vancouver, ISO, and other styles
50

Mhiri, Lotfi. "Utilisation des techniques avancees des bases de donnees pour la representation des informations et des connaissances d'un systeme "intelligent" d'enseignement assiste par ordinateur : bieao." Toulouse 3, 1988. http://www.theses.fr/1988TOU30203.

Full text
Abstract:
L'approche suivie est une approche base de donnees, utilisant plus particulierement les techniques des bases d'informations generalisees et les bases de donnees deductives. Le systeme de gestion de la bieao est compose d'un systeme de gestion de bases de donnees relationnelles et d'extensions declaratives et procedurales permettant ainsi l'exploitation des sous-schemas de la base
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Relational database management systems' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography