About: Combination of TA- and MD-algorithm for Efficient Solving of Top-K Problem according to User's Preferences

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Combination of TA- and MD-algorithm for Efficient Solving of Top-K Problem according to User's Preferences Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	In this article we focus on efficient solving of searching the best K objects in more attributes according to user’s preferences. Local preferences are modelled with one of four types of fuzzy function. Global preferences are modelled concurrently with an aggregation function. We focused on searching the best K objects according to various user’s preferences without accessing all objects. Therefore we deal with the use of TA-algorithm and MD-algorithm. Because of local preferences we used B+-trees during computing of Fagin’s TA-algorithm. For searching the best K objects MD-algorithm uses multidimensional B-tree, which is also composed of B+-trees. We developed an MXT-algorithm and a new data structure, in which MXT-algorithm can effectively find the best K objects by user’s preferences without accessing all the objects. We show that MXT-algorithm in some cases achieves better results in the number of accessed objects than TA-algorithm and MD-algorithm. In this article we focus on efficient solving of searching the best K objects in more attributes according to user’s preferences. Local preferences are modelled with one of four types of fuzzy function. Global preferences are modelled concurrently with an aggregation function. We focused on searching the best K objects according to various user’s preferences without accessing all objects. Therefore we deal with the use of TA-algorithm and MD-algorithm. Because of local preferences we used B+-trees during computing of Fagin’s TA-algorithm. For searching the best K objects MD-algorithm uses multidimensional B-tree, which is also composed of B+-trees. We developed an MXT-algorithm and a new data structure, in which MXT-algorithm can effectively find the best K objects by user’s preferences without accessing all the objects. We show that MXT-algorithm in some cases achieves better results in the number of accessed objects than TA-algorithm and MD-algorithm. (en)
Title	Combination of TA- and MD-algorithm for Efficient Solving of Top-K Problem according to User's Preferences Combination of TA- and MD-algorithm for Efficient Solving of Top-K Problem according to User's Preferences (en)
skos:prefLabel	Combination of TA- and MD-algorithm for Efficient Solving of Top-K Problem according to User's Preferences Combination of TA- and MD-algorithm for Efficient Solving of Top-K Problem according to User's Preferences (en)
skos:notation	RIV/00216208:11320/09:00207444!RIV10-MSM-11320___
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Pokorný, Jaroslav
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	307531
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/09:00207444
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Combination; MD-algorithm; Efficient; Solving; Top-K; Problem; according; User's; Preferences (en)
http://linked.open.../riv/klicoveSlovo	Solving Efficient Combination Preferences according Problem MD-algorithm Top-K User's
http://linked.open...ontrolniKodProRIV	[F2EC9F3CA87C]
http://linked.open...v/mistoKonaniAkce	Neuveden
http://linked.open...i/riv/nazevZdroje	DATESO 2009
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Ondreička, Matúš Pokorný, Jaroslav
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open...ain/vavai/riv/wos	000272412300013
http://linked.open.../riv/zahajeniAkce	2009-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
number of pages	12 (xsd:int)
http://purl.org/ne...btex#hasPublisher	České vysoké učení technické v Praze
https://schema.org/isbn	978-80-01-04323-3
http://localhost/t...ganizacniJednotka	11320
is http://linked.open...avai/riv/vysledek of	Combination of TA- and MD-algorithm for Efficient Solving of Top-K Problem according to User's Preferences Combination of TA- and MD-algorithm for Efficient Solving of Top-K Problem according to User's Preferences Combination of TA- and MD-algorithm for Efficient Solving of Top-K Problem according to User's Preferences Combination of TA- and MD-algorithm for Efficient Solving of Top-K Problem according to User's Preferences

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software