|
| |
|
|
Preferencev querying, indexing, optimisation
Horničák, Erik ; Vojtáš, Peter (advisor) ; Ondreička, Matúš (referee)
In this thesis we discuss the issue of searching the best k objects from the multi-users point of view. Every user has his own preferences, which are represented by fuzzy functions and aggregation function. This thesis designs and implements several solutions of searching the best k objects when attributes data are stored on remote servers. It was necessary to modificate existing algorithms for this type of obtaining data. This thesis uses several variants of Fagin algorithm, indexing methods using B+ trees and communication via web services.
|
|
|
Preferencev querying, indexing, optimisation
Horničák, Erik ; Vojtáš, Peter (advisor) ; Ondreička, Matúš (referee)
In this thesis we discuss the issue of searching the best k objects from the multi-users point of view. Every user has his own preferences, which are represented by fuzzy functions and aggregation function. This thesis designs and implements several solutions of searching the best k objects when attributes data are stored on remote servers. It was necessary to modificate existing algorithms for this type of obtaining data. This thesis uses several variants of Fagin algorithm, indexing methods using B+ trees and communication via web services.
|
|
|
Preferencev querying, indexing, optimisation
Horničák, Erik ; Vojtáš, Peter (advisor) ; Ondreička, Matúš (referee)
In this thesis we discuss the issue of searching the best k objects from the multi-users point of view. Every user has his own preferences, which are represented by fuzzy functions and aggregation function. This thesis designs and implements several solutions of searching the best k objects when attributes data are stored on remote servers. It was necessary to modificate existing algorithms for this type of obtaining data. This thesis uses several variants of Fagin algorithm, indexing methods using B+ trees and communication via web services.
|
|
| |
guest ::
