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

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10100142" target="_blank" >RIV/00216208:11320/11:10100142 - isvavai.cz</a>
Result on the web
<a href="http://ceur-ws.org/Vol-789/paper24.pdf" target="_blank" >http://ceur-ws.org/Vol-789/paper24.pdf</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Top-k Searching for More Users in Multidimensional B-tree with Lists
Original language description
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, weassume 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 technologiesand experiments with real data from various information resources.
Czech name
—
Czech description
—

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)