"3505"^^ . . "R-strom (anglicky R-tree) je stromov\u00E1 datov\u00E1 struktura podobn\u00E1 B-strom\u016Fm, ale pou\u017E\u00EDvan\u00E1 pro prostorov\u00E9 p\u0159\u00EDstupov\u00E9 metody, nap\u0159\u00EDklad pro indexovan\u00ED v\u00EDcerozm\u011Brn\u00FDch struktur nap\u0159\u00EDklad v geografick\u00FDch informa\u010Dn\u00EDch syst\u00E9mech. Mimo to, pomoc\u00ED R-strom\u016F je implementov\u00E1no nap\u0159\u00EDklad datov\u00E9 \u00FAlo\u017Ei\u0161t\u011B MyISAM v MySQL.Datov\u00E1 struktura d\u011Bl\u00ED m\u00EDsto na hierarchicky vkl\u00E1dan\u00E9 a potenci\u00E1ln\u011B se p\u0159ekr\u00FDvaj\u00EDc\u00ED, tzv. MBR (minimum bounding rectangles \u2013 minim\u00E1ln\u00ED ohrani\u010Duj\u00EDc\u00ED obd\u00E9ln\u00EDky, t\u00E9\u017E naz\u00FDvan\u00E9 obd\u00E9ln\u00EDky nebo boxy \u2013 R z anglick\u00E9ho v\u00FDrazu pro obd\u00E9ln\u00EDk (rectangle) tvo\u0159\u00ED \u010D\u00E1st n\u00E1zvu R-strom\u016F).Ka\u017Ed\u00FD uzel R-stromu m\u00E1 prom\u011Bnliv\u00FD po\u010Det z\u00E1znam\u016F (a\u017E do p\u0159eddefinovan\u00E9ho maxima). Ka\u017Ed\u00FD z\u00E1znam uvnit\u0159 uzlu, kter\u00FD nen\u00ED listem, ukl\u00E1d\u00E1 dv\u011B dal\u0161\u00ED informace: zp\u016Fsob identifikace dce\u0159in\u00E9ho uzlu a MBR v\u0161ech z\u00E1znam\u016F uvnit\u0159 tohoto dce\u0159in\u00E9ho uzlu.Algoritmy pro vlo\u017Een\u00ED nov\u00E9ho a smaz\u00E1n\u00ED st\u00E1vaj\u00EDc\u00EDho prvku pou\u017E\u00EDvaj\u00ED MBR z uzl\u016F ke kontrole, \u017Ee prvky v geometrick\u00E9m okol\u00ED jsou um\u00EDst\u011Bny do stejn\u00FDch listov\u00FDch uzl\u016F (konkr\u00E9tn\u011B, nov\u00FD prvek p\u016Fjde do listov\u00E9ho uzlu, kter\u00FD pot\u0159ebuje nejmen\u0161\u00ED roz\u0161\u00ED\u0159en\u00ED sv\u00E9ho MBR). Ka\u017Ed\u00FD z\u00E1znam uvnit\u0159 listov\u00E9ho uzlu ulo\u017E\u00ED dv\u011B informace: identifik\u00E1tor dan\u00E9ho prvku (kter\u00FD m\u016F\u017Ee b\u00FDt alternativn\u011B um\u00EDst\u011Bn p\u0159\u00EDmo do uzlu) a MBR datov\u00E9ho prvku.Podobn\u011B, vyhled\u00E1vac\u00ED algoritmy pou\u017E\u00EDvaj\u00ED MBR k rozhodnut\u00ED, zdali hledat uvnit\u0159 dan\u00E9ho uzlu. T\u00EDmto zp\u016Fsobem p\u0159i hled\u00E1n\u00ED v\u011Bt\u0161ina uzl\u016F \u201Enetknut\u00FDch\u201C. Stejn\u011B jako B-stromy, jsou R-stromy vhodn\u00E9 pro datab\u00E1ze, kde se uzly podle pot\u0159eby mohou na\u010D\u00EDtat do pam\u011Bti.U R-strom\u016F lze nastavit nejen maxim\u00E1ln\u00ED po\u010Det prvk\u016F v n\u011Bm, ale i algoritmus, kdy se m\u00E1 dan\u00FD list zm\u011Bnit v uzel dal\u0161\u00ED \u00FArovn\u011B. Mezi tyto algoritmy pat\u0159\u00ED: linear-cost algoritm quadratic-cost algoritm exhaustive algoritmR-stromy nezaru\u010Duj\u00ED dobr\u00FD v\u00FDkon pro nejnep\u0159\u00EDzniv\u011Bj\u0161\u00ED p\u0159\u00EDpad ulo\u017Een\u00ED dat, ale jejich implementace dosahuj\u00ED slu\u0161n\u00FDch v\u00FDkon\u016F p\u0159i pou\u017Eit\u00ED \u201Ere\u00E1ln\u00FDch\u201C dat. V roce 2004 byl nicm\u00E9n\u011B vyvinut nov\u00FD algoritmus, Priority R-Tree, kter\u00FD m\u00E1 v\u00FDkon vylep\u0161ovat pr\u00E1v\u011B pro nep\u0159\u00EDzniv\u011B ulo\u017Een\u00E1 data."@cs . . "R-strom"@cs . "12"^^ . . . . . . . . . . . . "R-strom (anglicky R-tree) je stromov\u00E1 datov\u00E1 struktura podobn\u00E1 B-strom\u016Fm, ale pou\u017E\u00EDvan\u00E1 pro prostorov\u00E9 p\u0159\u00EDstupov\u00E9 metody, nap\u0159\u00EDklad pro indexovan\u00ED v\u00EDcerozm\u011Brn\u00FDch struktur nap\u0159\u00EDklad v geografick\u00FDch informa\u010Dn\u00EDch syst\u00E9mech. Mimo to, pomoc\u00ED R-strom\u016F je implementov\u00E1no nap\u0159\u00EDklad datov\u00E9 \u00FAlo\u017Ei\u0161t\u011B MyISAM v MySQL.Datov\u00E1 struktura d\u011Bl\u00ED m\u00EDsto na hierarchicky vkl\u00E1dan\u00E9 a potenci\u00E1ln\u011B se p\u0159ekr\u00FDvaj\u00EDc\u00ED, tzv."@cs . . . . . . . . . "R-strom"@cs . . "16405916"^^ . . . . "391112"^^ . . . . . .