There are many different database management systems (DBMSs) on the market today. They all have different strengths and weaknesses. What if all of these different DBMSs could be used together in a heterogeneous network? The purpose of this thesis is to explore ways of connecting the many different DBMSs together. This thesis will explore suitable architectures, features, and performance of such a network. This is all done in the context of Ericsson’s wireless communication network. This has not been done in this context before, and a big part of the thesis is exploring if it is even possible. The result of this thesis shows that it is not possible to find a solution that can fulfill the requirements of such a network in this context

[pt] As principais estratégias de sintonia fina utilizadas por administradores de bancos de dados relacionais são a construção de estruturas de acesso, como índices, índices parciais e visões materializadas, e técnicas como desnormalização e reescrita de consultas. Estas técnicas e estruturas de acesso, juntas ou separadas, podem melhorar o desempenho das consultas submetidas ao banco de dados. O particionamento de tabelas do banco de dados, técnica tradicionalmente utilizada para distribuição de dados, também possui potencial para sintonia fina, pois permite que a varredura das tabelas seja realizada somente nas partições que satisfazem os predicados das consultas. Mesmo em consultas com predicados de seletividade alta, cujos planos de execução frequentemente utilizam índices, o particionamento pode oferecer um benefício ainda maior. Esta dissertação de mestrado propõe avaliar o particionamento como ação de sintonia fina de bancos de dados relacionais e, para tanto, desenvolve heurísticas para seleção de estratégias de particionamento e avaliação do seu benefício. Uma avaliação da qualidade dos resultados obtidos é realizada através de experimentos com um benchmark padrão para este tipo de pesquisa e mostramos que, em certos casos, é vantajoso particionar dados. / [en] The main fine tuning strategies used by relational database administrators are the construction of access structures, such as indexes, partial indexes and materialized views, and techniques such as denormalization and query rewriting. These techniques and access structures, together or separately, can improve the performance of queries submitted to the database. Database partitioning, a technique traditionally used for data distribution, has also the potential for fine tuning, since it allows the scanning of tables to be performed only on partitions that satisfy query predicates. Even in queries with high selectivity predicates, whose execution plans often use indexes, partitioning can offer even greater benefit. This dissertation proposes to evaluate the partitioning as a fine tuning action of relational databases and, for that, develops heuristics for selection of partitioning strategies and evaluation of its benefit. An evaluation of the quality of the results obtained is carried out through experiments with a standard benchmark for this type of research and we have shown that, in certain cases, it is advantageous to partition data.

Syftet med arbetet som beskrivs i denna rapport var att undersöka om den Oracle-baserade laborationsmiljö som användes hos ADIT gick att överföra till MySQL. Oracle är ett komplext system som är krävande att administrera, något som ADIT ansvarat för med egen personal och egen hårdvara och detta var inte idealiskt. I kombination med ett stort intresse från studenter att använda just MySQL vid laborationer hos ADIT beslutades det att man skulle undersöka om MySQL nu var moget att axla den roll som Oracle tidigare haft. Utifrån detta går rapporten igenom vad som behövde göras med det befintliga laborationsmaterialet. En introduktion till relations¬modellen och SQL samt förklaringar av skillnader i features mellan Oracle och MySQL som hade betydelse för laborationerna återfinns också. Det visade sig att överföringen var enkel att göra och sist i rapporten sammanställs våra erfarenheter.

This thesis paper introduces you about the process of how to build an inventory tracking system in a local Swedish company. The related project is to support the thesis paper, and is also for the company’ using. The software product of this project is an application that works for managing various types’ instruments in the company of SWECO-Vaxjo. It will play an important role in the further management work of the company. In this thesis paper, the candidate techniques and theories for implementing this system are discussed. And in the end a good solution for this problem will be presented in the paper.

Foi estruturado um modelo de servidor de mapas, na plataforma MapGuide, capaz de disseminar eletrônicamente os dados geoespaciais gerados pela Prefeitura de Taboão da Serra SP. O projeto de servidor visou duas finalidades principais: implementar este tipo de tecnologia ao analista responsável pelo projeto, no âmbito da Prefeitura, e; tornar a dissertação um guia teóricometodológico introdutório a profissionais da Cartografia e Geociências, não especializados com este ramo das geotecnologias. O serviço de disseminação foi configurado para servir dados geoespaciais diretamente a navegadores de rede, servidores FTP e Sistemas de Informação Geográfica (SIG). Para estes últimos, foram utilizados recursos de acesso a dados localizados em servidores de mapas remotos, por meio dos serviços de Web Mapping Service (WMS) e Web Feature Service (WFS). Enquanto a disseminação em navegador de rede pode alcançar usuários não especializados com este campo das geotecnologias, a utilização de servidores FTP, serviços WMS e WFS remotos, favorece usuários técnicos das Geociências e Cartografia. Comparou-se as funcionalidades do MapGuide, a SIG de primeira e segunda geração, com funções topológicas completas. Concluiu-se que o servidor de mapas não possuía a mesma capacidade de análise espacial dos SIG topológicos. / A Web Mapping application built on MapGuide was designed to digitally serve the municipal government of Taboão da Serra SP geospatial data. There were two aims related to the application project: to implement the technology to the analyst responsible for the project, and; to develop the project content as an introdutory theoretical-methodological guide to geoscientists and cartographers not specialized in the internet mapping field. The geospatial data dissemination services were configured to web browsers, FTP servers and Geographic Information Systems (GIS). For these lasts, data access resources to remote spatial servers were used, via Web Mapping Services (WMS) and Web Feature Services (WFS). While the web browser data dissemination is suitable for non-technicians, the FTP server, WMS and WFS resources, are best suitable for GIS analysts. A comparison between MapGuide functionalities with other first and second generation topological GIS softwares was performed. The conclusion revealed the web mapping application didn\'t have the same spatial analysis capabilities as the topological GIS.

The Intelligent Parameter Utilization Tool (InPUT) is a format and API for thecross-language description of experiments, which makes it possible to defineexperiments and their contexts at an abstract level in the form of XML- andarchive-based descriptors. By using experimental descriptors, programs can bereconfigured without having to be recoded and recompiled and the experimentalresults of third-parties can be reproduced independently of the programminglanguage and algorithm implementation. Previously, InPUT has supported theexport and import of experimental descriptors to/from XML documents, archivefiles and LaTex tables. The overall aim of this project was to develop an SQLdatabase design that allows for the export, import, querying, updating anddeletion of experimental descriptors, implementing the design as an extensionof the Java implementation of InPUT (InPUTj) and to verify the generalapplicability of the created implementation by modeling real-world use cases.The use cases covered everything from simple database transactions involvingsimple descriptors to complex database transactions involving complexdescriptors. In addition, it was investigated whether queries and updates ofdescriptors are executed more rapidly if the descriptors are stored in databasesin accordance with the created SQL schema and the queries and updates arehandled by the DBMS PostgreSQL or, if the descriptors are stored directly infiles and the queries and updates are handled by the default XML-processingengine of InPUTj (JDOM). The results of the test case indicate that the formerusually allows for a faster execution of queries while the latter usually allowsfor a faster execution of updates. Using database-stored descriptors instead offile-based descriptors offers many advantages, such as making it significantlyeasier and less costly to manage, analyze and exchange large amounts of experi-mental data. However, database-stored descriptors complement file-baseddescriptors rather than replace them. The goals of the project were achieved,and the different types of database transactions involving descriptors can nowbe handled via a simple API provided by a Java facade class.

For quite some time relational databases, such as MySQL, Oracle and Microsoft SQL Server, have been used to store data for most applications. While they are indeed ACID compliant (meaning interrupted database transactions won't result in lost data or similar nasty surprises) and good at avoiding redundancy, they are difficult to scale horizontally (across multiple servers) and can be slow for certain tasks. With the Web growing rapidly, spawning enourmous, user-generated content websites such as Facebook and Twitter, fast databases that can handle huge amounts of data are a must. For this purpose new databases management systems collectively called NoSQL are being developed. This thesis explains NoSQL further and compares the write and retrieval speeds, as well as the space efficiency, of two database management systems from the document oriented branch of NoSQL called MongoDB and CouchDB, which both use the JavaScript Object Notation (JSON) to store their data within. The benchmarkings performed show that MongoDB is quite a lot faster than CouchDB, both when inserting and querying, when used with their respective Python libraries and dynamic queries. MongoDB also is more space efficient than CouchDB.

It can be difficult to choose the right NoSQL DBMS, and some systems lack sufficient research and evaluation. There are also tools for moving and transforming data between DBMS' in order to combine or use different systems for different use cases. We have described a use case, based on requirements related to the quality attributes Consistency, Scalability, and Performance. For the Performance attribute, focus is fast insertions and full-text search queries on a large dataset of forum posts. The evaluation was performed on two NoSQL DBMS' and two tools for transforming data between them. The DBMS' are MongoDB and Elasticsearch, and the transformation tools are NotaQL and Compose's Transporter. The purpose is to evaluate three different NoSQL systems, pure MongoDB, pure Elasticsearch and a combination of the two. The results show that MongoDB is faster when performing simple full-text search queries, but otherwise slower. This means that Elasticsearch is the primary choice regarding insertion and complex full-text search query performance. MongoDB is however regarded as a more stable and well-tested system. When it comes to scalability, MongoDB is better suited for a system where the dataset increases over time due to its simple addition of more shards. While Elasticsearch is better for a system which starts off with a large amount of data since it has faster insertion speeds and a more effective process for data distribution among existing shards. In general NotaQL is not as fast as Transporter, but can handle aggregations and nested fields which Transporter does not support. A combined system using MongoDB as primary data store and Elasticsearch as secondary data store could be used to achieve fast full-text search queries for all types of expressions, simple and complex.

In this project relational and Lotus Notes database technology are evaluated with regard to their suitability in providing computer-based support in plant breeding in general and specifically in the production of doubled haploids. The two developed databases are compared based on a set of requirements produced together with the DH-group which is the main users of the databases. The results indicate that both Lotus Notes and the relational databases are able to fulfil all needs documented in this project, although both systems have their limitations. An often expressed opinion is that it is difficult to combine biology and databases. The experience gained in this project however suggests that it does not need to be the case in instances where data is not as complicated as often discussed. Observations made during this project indicate that data warehousing with integrated data mining and OLAP tools are surprisingly similar to how the DH-group at Svalöf Weibull works and could be a suitable solution for the production of doubled haploids.

Steigende Publikationszahlen, die wachsende Bedeutung von elektronischen Publikationen und die zunehmende Notwendigkeit des Datenaustausches stellen Herausforderungen dar, denen viele Literaturverwaltungssysteme nicht mehr ohne weiteres gerecht werden. In dieser Arbeit stellt einen auf dem relationalen Modell basierenden Entwurf für ein Literaturverwaltungssystem vor, der die Forderungen nach Sicherung der Konsistenz der Daten und Einbeziehung von elektronischen Dokumenten berücksichtigt und auf verschiedenen relationalen DBMS realisierbar ist.