Verification of IDL Arcitecture Performance for Larger Datasets

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25530%2F24%3A39922407" target="_blank" >RIV/00216275:25530/24:39922407 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.23919/FRUCT64283.2024.10749855" target="_blank" >http://dx.doi.org/10.23919/FRUCT64283.2024.10749855</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.23919/FRUCT64283.2024.10749855" target="_blank" >10.23919/FRUCT64283.2024.10749855</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Verification of IDL Arcitecture Performance for Larger Datasets

Popis výsledku v původním jazyce

Due to the ever increasing popularity of Object Relational Mapping (ORM) frameworks, the Intelligent Data Layer (IDL) architecture was compiled by the authors as part of an earlier publication, Design of Data Access Architecture Using ORM Framework. This architecture allows to implement ORM frameworks with prediction of the required data. Given the size of datasets that can be managed in database systems, it was necessary to verify that this architecture is robust enough to handle similar problems. In the context of this paper, we focus on examining the performance of our defined architecture with larger datasets, which should help us determine whether such an architecture is suitable for common use. Along with the performance verification for larger datasets, performance tests were performed in case the database does not contain indexes for foreign keys.

Název v anglickém jazyce

Verification of IDL Arcitecture Performance for Larger Datasets

Popis výsledku anglicky

Due to the ever increasing popularity of Object Relational Mapping (ORM) frameworks, the Intelligent Data Layer (IDL) architecture was compiled by the authors as part of an earlier publication, Design of Data Access Architecture Using ORM Framework. This architecture allows to implement ORM frameworks with prediction of the required data. Given the size of datasets that can be managed in database systems, it was necessary to verify that this architecture is robust enough to handle similar problems. In the context of this paper, we focus on examining the performance of our defined architecture with larger datasets, which should help us determine whether such an architecture is suitable for common use. Along with the performance verification for larger datasets, performance tests were performed in case the database does not contain indexes for foreign keys.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10200 - Computer and information sciences

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2024

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 36th Conference of Open Innovations Association FRUCT

ISBN

978-952-65-2462-7

ISSN

2305-7254

e-ISSN

2343-0737

Počet stran výsledku

6

Strana od-do

"475 "- 480

Název nakladatele

IEEE (Institute of Electrical and Electronics Engineers)

Místo vydání

New York

Místo konání akce

Helsinky

Datum konání akce

30. 10. 2024

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—