LBLesia V. Bulatetska

Lesia V. Bulatetska

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Lesia V. Bulatetska has a total of 39 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    EVALUATION OF THE IMPACT OF JIT AND NATIVE AOT COMPILATION ON THE PERFORMANCE AND RESOURCE EFFICIENCY OF WEB SERVICES IN THE .NET 9 ENVIRONMENT

    by Alina Tretyak, Lesia Bulatetska, Vitalii Bulatetskyi, Yuliia Pavlenko

    This paper presents the findings of a study evaluating the impact of Just-In-Time (JIT) and Native Ahead-Of-Time (Native AOT) compilation techniques on the performance and resource efficiency of web services running in the .NET 9 environment. The relevance of the research is driven by the widespread adoption of containerized and serverless architectures, where reducing initialization time, increasing throughput, and optimizing system resource usage are critical requirements. The experimental study was conducted using a test web service developed with the ASP.NET Core platform and the lightweight WebApplication.CreateSlimBuilder() template. To minimize the overhead of third-party components, access to a local SQLite database was implemented via ADO.NET without using an ORM, and data serialization was handled using native System.Text.Json. The comparison evaluated two scenarios: single-record lookup by primary key and batch retrieval of 103 records followed by JSON serialization. Load testing was performed across a concurrency range of 1 to 200 parallel threads. The experimental results indicate that Native AOT provides a significant advantage during the cold start of the web service. The processing time for the initial request in the single-record lookup scenario dropped from approximately 668 ms for the JIT version to 44 ms for Native AOT, representing an nearly 15-fold decrease in latency. Throughput testing demonstrated that under a load of 4 parallel threads, Native AOT achieved approximately 667 req/s compared to 626 req/s for the JIT version. Memory analysis revealed comparable resource consumption in a stabilized state, with approximately 26.13 MB for JIT and 26.55 MB for Native AOT. The findings can be applied to inform the selection of compilation strategies when designing modern high-load web services.

  • The Kyber encryption algorithm and its implementation in .NET

    by Danylo S. Zolotopupov, Lesia V. Bulatetska, Vitalii V. Bulatetskyi

    This paper examines modern cryptographic algorithms and their application for ensuring secure message exchange. Special attention is paid to the Kyber algorithm as one of the promising post-quantum cryptographic methods that guarantees reliable protection of information from quantum computer attacks. The Kyber algorithm is based on the hardness of the Module-Learning With Errors (MLWE) problem, which belongs to the mathematical class of lattice-based problems. The primary objective of this study is the practical implementation of the post-quantum Kyber algorithm through the development of a custom cryptographic library on the .NET platform. To achieve this, the theoretical foundations of Kyber were analyzed and implemented in code. The implementation successfully reproduces the full key exchange cycle, comprising key generation, encapsulation, and decapsulation. Following functional verification, performance benchmarks were conducted across various cryptographic parameter sets, covering both single- and multi-threaded scenarios on the .NET platform. The algorithm’s viability was validated on diverse target platforms, including mobile devices, using a cross-platform .NET MAUI application. Prospects for further research include the development of practical applications, particularly the creation of a program for secure message exchange. The use of Kyber in modern technologies will contribute to ensuring the long-term protection of information in the context of developing quantum computing and growing cybersecurity threats.

  • Open Access

    OPTIMIZATION OF RELATIONAL DATABASE PERFORMANCE THROUGH THE COMBINED USE OF PARTITIONING AND INDEXING MECHANISMS

    by Yurii Vichepolskyi, Lesia Bulatetska

    This paper presents a comprehensive study of methods for improving the performance of relational database management systems through the integration of partitioning and indexing mechanisms. The relevance of the study is driven by the rapid growth of big data volumes, which necessitates finding an optimal balance between architectural complexity and hardware costs. The research methodology is based on a series of experiments conducted in the PostgreSQL 18.1 database management system environment. To ensure objective results, a synthetic dataset consisting of 1 million records was generated, simulating the structure and business logic of a modern e-commerce system. The experimental architecture includes a non-partitioned table (Plain) and three types of partitioned structures: date range partitioning (Range), categorical list partitioning (List), and identifier hash partitioning (Hash). The testing framework covers six key query scenarios, including aggregation queries, complex range-based selections, point lookups, and join operations. The primary evaluation metrics are query execution time (latency) and input/output subsystem resource utilization (I/O cost), measured in units of system buffers. The comparative analysis demonstrates that partitioning without additional indexing provides significant performance improvements (up to 11.9× for the Range strategy) only when the query filtering condition matches the partitioning key, which is achieved through the partition pruning mechanism. At the same time, it was found that for point queries, non-partitioned tables with indexes outperform partitioned counterparts by 40–60%, due to the absence of planner overhead associated with analyzing the partition hierarchy. The highest efficiency was achieved by combining partitioning with composite indexes, resulting in up to a 99.1% reduction in resource consumption for complex multi-factor queries. The impact of data fragmentation was also analyzed, revealing that during large-scale aggregation queries, a non-partitioned table may perform approximately 20% faster due to a reduced number of file descriptor operations. Based on the findings, practical recommendations are formulated for selecting optimization strategies depending on workload characteristics. The study confirms that partitioning and indexing are not interchangeable but complementary technologies, whose maximum potential is realized only through their coordinated application within a unified database architecture.

  • Open Access

    RECONSTRUCTING ENTITY RELATIONSHIPS IN DATABASE SCHEMAS WITH PLANTUML AND LLMS

    by Anatolii Kurotych, Lesia Bulatetska, Oksana Onyshchuk, Анатолій Куротич, Леся Булатецька

    The article explores the potential of using Large Language Models (LLMs) for automatically restoring relationships between tables in SQL databases with incompletely defined foreign keys. To evaluate the ability of LLMs to infer foreign keys from textual descriptions of table structures, an experimental database was created. The database schema, excluding relationships, was provided as input to two large language models: ChatGPT-4o and Claude 3.7 Sonnet. For analysis purposes, only basic information was provided to the LLMs: table names, field names, and primary keys, without any data examples. The ChatGPT-4o model successfully detected all relationships between tables but demonstrated limitations in determining the types of these relationships: all were classified as “one-to-one”, regardless of their actual structure. This indicates the model's inability to accurately interpret the type of relationships based on textual descriptions. In contrast, the Claude 3.7 Sonnet model not only correctly identified all existing relationships, but also correctly determined their types (e.g., one-to-many), demonstrating higher accuracy and a deeper understanding of the database structure within the task at hand. The description of the table structure was provided to the language models in PlantUML format, ensuring a standardized, clear and unambiguous representation of the input data. Based on the modeling results, ER diagrams were also constructed in PlantUML format. The experiment confirms the effectiveness of LLMs in reconstructing missing foreign keys and shows potential for automated analysis, documentation, and improvement of existing databases. Following consistent naming conventions during schema design significantly simplifies both the work of developers and the automated processing of database structures by intelligent systems, playing a crucial role in these processes.

  • Optimizing the process of ER diagram creation with PlantUML

    by Anatolii O. Kurotych, Lesia V. Bulatetska

    Relational databases are widely used for storing and processing structured information, while their visualization is a key phase in the architectural design of information systems. One of the most popular tools for creating ERD is PlantUML, which implements the “diagram as code” approach for generating diagrams. This research analyzes PlantUML’s capabilities for building ERD and explores tools that improve the diagrams’ quality and automate their generation process. The shortcomings of PlantUML’s basic functionality for creating ERD are described. Additional PlantUML features are described, such as improving the appearance and readability of diagrams by highlighting primary and foreign keys, removing unnecessary elements, and creating legends for user convenience. A plugin module has been developed to enhance the readability of PlantUML code (hereafter referred to as ‘PUML code’) by structuring it into functions and procedures, making diagrams easier to create and maintain. The benefits of the modular approach include standardized styles and a minimized amount of PUML code. The article also introduces the Sqlant tool, which allows PUML code to be automatically generated from a PostgreSQL relational database. The PlantUML, combined with automation tools like Sqlant and a modular approach, is an effective tool for producing high-quality ERD. It can be particularly beneficial in environments where database structures undergo frequent changes. Despite the limitations of the official documentation, PlantUML has significant potential to extend its functionality.

  • Research methods and tools for cleaning the system partition of Windows operating systems

    by Andrii P. Stupin, Vitalii V. Bulatetskyi, Lesia V. Bulatetska, Tetiana O. Hryshanovych, Yuliia S. Pavlenko

    Causes and solutions of the problem of free space lack on the system partition during exploitation of Windows (Vista/7/8/8.1/10) operating system are analyzed in this research. Main objects of the file structure, system paths to them, their purpose and role in system partition space usage have been prospected.Some operating system settings that allow to manage relatively large system files and folders and adjust the amount of free space have also been explored. In the course of the research, a set of third-party software was used as an auxiliary tool to compare the cleaning efficiency of individual objects of the system partition and to form own cleaning methods. Commands sets for correct cleaning of such objects are offered. They can be used for writing batch files and scripts, which allows automating the system partition optimizing process in the future.

  • Open Access

    PRESERVATION OF HIERARCHY STRUCTURES IN RELATIVE DATABASES

    by Volodymyr Markitan, Mykola Vozniak, Lesia Bulatetska, Vitalii Bulatetskyi

    Relational database management systems and the SQL language itself do not have any built-in mechanisms for storing and managing hierarchical structures. There are several different ways to represent trees in relational databases. This paper considers the method of modeling hierarchical data structures in the form of Adjacency Lists and Closure Tables. For each method, there are examples of writing queries to solve typical problems encountered when working with tree structures: finding all descendant leaves, all descendants and ancestors of a given leaf, moving a leaf to another ancestor leaf, and deleting leaves with all its descendants. The possibility of using recursive queries when displaying the entire tree in the Adjacency List model is considered. If the depth of the tree is not known, or it is not known at what level the specified element is, the query can not be built by standard means of the SELECT statement, then you need to create a recursive procedure, or write a recursive query. In order to avoid recursion when outputting the whole tree, all nodes of the subtree, and finding the path from a certain place to the root, the modeling of hierarchical data structures is performed in the form of a connection table (Closure Table). This complicates the process of adding a new leaf and moving the leaf to another ancestor leaf. In this case, to simplify the writing of queries, it is suggested to create triggers that will build or rebuild the links. Given the fact that sometimes there is a need to preserve dependent, in particular hierarchical structures in a relational database, you need to be able to plow the model of preservation of such data. The choice of method for solving a specific problem is influenced by the speed of basic operations with trees. Exploring different options for organizing SQL tree structures will allow you to understand and choose the best way to build such a structure in a relational database for a specific task. All SQL queries in this paper were created and tested for Oracle relational databases.

  • Open Access

    ANALYSIS OF OS WINDOWS 10 FILE OBJECTS FOR SYSTEM PARTITION SPACE CLEANING AND OPTIMIZATION

    by Vitalii Bulatetskyi, Lesia Bulatetska, Tetiana Hryshanovych

    The paper analyzes the causes and ways of solving the problem of free space lack on the system partition during the OS Windows exploitation. The peculiarities of the system partition organization during the installation of common Microsoft operating systems are analyzed. The main system file objects, paths to them, their purpose and role in the use of system partition space and in the functioning of the operating system are considered. Represented the list of paths to the files of the folders that occupy the largest volumes on the system partition. Thees folders correct cleaning or configuring may save a lot of space on the system partition. The main tools of the operating system for the cleaning methods implementation are considered: command line interpretator, PowerShell environment, system registry editing tools, and system library function calling tools. Particular attention is paid to batch files as the simplest and most effective means of implementing automated use of system utilities, taking into account the peculiarities of the command line interpreter. One of the ways to manipulate objects with commands is to use the PowerShell environment. This environment is able not to process commands, but to generate streams of objects related to this command and form their processed representation using both command and graphical interface. Described the logical and physical structure of the registry as one of the tools for managing Windows settings. Was made the comparative analysis of some software products, such as the system console utility for servicing deployment and management images, as well as a number of free software. It has generated the list of functions used for the system partition optimization and cleaning from excessive data. Based on the generated list, the efficiency of using the considered software tools for cleaning the system partition is analyzed.

  • Operation system features and cloud services for lecturer work

    by Lesya V. Bulatetska, Vitaliy V. Bulatetskyi, Tetyana O. Hryshanovych, Yulia S. Pavlenko, Tetyana I. Cheprasova, Andrey V. Pikilnyak

    The work proposes a conception of setup and use of teacher’s or lecturer’s workspace using common software and hardware products. The research object is a system built by using operating system capabilities in conjunction with office suite and public cloud service, as a foundation for teacher’s digital workspace. Research is made on how to set up, scale, and operate such a system, by studying the experience of national and foreign scientists and teachers, and using our own experience in educational processes, and working with operating systems and cloud services. As a result, we got a system which is easy to set up, learn, and apply by teachers without significant experience working remote education systems, and could be used for initial learning of remote education principles. It could be used as an initial step before migrating to specialized remote education systems. In the future, the system itself could be improved by adding additional objects into the system and a higher integration level between objects and external subjects.

  • Open Access

    Operation system features and cloud services for lecturer work

    by Lesya V. Bulatetska, Vitaliy V. Bulatetskyi, Tetyana O. Hryshanovych, Yulia S. Pavlenko, Tetyana I. Cheprasova, Andrey V. Pikilnyak

    The work proposes a conception of setup and use of teacher’s or lecturer’s workspace using common software and hardware products. The research object is a system built by using operating system capabilities in conjunction with office suite and public cloud service, as a foundation for teacher’s digital workspace. Research is made on how to set up, scale, and operate such a system, by studying the experience of national and foreign scientists and teachers, and using our own experience in educational processes, and working with operating systems and cloud services. As a result, we got a system which is easy to set up, learn, and apply by teachers without significant experience working remote education systems, and could be used for initial learning of remote education principles. It could be used as an initial step before migrating to specialized remote education systems. In the future, the system itself could be improved by adding additional objects into the system and a higher integration level between objects and external subjects.