Charles Explorer logo
🇨🇿

Top-k Searching for More Users in Multidimensional B-tree with Lists

Publikace na Matematicko-fyzikální fakulta |
2011

Tento text není v aktuálním jazyce dostupný. Zobrazuje se verze "en".Abstrakt

In the last few years, research of top-k processing is in progress in various domains. The aim of our research is efficient top-k searching of the best k objects with more attributes according to complex user preferences.

We use a model of user preferences based on fuzzy functions. In our previous research we focus on top-k searching in tree-oriented data structures and we developed various top-k algorithms, which solve top-k problem efficiently and support the model of user preferences.

Furthermore, we assume that attributes of an object type can be distributed in various information resources. Therefore, integration of data is one of the topics of our research.

We are developing a software system that will be including our new-developed technologies and experiments with real data from various information resources.