Use of Machine Learning for the Unknown Values in Database Transformation Processes

Kvet, Michal; Čerešňák, Roman; Šalgová, Veronika

doi:10.1109/kit52904.2021.9583753

Cited by 2 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [36], migrating row problem is treated by storing the used access path in a shared instance memory. If the migrating row is to be created and applied, the stored access path is used for applying the change, so the index locates the data in a new block.…”

Section: Figure 5 Execution Plan -Removing Null Pointers From the Querymentioning

confidence: 99%

“…For the evaluation, a flight data model will be used [36,38,39] covering airspace definitions in a temporal manner, surrounded by the planned and real route, supervised by the flight points (positions of the airplane) -intended and real. First, each airspace was delimited by the unique character string name, numerical sequence number, validity time frame, and airspace parameters, like minimal, maximal flight levels.…”

Section: Figure 5 Execution Plan -Removing Null Pointers From the Querymentioning

confidence: 99%

“…In that case, the index is made visible, but the optimizer creates a SQL plan baseline to prevent existing queries from being degraded [36,54]. Thanks to that, there is no performance regression done by the automatic tasksanalyzers and advisors.…”

Section: Algorithm Select Index_name Visibilitymentioning

confidence: 99%

See 2 more Smart Citations

The Complexity of the Data Retrieval Process Using the Proposed Index Extension

Kvet

Papán²

2022

IEEE Access

View full text Add to dashboard Cite

Data retrieval, access, and tuple identification are inevitable in database processing, ensuring performance. The entities and relationships form a relational database. Data themselves are not specifically formatted, requiring sequential data block scanning if the particular index is unavailable. This paper summarizes existing indexing principles focusing on the B+tree, which forms the default structure for data access based on the index key. Such design is reliable and prone to an increase in the amount of data. However, it cannot manage undefined values properly, whereas they cannot be mathematically compared. Secondly, migrated rows can be present due to the size demand extension after the update operation. Thirdly, the index is always balanced, resulting in additional demands of the transaction. All these factors are covered by the proposed paper, discussing the limitations, opportunities, and own solutions to improve the performance. Several architectures are discussed, maintained, and computationally studied, focusing on the size demands, processing time, and costs. By using proposed techniques, significant improvements can be reached. A pointer list is introduced for migrated row management to reference the index set from the data block and store reference path or using a data reflector. When dealing with transaction support, index management and rebalancing are shifted to the separate autonomous transaction. Thanks to that, the main transaction can be approved sooner with no reliability issues. Finally, the proposed paper introduces the NULL value management structure in the instance memory for the index node reference.

show abstract

Section: Figure 5 Execution Plan -Removing Null Pointers From the Querymentioning

confidence: 99%

Section: Figure 5 Execution Plan -Removing Null Pointers From the Querymentioning

confidence: 99%