This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n17http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n15http://localhost/temp/predkladatel/
n8http://purl.org/net/nknouf/ns/bibtex#
n16http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/ontology/domain/vavai/
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F09%3A00207444%21RIV10-MSM-11320___/
n18https://schema.org/
n14http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F09%3A00207444%21RIV10-MSM-11320___
rdf:type
n9:Vysledek skos:Concept
dcterms: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.
dcterms: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
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
skos:notation
RIV/00216208:11320/09:00207444!RIV10-MSM-11320___
n3:aktivita
n20:Z
n3:aktivity
Z(MSM0021620838)
n3:dodaniDat
n5:2010
n3:domaciTvurceVysledku
n16:5822769
n3:druhVysledku
n11:D
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n21:predkladatel
n3:idSjednocenehoVysledku
307531
n3:idVysledku
RIV/00216208:11320/09:00207444
n3:jazykVysledku
n12:eng
n3:klicovaSlova
Combination; MD-algorithm; Efficient; Solving; Top-K; Problem; according; User's; Preferences
n3:klicoveSlovo
n4:Efficient n4:Problem n4:User%27s n4:according n4:Combination n4:Preferences n4:Solving n4:MD-algorithm n4:Top-K
n3:kontrolniKodProRIV
[F2EC9F3CA87C]
n3:mistoKonaniAkce
Neuveden
n3:nazevZdroje
DATESO 2009
n3:obor
n7:JC
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n5:2009
n3:tvurceVysledku
Pokorný, Jaroslav Ondreička, Matúš
n3:typAkce
n17:EUR
n3:wos
000272412300013
n3:zahajeniAkce
2009-01-01+01:00
n3:zamer
n14:MSM0021620838
s:numberOfPages
12
n8:hasPublisher
České vysoké učení technické v Praze
n18:isbn
978-80-01-04323-3
n15:organizacniJednotka
11320