Browsing by Subject "relational databases"
Now showing 1 - 5 of 5
- Results Per Page
- Sort Options
Item type:Article, Access status: Open Access , Accelerating SELECT WHERE and SELECT JOIN queries on a GPU(Wydawnictwa AGH, 2013) Pietroń, Marcin; Russek, Paweł; Wiatr, KazimierzThis paper presents implementations of a few selected SQL operations using the CUDA programming framework on the GPU platform. Nowadays, the GPU’s parallel architectures give a high speed-up on certain problems. Therefore, the number of non-graphical problems that can be run and sped-up on the GPU still increases. Especially, there has been a lot of research in data mining on GPUs. In many cases it proves the advantage of offloading processing from the CPU to the GPU. At the beginning of our project we chose the set of SELECT WHERE and SELECT JOIN instructions as the most common operations used in databases. We parallelized these SQL operations using three main mechanisms in CUDA: thread group hierarchy, shared memories, and barrier synchronization. Our results show that the implemented highly parallel SELECT WHERE and SELECT JOIN operations on the GPU platform can be significantly faster than the sequential one in a database system run on the CPU.Item type:Article, Access status: Open Access , Model for dynamic and hierarchical data repository in relational database(Wydawnictwa AGH, 2018) Piech, Mateusz; Frącz, Wojciech; Turek, Wojciech; Kisiel-Dorohinicki, Marek; Dajda, Jacek; Byrski, AleksanderThe aim of this research is to build an open schema model for a digital sources repository in a relational database. This required us to develop a few advanced techniques. One of them was to keep and maintain a hierarchical data structure pushed into the repository. A second was to create constraints on any hierarchical level that allows for the enforcement of data integrity and consistency. The created solution is mainly based on a JSON file as a native column type, which was designed for holding open schema documents. In this paper, we present a model for any repository that uses hierarchical dynamic data. Additionally, we include a structure for normalizing the input and description for the data in order to keep all of the model assumptions. We compared our solution with a well-known open schema model – Entity-Attribute-Value - in the scope of saving data and querying about relationships and contents from the structure. The results show that we achieved improvements in both the performance and disk space usage, as we extended our model with a few new features that the previous model does not include. The techniques developed in this research can be applied in every domain where hierarchical dynamic data is required, as demonstrated by the digital book repository that we have presented.Item type:Thesis, Access status: Restricted , Porównanie relacyjnych i nierelacyjnych baz danych(Data obrony: 2018-09-21) Jabłońska, Martyna
Wydział Elektrotechniki, Automatyki, Informatyki i Inżynierii BiomedycznejItem type:Thesis, Access status: Restricted , Porównanie wydajności implementacji warstwy dostępu do danych w oparciu o relacyjne i obiektowe bazy danych(Data obrony: 2018-11-15) Ekiert, Maciej
Wydział Elektrotechniki, Automatyki, Informatyki i Inżynierii BiomedycznejItem type:Thesis, Access status: Restricted , Zastosowanie nierelacyjnej bazy danych w aplikacji webowej(Data obrony: 2017-01-24) Wolak, Szymon
Wydział Geologii, Geofizyki i Ochrony ŚrodowiskaAplikacja webowa wykorzystująca nierelacyjne bazy danych do prezentowania wizytówek ciekawych miejsc na przykładzie gminy Gródek nad Dunajcem. Najważniejszym założeniem było zapewnienie możliwości łatwego rozwijania aplikacji o kolejne obiekty. Przy wyborze narzędzi został wybrany generator aplikacji JHipster. W pracy zostały opisane nierelacyjne bazy danych, ich zalety i wady oraz porównanie z powszechnie znanymi bazami SQL.