. "similarity search" . . . " multi-feature query" . "2010-04-16+02:00"^^ . "2015-03-20+01:00"^^ . "http://www.isvav.cz/projectDetail.do?rowId=GP201/08/P507"^^ . "Komplexn\u00ED podobnostn\u00ED dotazy nad rozs\u00E1hl\u00FDmi objemy dat" . "2010-12-31+01:00"^^ . . "S rostouc\u00EDm po\u010Dtem aplikac\u00ED, kter\u00E9 vyhled\u00E1vaj\u00ED ve sv\u00FDch datech podle podobnostn\u00EDch kriteri\u00ED nam\u00EDsto p\u0159esn\u00E9 shody, se vyno\u0159uje tak\u00E9 probl\u00E9m kombinovan\u00FDch podobnostn\u00EDch dotaz\u016F. Vezmeme-li jednoduch\u00FD dotaz, hledaj\u00EDc\u00ED objekty s\u00A0podobnou barvou, a druh\u00FD, kter\u00FD vrac\u00ED nejpodobn\u011Bj\u0161\u00ED tvary, m\u016F\u017Eeme cht\u00EDt z\u00EDskat objekty podobn\u00E9 v\u00A0obou t\u011Bchto kategori\u00EDch. V\u00FDpo\u010Detn\u00ED n\u00E1ro\u010Dnost takov\u00E9ho hled\u00E1n\u00ED a velk\u00E9 objemy zpracov\u00E1van\u00FDch dat, volaj\u00ED po vyu\u017Eit\u00ED distribuovan\u00E9ho prost\u0159ed\u00ED pro dosa\u017Een\u00ED pot\u0159ebn\u00E9 m\u00EDry \u0161k\u00E1lovatelnosti. C\u00EDlem tohoto projektu je studium problematiky distribuovan\u00FDch syst\u00E9m\u016F pro komplexn\u00ED podobnostn\u00ED hled\u00E1n\u00ED. V\u00A0sou\u010Dasn\u00E9 dob\u011B jsou dostupn\u00E9 pouze distribuovan\u00E9 pro jednoduch\u00E9 podobnostn\u00ED dotazy. V\u00A0r\u00E1mci tohoto projektu vytvo\u0159\u00EDme v\u00EDcevrstv\u00FD peer-to-peer syst\u00E9m, kter\u00FD se bude skl\u00E1dat z\u00A0n\u011Bkolika distribuovan\u00FDch index\u016F pro jednotliv\u00E9 kategorie (jako jsou barva, tvar, atd.), a s\u00A0pomoc\u00ED nov\u011B vyvinut\u00FDch algoritm\u016F umo\u017En\u00EDme zodpov\u00EDdat kombinovan\u00E9 dotazy." . . . "2008-01-01+01:00"^^ . . . " metric space" . . . . . "similarity search; metric space; scalability; multi-feature query; peer-to-peer network"@en . "V r\u00E1mci projektu se poda\u0159ilo posunout v\u00FDzkum v oblasti \u0159e\u0161en\u00ED komplexn\u00EDch podobnostn\u00EDch dotaz\u016F v distribuovan\u00FDch syst\u00E9mech. Tento v\u00FDzkum je v souladu se sou\u010Dasn\u00FDm trendem zpracov\u00E1n\u00ED komplexn\u00EDch dat jako jsou multim\u00E9dia, kde typicky pot\u0159ebujeme kombinovat vyhled\u00E1v\u00E1n\u00ED nad r\u016Fzn\u00FDmi aspekty organizovan\u00FDch dat (jako je nap\u0159\u00EDklad vizu\u00E1ln\u00ED podoba dat, textov\u00E1 anotace, geolokace nebo zvuk). Pro jednotliv\u00E9"@cs . "Complex similarity searching in very large data collections"@en . . . "1"^^ . "0"^^ . " scalability" . "In this project, we have succeeded in advancing the research in the area of evaluating complex similarity queries in distributed environment. This research follows the trend of processing complex data such as multimedia, where we typically need to combine searching in different aspects of the indexed data (e.g. visual resemblance, text annotations, geolocation or sound). The similarity of these a"@en . "0"^^ . "With the increasing number of applications that base searching on similarity rather than on exact matching, also the problem of\u00A0combined similarity query arises. For example, a simple similarity query allows us to search for objects with similar color and another one returns best-matching shapes and we are interested in objects that are similar in both the color and shape categories. The computational complexity of the similarity retrieval and the\u00A0large volumes of processed data call for the\u00A0distributed processing in order to achieve scalability. The aim of this project is to study problems of distributed systems for complex similarity searching. Currently, there are only distributed indexes for\u00A0evaluation of simple similarity queries. In this project, we build\u00A0a multi-overlay peer-to-peer system, which consists of several distributed index structures for\u00A0the respective\u00A0sub-features (e.g. color, shape, etc.) and\u00A0with a novel combination algorithms we will use\u00A0it to effectively\u00A0solve"@en . . . . . "GP201/08/P507" . "17"^^ . "17"^^ .