|
|
Modification of Pivot Tables method for persistent metric indexing
Moško, Juraj ; Skopal, Tomáš (advisor) ; Hoksza, David (referee)
The pivot tables is one of the most effective metric access method optimized for a number of distance computations in similarity search. In this work the new modification of the pivot tables method was proposed that is besides distance computations optimized also for a number of I/O operations. Proposed Clustered pivot tables method is indexing clusters of similar objects that were created by another metric access method - the M-tree. The indexing of clustered objects has a positive effect for searching within indexed database. Whereas the clusters are paged in second memory, page containing such cluster, which do not satisfy particular query, is not accessed in second memory at all. Non-relevant objects, that are out of the query range, are not loaded into memory, what has the effect of decreasing number of I/O operations and total volume of transferred data. The correctness of proposed approach was experimentally proved and experimental results of proposed method was compared to selected metric access methods.
|
|
|
Modification of Pivot Tables method for persistent metric indexing
Moško, Juraj ; Skopal, Tomáš (advisor) ; Hoksza, David (referee)
The pivot tables is one of the most effective metric access method optimized for a number of distance computations in similarity search. In this work the new modification of the pivot tables method was proposed that is besides distance computations optimized also for a number of I/O operations. Proposed Clustered pivot tables method is indexing clusters of similar objects that were created by another metric access method - the M-tree. The indexing of clustered objects has a positive effect for searching within indexed database. Whereas the clusters are paged in second memory, page containing such cluster, which do not satisfy particular query, is not accessed in second memory at all. Non-relevant objects, that are out of the query range, are not loaded into memory, what has the effect of decreasing number of I/O operations and total volume of transferred data. The correctness of proposed approach was experimentally proved and experimental results of proposed method was compared to selected metric access methods.
|
|
|
Collection of solved tasks in statistics
JÁNA, Martin
The purpose of the bachelor thesis was to compose a collection of solved and non-solved statistical problems. The problems are related to chosen parametric (student's t-tests) and non-parametric tests (Wilcoxon's tests). Besides, it focuses on an analysis of simple sorting variance, Kruskal-Wallis test, Friedman test and on a tests taken inclusive the pivot tables.
|
guest ::
