. . . . . . . . . . . . "\u0648\u064A\u0646\u0628\u063A\u064A \u0639\u062F\u0645 \u0627\u0644\u062E\u0644\u0637 \u0645\u0639 \u0627\u0644\u062A\u0633\u0644\u0633\u0644 \u0627\u0644\u062B\u0646\u0627\u0626\u064A \u0627\u0644\u0634\u062C\u0631\u064A (\u0628\u0627\u0644\u0625\u0646\u062C\u0644\u064A\u0632\u064A\u0629: Binary tree)\u200F \u0628\u064A \u062A\u0631\u064A (\u0628\u0627\u0644\u0625\u0646\u062C\u0644\u064A\u0632\u064A\u0629: B-tree)\u200F \u0641\u064A \u0639\u0644\u0648\u0645 \u0627\u0644\u062D\u0627\u0633\u0628 \u0647\u064A \u0628\u064A\u0627\u0646\u0627\u062A \u0645\u062A\u0633\u0644\u0633\u0644\u0629 \u0634\u062C\u0631\u064A\u0627 tree data structure , \u0648\u0645\u062A\u0648\u0627\u0632\u0646\u0647 \u0630\u0627\u062A\u064A\u0627 Self-Balancing \u0648\u0647\u064A \u062A\u0633\u0627\u0639\u062F \u0639\u0644\u0649 \u0628\u0642\u0627\u0621 \u0627\u0644\u0628\u064A\u0627\u0646\u0627\u062A \u0645\u0641\u0631\u0648\u0632\u0629 sorted \u0648\u062A\u0633\u0645\u062D \u0628\u0627\u0644\u0628\u062D\u062B searches \u0648\u0648\u0627\u0644\u0648\u0635\u0648\u0644 \u0627\u0644\u0645\u062A\u0633\u0644\u0633\u0644 sequential access \u0648\u0627\u0644\u0625\u062F\u0631\u0627\u062C insertions \u0648\u0627\u0644\u0645\u0633\u062D deletions \u0641\u064A \u0645\u0627 \u064A\u0633\u0645\u0649 logarithmic time , \u0628\u064A \u062A\u0631\u064A \u0647\u064A \u062A\u0639\u0645\u064A\u0645 \u0644\u0644\u0628\u062D\u062B \u0627\u0644\u0634\u062C\u0631\u064A \u0627\u0644\u062B\u0646\u0627\u0626\u064A \u062D\u064A\u062B \u0627\u0646 \u0627\u0644\u0631\u0627\u0628\u0637 \u0627\u0644\u0648\u0627\u062D\u062F Node \u064A\u0645\u0643\u0646 \u0627\u0646 \u064A\u0643\u0648\u0646 \u0644\u0647 \u0623\u0643\u062B\u0631 \u0645\u0646 \u0641\u0631\u0639\u064A\u0646 (Children),. \u0648\u0639\u0644\u0649 \u0639\u0643\u0633 \u0627\u0644\u0628\u064A\u0627\u0646\u0627\u062A \u0627\u0644\u0645\u062A\u0633\u0644\u0633\u0644\u0629 \u0634\u062C\u0631\u064A\u0627 \u0648\u0645\u062A\u0648\u0627\u0632\u0646\u0629 \u0630\u0627\u062A\u064A\u0627\u060C \u0628\u064A - \u062A\u0631\u064A \u0647\u064A \u0627\u0644\u062D\u0644 \u0627\u0644\u0627\u0645\u062B\u0644 \u0644\u0644\u0646\u0638\u0645 \u0627\u0644\u062A\u064A \u062A\u0642\u0631\u0627\u0621 \u0648\u062A\u0643\u062A\u0628 \u0627\u0644\u0643\u0645\u064A\u0627\u062A \u0627\u0644\u0643\u0628\u064A\u0631\u0629 \u0645\u0646 \u0627\u0644\u0628\u064A\u0627\u0646\u0627\u062A\u060C \u0628\u064A \u062A\u0631\u064A \u0647\u064A \u0645\u062B\u0627\u0644 \u062C\u064A\u062F \u0644\u0628\u0646\u064A\u0629 \u0627\u0644\u0628\u064A\u0627\u0646\u0627\u062A \u0644\u0644\u0630\u0627\u0643\u0631\u0629 \u0627\u0644\u062E\u0627\u0631\u062C\u064A\u0629 \u0648\u0647\u064A \u0645\u0633\u062A\u062E\u062F\u0645\u0629 \u0628\u0643\u062B\u0631\u0629 \u0641\u064A \u0642\u0648\u0627\u0639\u062F \u0627\u0644\u0628\u064A\u0627\u0646\u0627\u062A \u0648\u0646\u0638\u0645 \u0627\u0644\u0645\u0644\u0641\u0627\u062A."@ar . . . . . . . "B\u6811\uFF08\u82F1\u8A9E\uFF1AB-tree\uFF09\uFF0C\u662F\u4E00\u79CD\u5728\u8BA1\u7B97\u673A\u79D1\u5B66\u81EA\u5E73\u8861\u7684\u6811\uFF0C\u80FD\u591F\u4FDD\u6301\u6570\u636E\u6709\u5E8F\u3002\u9019\u7A2E\u8CC7\u6599\u7D50\u69CB\u80FD\u5920\u8B93\u67E5\u627E\u6578\u64DA\u3001\u987A\u5E8F\u8BBF\u95EE\u3001\u63D2\u5165\u6578\u64DA\u53CA\u522A\u9664\u7684\u52D5\u4F5C\uFF0C\u90FD\u5728\u5C0D\u6578\u6642\u9593\u5167\u5B8C\u6210\u3002B\u6811\uFF0C\u6982\u62EC\u6765\u8BF4\u662F\u4E00\u4E2A\u4E00\u822C\u5316\u7684\u4E8C\u5143\u641C\u5C0B\u6A39\uFF08binary search tree\uFF09\u4E00\u500B\u7BC0\u9EDE\u53EF\u4EE5\u62E5\u67092\u4E2A\u4EE5\u4E0A\u7684\u5B50\u8282\u70B9\u3002\u4E0E\u81EA\u5E73\u8861\u4E8C\u53C9\u67E5\u627E\u6811\u4E0D\u540C\uFF0CB\u6811\u9002\u7528\u4E8E\u8BFB\u5199\u76F8\u5BF9\u5927\u7684\u6570\u636E\u5757\u7684\u5B58\u50A8\u7CFB\u7EDF\uFF0C\u4F8B\u5982\u78C1\u76D8\u3002B\u6811\u51CF\u5C11\u5B9A\u4F4D\u8BB0\u5F55\u65F6\u6240\u7ECF\u5386\u7684\u4E2D\u95F4\u8FC7\u7A0B\uFF0C\u4ECE\u800C\u52A0\u5FEB\u5B58\u53D6\u901F\u5EA6\u3002B\u6811\u8FD9\u79CD\u6570\u636E\u7ED3\u6784\u53EF\u4EE5\u7528\u6765\u63CF\u8FF0\u5916\u90E8\u5B58\u50A8\u3002\u9019\u7A2E\u8CC7\u6599\u7D50\u69CB\u5E38\u88AB\u61C9\u7528\u5728\u6570\u636E\u5E93\u548C\u6587\u4EF6\u7CFB\u7EDF\u7684\u5B9E\u73B0\u4E0A\u3002"@zh . . . . . . . "Ein B-Baum (englisch B-tree) ist in der Informatik eine Daten- oder Indexstruktur, die h\u00E4ufig in Datenbanken und Dateisystemen eingesetzt wird. Ein B-Baum ist ein immer vollst\u00E4ndig balancierter Baum, der Daten nach Schl\u00FCsseln sortiert speichert. Er kann bin\u00E4r sein, ist aber im Allgemeinen kein Bin\u00E4rbaum. Das Einf\u00FCgen, Suchen und L\u00F6schen von Daten in B-B\u00E4umen ist in amortisiert logarithmischer Zeit m\u00F6glich. B-B\u00E4ume wachsen und schrumpfen, anders als viele Suchb\u00E4ume, von den Bl\u00E4ttern hin zur Wurzel."@de . . . . "B-strom je druh stromu. Je specifick\u00FD t\u00EDm, \u017Ee m\u00E1 \u0159\u00E1d a limity na maxim\u00E1ln\u00ED, i minim\u00E1ln\u00ED po\u010Det potomk\u016F vrcholu. B-strom je d\u00EDky t\u00E9to vlastnosti vyv\u00E1\u017Een\u00FD, operace p\u0159id\u00E1n\u00ED, vyjmut\u00ED i vyhled\u00E1v\u00E1n\u00ED tedy prob\u00EDhaj\u00ED v logaritmick\u00E9m \u010Dase. Tato struktura je \u010Dasto pou\u017E\u00EDv\u00E1na v aplikac\u00EDch, kdy nen\u00ED cel\u00E1 struktura ulo\u017Eena v opera\u010Dn\u00ED pam\u011Bti (RAM), ale v n\u011Bjak\u00E9 sekund\u00E1rn\u00ED pam\u011Bti, jako je pevn\u00FD disk (nap\u0159\u00EDklad datab\u00E1ze). Proto\u017Ee p\u0159\u00EDstup do tohoto typu pam\u011Bti je n\u00E1ro\u010Dn\u00FD na \u010Das (hlavn\u011B vyhled\u00E1n\u00ED n\u00E1hodn\u00E9 polo\u017Eky), sna\u017E\u00EDme se minimalizovat po\u010Det p\u0159\u00EDstup\u016F do t\u00E9to pam\u011Bti."@cs . "\uC804\uC0B0\uD559\uC5D0\uC11C B-\uD2B8\uB9AC(B-tree)\uB294 \uB370\uC774\uD130\uBCA0\uC774\uC2A4\uC640 \uD30C\uC77C \uC2DC\uC2A4\uD15C\uC5D0\uC11C \uB110\uB9AC \uC0AC\uC6A9\uB418\uB294 \uD2B8\uB9AC \uC790\uB8CC\uAD6C\uC870\uC758 \uC77C\uC885\uC73C\uB85C, \uC774\uC9C4 \uD2B8\uB9AC\uB97C \uD655\uC7A5\uD574 \uD558\uB098\uC758 \uB178\uB4DC\uAC00 \uAC00\uC9C8 \uC218 \uC788\uB294 \uC790\uC2DD \uB178\uB4DC\uC758 \uCD5C\uB300 \uC22B\uC790\uAC00 2\uBCF4\uB2E4 \uD070 \uD2B8\uB9AC \uAD6C\uC870\uC774\uB2E4. \uBC29\uB300\uD55C \uC591\uC758 \uC800\uC7A5\uB41C \uC790\uB8CC\uB97C \uAC80\uC0C9\uD574\uC57C \uD558\uB294 \uACBD\uC6B0 \uAC80\uC0C9\uC5B4\uC640 \uC790\uB8CC\uB97C \uC77C\uC77C\uC774 \uBE44\uAD50\uD558\uB294 \uBC29\uC2DD\uC740 \uBE44\uD6A8\uC728\uC801\uC774\uB2E4. B-\uD2B8\uB9AC\uB294 \uC790\uB8CC\uB97C \uC815\uB82C\uB41C \uC0C1\uD0DC\uB85C \uBCF4\uAD00\uD558\uACE0, \uC0BD\uC785 \uBC0F \uC0AD\uC81C\uB97C \uB300\uC218 \uC2DC\uAC04\uC73C\uB85C \uD560 \uC218 \uC788\uB2E4. \uB300\uBD80\uBD84\uC758 \uC774\uC9C4 \uD2B8\uB9AC\uB294 \uD56D\uBAA9\uC774 \uC0BD\uC785\uB420 \uB54C \uD558\uD5A5\uC2DD\uC73C\uB85C \uAD6C\uC131\uB418\uB294 \uB370 \uBC18\uD574, B-\uD2B8\uB9AC\uB294 \uC77C\uBC18\uC801\uC73C\uB85C \uC0C1\uD5A5\uC2DD\uC73C\uB85C \uAD6C\uC131\uB41C\uB2E4. n\uAC1C\uC758 \uD0A4 (s1,s2,s3...,sn)\uAC00 \uC788\uB294 \uD55C \uB178\uB4DC\uB97C \uC0DD\uAC01\uD574 \uBCF4\uC790. \uD0A4\uC9D1\uD569\uC740 \uC815\uB82C\uB418\uC5B4 \uC788\uB2E4\uACE0 \uD55C\uB2E4. (\uC989, s1 B-\uD2B8\uB9AC\uC758 \uAE30\uBCF8 \uAC1C\uB150\uC740 \uB0B4\uBD80 \uB178\uB4DC\uC758 \uC790\uC2DD \uB178\uB4DC\uC758 \uC218\uAC00 \uBBF8\uB9AC \uC815\uD574\uC9C4 \uBC94\uC704 \uB0B4\uC5D0\uC11C \uBCC0\uACBD\uAC00\uB2A5\uD558\uB2E4\uB294 \uAC83\uC774\uB2E4. \uD56D\uBAA9\uC774 \uC0BD\uC785\uB418\uAC70\uB098 \uC0AD\uC81C\uB420 \uB54C, \uB0B4\uBD80 \uB178\uB4DC\uB294 \uD574\uB2F9 \uBC94\uC704\uC758 \uC790\uC2DD \uB178\uB4DC\uC758 \uC218\uB97C \uB9CC\uC871\uC2DC\uD0A4\uAE30 \uC704\uD574 \uBD84\uB9AC\uB418\uAC70\uB098 \uD639\uC740 \uB2E4\uB978 \uB178\uB4DC\uC640 \uD569\uCCD0\uC9C0\uAC8C \uB41C\uB2E4. \uC790\uC2DD \uB178\uB4DC\uC758 \uC218\uAC00 \uC77C\uC815 \uBC94\uC704 \uB0B4\uC5D0\uC11C\uB9CC \uC720\uC9C0\uB418\uBA74 \uB418\uBBC0\uB85C \uBD84\uB9AC \uBC0F \uD569\uCE68\uC744 \uD1B5\uD55C \uC7AC\uADE0\uD615 \uACFC\uC815\uC740 \uB2E4\uB978 \uC790\uAC00 \uADE0\uD615 \uC774\uC9C4 \uD0D0\uC0C9 \uD2B8\uB9AC\uB9CC\uD07C \uC790\uC8FC \uC77C\uC5B4\uB098\uC9C0 \uC54A\uC9C0\uB9CC, \uC800\uC7A5 \uACF5\uAC04\uC5D0\uC11C\uC758 \uC190\uC2E4\uC740 \uC788\uAC8C \uB41C\uB2E4. \uC790\uC2DD \uB178\uB4DC\uC758 \uCD5C\uC18C \uBC0F \uCD5C\uB300\uC218\uB294 \uC77C\uBC18\uC801\uC73C\uB85C \uD2B9\uBCC4\uD55C \uAD6C\uD604\uC5D0 \uB300\uD574\uC11C \uACB0\uC815\uB418\uC5B4 \uC788\uB2E4. \uC608\uB97C \uB4E4\uC5B4, 2-3 B-\uD2B8\uB9AC(\uD639\uC740 \uB2E8\uC21C\uD788 2-3 \uD2B8\uB9AC)\uC5D0\uC11C \uAC01 \uB0B4\uBD80 \uB178\uB4DC\uB294 2 \uB610\uB294 3\uAC1C\uC758 \uC790\uC2DD \uB178\uB4DC\uB97C \uAC00\uC9C8 \uC218 \uC788\uB2E4. \uB9CC\uC57D \uD5C8\uC6A9\uB418\uC9C0 \uC54A\uC740 \uC218\uC758 \uC790\uC2DD \uB178\uB4DC\uB97C \uAC00\uC9C8 \uACBD\uC6B0, \uD574\uB2F9 \uB0B4\uBD80 \uB178\uB4DC\uB294 \uBD80\uC801\uC808\uD55C \uC0C1\uD0DC\uC5D0 \uC788\uB2E4\uACE0 \uD55C\uB2E4. B-\uD2B8\uB9AC\uB294 \uB178\uB4DC \uC811\uADFC\uC2DC\uAC04\uC774 \uB178\uB4DC\uC5D0\uC11C\uC758 \uC5F0\uC0B0\uC2DC\uAC04\uC5D0 \uBE44\uD574 \uD6E8\uC52C \uAE38 \uACBD\uC6B0, \uB2E4\uB978 \uAD6C\uD604 \uBC29\uC2DD\uC5D0 \uBE44\uD574 \uC0C1\uB2F9\uD55C \uC774\uC810\uC744 \uAC00\uC9C0\uACE0 \uC788\uB2E4. \uC774\uB294 \uB300\uBD80\uBD84\uC758 \uB178\uB4DC\uAC00 \uD558\uB4DC\uB514\uC2A4\uD06C\uC640 \uAC19\uC740 \uC5D0 \uC788\uC744 \uB54C \uC77C\uBC18\uC801\uC73C\uB85C \uC77C\uC5B4\uB09C\uB2E4. \uAC01 \uB0B4\uBD80 \uB178\uB4DC\uC5D0 \uC788\uB294 \uC790\uC2DD \uB178\uB4DC\uC758 \uC218\uB97C \uCD5C\uB300\uD654\uD568\uC73C\uB85C\uC368, \uD2B8\uB9AC\uC758 \uB192\uC774\uB294 \uAC10\uC18C\uD558\uBA70, \uADE0\uD615\uB9DE\uCDA4\uC740 \uB35C \uC77C\uC5B4\uB098\uACE0, \uD6A8\uC728\uC740 \uC99D\uAC00\uD558\uAC8C \uB41C\uB2E4. \uB300\uAC1C \uC774 \uAC12\uC740 \uAC01 \uB178\uB4DC\uAC00 \uC644\uC804\uD55C \uD558\uB098\uC758 \uB514\uC2A4\uD06C \uBE14\uB85D \uD639\uC740 2\uCC28 \uC800\uC7A5\uC7A5\uCE58\uC5D0\uC11C\uC758 \uC720\uC0AC\uD55C \uD06C\uAE30\uB97C \uCC28\uC9C0\uD558\uB3C4\uB85D \uC815\uD574\uC9C4\uB2E4. B-\uD2B8\uB9AC\uC758 \uCC3D\uC2DC\uC790\uC778 \uB8E8\uB3CC\uD504 \uBC14\uC774\uC5B4\uB294 'B'\uAC00 \uBB34\uC5C7\uC744 \uC758\uBBF8\uD558\uB294\uC9C0 \uB530\uB85C \uC5B8\uAE09\uD558\uC9C0\uB294 \uC54A\uC558\uB2E4. \uAC00\uC7A5 \uAC00\uB2A5\uC131 \uC788\uB294 \uB300\uB2F5\uC740 \uB9AC\uD504 \uB178\uB4DC\uB97C \uAC19\uC740 \uB192\uC774\uC5D0\uC11C \uC720\uC9C0\uC2DC\uCF1C\uC8FC\uBBC0\uB85C \uADE0\uD615\uC7A1\uD600\uC788\uB2E4(balanced)\uB294 \uB73B\uC5D0\uC11C\uC758 'B'\uB77C\uB294 \uAC83\uC774\uB2E4. '\uBC14\uC774\uC5B4(Bayer)'\uC758 'B'\uB97C \uB098\uD0C0\uB0B8\uB2E4\uB294 \uC758\uACAC\uB3C4, \uD639\uC740 \uADF8\uAC00 \uC77C\uD588\uB358 \uBCF4\uC789 \uACFC\uD559 \uC5F0\uAD6C\uC18C(Boeing Scientific Research Labs)\uC5D0\uC11C\uC758 'B'\uB97C \uB098\uD0C0\uB0B8\uB2E4\uB294 \uC758\uACAC\uB3C4 \uC788\uB2E4."@ko . . . "B-drzewo"@pl . . . . "Arbre-B"@ca . . . . . . "B\u6811\uFF08\u82F1\u8A9E\uFF1AB-tree\uFF09\uFF0C\u662F\u4E00\u79CD\u5728\u8BA1\u7B97\u673A\u79D1\u5B66\u81EA\u5E73\u8861\u7684\u6811\uFF0C\u80FD\u591F\u4FDD\u6301\u6570\u636E\u6709\u5E8F\u3002\u9019\u7A2E\u8CC7\u6599\u7D50\u69CB\u80FD\u5920\u8B93\u67E5\u627E\u6578\u64DA\u3001\u987A\u5E8F\u8BBF\u95EE\u3001\u63D2\u5165\u6578\u64DA\u53CA\u522A\u9664\u7684\u52D5\u4F5C\uFF0C\u90FD\u5728\u5C0D\u6578\u6642\u9593\u5167\u5B8C\u6210\u3002B\u6811\uFF0C\u6982\u62EC\u6765\u8BF4\u662F\u4E00\u4E2A\u4E00\u822C\u5316\u7684\u4E8C\u5143\u641C\u5C0B\u6A39\uFF08binary search tree\uFF09\u4E00\u500B\u7BC0\u9EDE\u53EF\u4EE5\u62E5\u67092\u4E2A\u4EE5\u4E0A\u7684\u5B50\u8282\u70B9\u3002\u4E0E\u81EA\u5E73\u8861\u4E8C\u53C9\u67E5\u627E\u6811\u4E0D\u540C\uFF0CB\u6811\u9002\u7528\u4E8E\u8BFB\u5199\u76F8\u5BF9\u5927\u7684\u6570\u636E\u5757\u7684\u5B58\u50A8\u7CFB\u7EDF\uFF0C\u4F8B\u5982\u78C1\u76D8\u3002B\u6811\u51CF\u5C11\u5B9A\u4F4D\u8BB0\u5F55\u65F6\u6240\u7ECF\u5386\u7684\u4E2D\u95F4\u8FC7\u7A0B\uFF0C\u4ECE\u800C\u52A0\u5FEB\u5B58\u53D6\u901F\u5EA6\u3002B\u6811\u8FD9\u79CD\u6570\u636E\u7ED3\u6784\u53EF\u4EE5\u7528\u6765\u63CF\u8FF0\u5916\u90E8\u5B58\u50A8\u3002\u9019\u7A2E\u8CC7\u6599\u7D50\u69CB\u5E38\u88AB\u61C9\u7528\u5728\u6570\u636E\u5E93\u548C\u6587\u4EF6\u7CFB\u7EDF\u7684\u5B9E\u73B0\u4E0A\u3002"@zh . . "B-\u0434\u0435\u0440\u0435\u0432\u043E"@ru . . "\u00C1rbol-B"@es . . "B-\u0434\u0435\u0440\u0435\u0432\u043E (\u043F\u043E-\u0440\u0443\u0441\u0441\u043A\u0438 \u043F\u0440\u043E\u0438\u0437\u043D\u043E\u0441\u0438\u0442\u0441\u044F \u043A\u0430\u043A \u0411\u0438-\u0434\u0435\u0440\u0435\u0432\u043E) \u2014 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u043D\u044B\u0445, \u0434\u0435\u0440\u0435\u0432\u043E \u043F\u043E\u0438\u0441\u043A\u0430. \u0421 \u0442\u043E\u0447\u043A\u0438 \u0437\u0440\u0435\u043D\u0438\u044F \u0432\u043D\u0435\u0448\u043D\u0435\u0433\u043E \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u043E\u0433\u043E \u043F\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043B\u0435\u043D\u0438\u044F \u2014 \u0441\u0431\u0430\u043B\u0430\u043D\u0441\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u043E\u0435, \u0441\u0438\u043B\u044C\u043D\u043E \u0432\u0435\u0442\u0432\u0438\u0441\u0442\u043E\u0435 \u0434\u0435\u0440\u0435\u0432\u043E. \u0427\u0430\u0441\u0442\u043E \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u0443\u0435\u0442\u0441\u044F \u0434\u043B\u044F \u0445\u0440\u0430\u043D\u0435\u043D\u0438\u044F \u0434\u0430\u043D\u043D\u044B\u0445 \u0432\u043E \u0432\u043D\u0435\u0448\u043D\u0435\u0439 \u043F\u0430\u043C\u044F\u0442\u0438. \u0418\u0441\u043F\u043E\u043B\u044C\u0437\u043E\u0432\u0430\u043D\u0438\u0435 B-\u0434\u0435\u0440\u0435\u0432\u044C\u0435\u0432 \u0432\u043F\u0435\u0440\u0432\u044B\u0435 \u0431\u044B\u043B\u043E \u043F\u0440\u0435\u0434\u043B\u043E\u0436\u0435\u043D\u043E \u0420. \u0411\u044D\u0439\u0435\u0440\u043E\u043C (\u0430\u043D\u0433\u043B. R. Bayer) \u0438 \u042D. \u041C\u0430\u043A\u041A\u0440\u0435\u0439\u0442\u043E\u043C (\u0430\u043D\u0433\u043B. E. McCreight) \u0432 1970 \u0433\u043E\u0434\u0443. \u0421\u0431\u0430\u043B\u0430\u043D\u0441\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u043E\u0441\u0442\u044C \u043E\u0437\u043D\u0430\u0447\u0430\u0435\u0442, \u0447\u0442\u043E \u0434\u043B\u0438\u043D\u044B \u043B\u044E\u0431\u044B\u0445 \u0434\u0432\u0443\u0445 \u043F\u0443\u0442\u0435\u0439 \u043E\u0442 \u043A\u043E\u0440\u043D\u044F \u0434\u043E \u043B\u0438\u0441\u0442\u044C\u0435\u0432 \u0440\u0430\u0437\u043B\u0438\u0447\u0430\u044E\u0442\u0441\u044F \u043D\u0435 \u0431\u043E\u043B\u0435\u0435, \u0447\u0435\u043C \u043D\u0430 \u0435\u0434\u0438\u043D\u0438\u0446\u0443. \u0412\u0435\u0442\u0432\u0438\u0441\u0442\u043E\u0441\u0442\u044C \u0434\u0435\u0440\u0435\u0432\u0430 \u2014 \u044D\u0442\u043E \u0441\u0432\u043E\u0439\u0441\u0442\u0432\u043E \u043A\u0430\u0436\u0434\u043E\u0433\u043E \u0443\u0437\u043B\u0430 \u0434\u0435\u0440\u0435\u0432\u0430 \u0441\u0441\u044B\u043B\u0430\u0442\u044C\u0441\u044F \u043D\u0430 \u0431\u043E\u043B\u044C\u0448\u043E\u0435 \u0447\u0438\u0441\u043B\u043E \u0443\u0437\u043B\u043E\u0432-\u043F\u043E\u0442\u043E\u043C\u043A\u043E\u0432. \u0421 \u0442\u043E\u0447\u043A\u0438 \u0437\u0440\u0435\u043D\u0438\u044F \u0444\u0438\u0437\u0438\u0447\u0435\u0441\u043A\u043E\u0439 \u043E\u0440\u0433\u0430\u043D\u0438\u0437\u0430\u0446\u0438\u0438 B-\u0434\u0435\u0440\u0435\u0432\u043E \u043F\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043B\u044F\u0435\u0442\u0441\u044F \u043A\u0430\u043A \u043C\u0443\u043B\u044C\u0442\u0438\u0441\u043F\u0438\u0441\u043E\u0447\u043D\u0430\u044F \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0441\u0442\u0440\u0430\u043D\u0438\u0446 \u043F\u0430\u043C\u044F\u0442\u0438, \u0442\u043E \u0435\u0441\u0442\u044C \u043A\u0430\u0436\u0434\u043E\u043C\u0443 \u0443\u0437\u043B\u0443 \u0434\u0435\u0440\u0435\u0432\u0430 \u0441\u043E\u043E\u0442\u0432\u0435\u0442\u0441\u0442\u0432\u0443\u0435\u0442 \u0431\u043B\u043E\u043A \u043F\u0430\u043C\u044F\u0442\u0438 (\u0441\u0442\u0440\u0430\u043D\u0438\u0446\u0430). \u0412\u043D\u0443\u0442\u0440\u0435\u043D\u043D\u0438\u0435 \u0438 \u043B\u0438\u0441\u0442\u043E\u0432\u044B\u0435 \u0441\u0442\u0440\u0430\u043D\u0438\u0446\u044B \u043E\u0431\u044B\u0447\u043D\u043E \u0438\u043C\u0435\u044E\u0442 \u0440\u0430\u0437\u043D\u0443\u044E \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0443."@ru . . . . . . . . . "\u0411-\u0434\u0435\u0440\u0435\u0432\u043E"@uk . . . . . . . . . . "4674"^^ . . . . . "O"@en . "1123980396"^^ . . "B-albero"@it . . . . "February 2012"@en . . . . "O"@en . . . "O"@en . . . . . "O"@en . "Ett B-tr\u00E4d \u00E4r en datastruktur i form av ett balanserat . Varje nod har mellan m och m/2 barn, d\u00E4r m \u00E4r ett givet heltal st\u00F6rre \u00E4n 1. Roten kan ha s\u00E5 f\u00E5 som 2 stycken n. Den h\u00E4r strukturen kan vara anv\u00E4ndbar om stora delar av tr\u00E4det finns i l\u00E5ngsammare minnen (som en h\u00E5rddisk) eftersom tr\u00E4dets h\u00F6jd kan reduceras genom att man v\u00E4ljer ett stort m."@sv . . "Ein B-Baum (englisch B-tree) ist in der Informatik eine Daten- oder Indexstruktur, die h\u00E4ufig in Datenbanken und Dateisystemen eingesetzt wird. Ein B-Baum ist ein immer vollst\u00E4ndig balancierter Baum, der Daten nach Schl\u00FCsseln sortiert speichert. Er kann bin\u00E4r sein, ist aber im Allgemeinen kein Bin\u00E4rbaum. Das Einf\u00FCgen, Suchen und L\u00F6schen von Daten in B-B\u00E4umen ist in amortisiert logarithmischer Zeit m\u00F6glich. B-B\u00E4ume wachsen und schrumpfen, anders als viele Suchb\u00E4ume, von den Bl\u00E4ttern hin zur Wurzel."@de . . "In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children. Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as databases and file systems."@en . . . . "the discussion below uses \"element\", \"value\", \"key\", \"separator\", and \"separation value\" to mean essentially the same thing. The terms are not clearly defined. There are some subtle issues at the root and leaves"@en . . . "In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children. Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as databases and file systems."@en . . "B\u6811"@zh . "O"@en . . . "O"@en . . . . . "\u0411-\u0434\u0435\u0440\u0435\u0432\u0430 (\u0430\u043D\u0433\u043B. B-tree) \u2014 \u0446\u0435 \u043E\u0434\u0438\u043D \u0437 \u0432\u0438\u0434\u0456\u0432 \u0437\u0431\u0430\u043B\u0430\u043D\u0441\u043E\u0432\u0430\u043D\u0438\u0445 \u0434\u0435\u0440\u0435\u0432, \u0449\u043E \u0437\u0430\u0431\u0435\u0437\u043F\u0435\u0447\u0443\u044E\u0442\u044C \u0435\u0444\u0435\u043A\u0442\u0438\u0432\u043D\u0435 \u0437\u0431\u0435\u0440\u0435\u0436\u0435\u043D\u043D\u044F \u0456\u043D\u0444\u043E\u0440\u043C\u0430\u0446\u0456\u0457 \u043D\u0430 \u043C\u0430\u0433\u043D\u0456\u0442\u043D\u0438\u0445 \u0434\u0438\u0441\u043A\u0430\u0445 \u0442\u0430 \u0456\u043D\u0448\u0438\u0445 \u043F\u0440\u0438\u0441\u0442\u0440\u043E\u044F\u0445 \u0437 \u043F\u0440\u044F\u043C\u0438\u043C \u0434\u043E\u0441\u0442\u0443\u043F\u043E\u043C. \u0411-\u0434\u0435\u0440\u0435\u0432\u0430 \u0441\u0445\u043E\u0436\u0456 \u043D\u0430 \u0447\u0435\u0440\u0432\u043E\u043D\u043E-\u0447\u043E\u0440\u043D\u0456, \u0440\u0456\u0437\u043D\u0438\u0446\u044F \u0432 \u0442\u043E\u043C\u0443, \u0449\u043E \u0432 \u0411-\u0434\u0435\u0440\u0435\u0432\u0456 \u0432\u0443\u0437\u043E\u043B \u043C\u043E\u0436\u0435 \u043C\u0430\u0442\u0438 \u0431\u0430\u0433\u0430\u0442\u043E \u0434\u0456\u0442\u0435\u0439, \u043D\u0430 \u043F\u0440\u0430\u043A\u0442\u0438\u0446\u0456 \u0434\u043E \u0442\u0438\u0441\u044F\u0447\u0456, \u0437\u0430\u043B\u0435\u0436\u043D\u043E \u0432\u0456\u0434 \u0445\u0430\u0440\u0430\u043A\u0442\u0435\u0440\u0438\u0441\u0442\u0438\u043A \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u0432\u0430\u043D\u043E\u0433\u043E \u0434\u0438\u0441\u043A\u0430. \u0417\u0430\u0432\u0434\u044F\u043A\u0438 \u0446\u044C\u043E\u043C\u0443 \u043A\u043E\u043D\u0441\u0442\u0430\u043D\u0442\u0430 \u0432 \u043E\u0446\u0456\u043D\u0446\u0456 O(log n) \u0434\u043B\u044F \u0432\u0438\u0441\u043E\u0442\u0438 \u0434\u0435\u0440\u0435\u0432\u0430 \u043C\u0435\u043D\u0448\u0430, \u043D\u0456\u0436 \u0434\u043B\u044F \u0447\u0435\u0440\u0432\u043E\u043D\u043E-\u0447\u043E\u0440\u043D\u0438\u0445 \u0434\u0435\u0440\u0435\u0432. \u042F\u043A \u0456 \u0447\u0435\u0440\u0432\u043E\u043D\u043E-\u0447\u043E\u0440\u043D\u0456 \u0434\u0435\u0440\u0435\u0432\u0430, \u0411-\u0434\u0435\u0440\u0435\u0432\u0430 \u0434\u043E\u0437\u0432\u043E\u043B\u044F\u044E\u0442\u044C \u0440\u0435\u0430\u043B\u0456\u0437\u0443\u0432\u0430\u0442\u0438 \u0431\u0430\u0433\u0430\u0442\u043E \u043E\u043F\u0435\u0440\u0430\u0446\u0456\u0439 \u0437 \u043C\u043D\u043E\u0436\u0438\u043D\u0430\u043C\u0438 \u0440\u043E\u0437\u043C\u0456\u0440\u0443 n \u0437\u0430 \u0447\u0430\u0441 O(log n)."@uk . . . . . "B-tree"@en . "B-drzewo \u2013 drzewiasta struktura danych, przechowuj\u0105ca klucze w pewnym porz\u0105dku i powi\u0105zane z nimi dane, u\u017Cywana przede wszystkim w systemach baz danych. G\u0142\u00F3wnym pomys\u0142em zastosowanym w B-drzewach jest struktura wewn\u0119trznego w\u0119z\u0142a. Ka\u017Cdy w\u0119ze\u0142 mo\u017Ce posiada\u0107 od do w\u0119z\u0142\u00F3w potomnych, gdzie to rz\u0105d B-drzewa; wyj\u0105tkiem jest korze\u0144, kt\u00F3ry mo\u017Ce posiada\u0107 od do w\u0119z\u0142\u00F3w potomnych. Te za\u0142o\u017Cenia gwarantuj\u0105, \u017Ce wysoko\u015B\u0107 drzewa zawieraj\u0105cego kluczy b\u0119dzie niska, rz\u0119du co te\u017C powoduje, \u017Ce asymptotyczna z\u0142o\u017Cono\u015B\u0107 czasowa operacji podstawowych: wyszukiwania, wstawiania i kasowania kluczy jest rz\u0119du"@pl . . "\u00C1rvore B"@pt . . . . . . . . . . "B-tree"@en . . . . . . "En informatique, un arbre B (appel\u00E9 aussi B-arbre par analogie au terme anglais \u00AB B-tree \u00BB) est une structure de donn\u00E9es en arbre \u00E9quilibr\u00E9. Les arbres B sont principalement mis en \u0153uvre dans les m\u00E9canismes de gestion de bases de donn\u00E9es et de syst\u00E8mes de fichiers. Ils stockent les donn\u00E9es sous une forme tri\u00E9e et permettent une ex\u00E9cution des op\u00E9rations d'insertion et de suppression en temps toujours logarithmique. Le principe est de permettre aux n\u0153uds parents de poss\u00E9der plus de deux n\u0153uds enfants : c'est une g\u00E9n\u00E9ralisation de l\u2019arbre binaire de recherche. Ce principe minimise la taille de l'arbre et r\u00E9duit le nombre d'op\u00E9rations d'\u00E9quilibrage. De plus un arbre B grandit \u00E0 partir de la racine, contrairement \u00E0 un arbre binaire de recherche qui cro\u00EEt \u00E0 partir des feuilles. Le cr\u00E9ateur des arbres B, Rudolf Bayer, n'a pas explicit\u00E9 la signification du \u00AB B \u00BB. L'explication la plus fr\u00E9quente est que le B correspond au terme anglais \u00AB balanced \u00BB (en fran\u00E7ais : \u00AB \u00E9quilibr\u00E9 \u00BB). Cependant, il pourrait aussi d\u00E9couler de \u00AB Bayer \u00BB, du nom du cr\u00E9ateur, ou de \u00AB Boeing \u00BB, du nom de la firme pour laquelle le cr\u00E9ateur travaillait (Boeing Scientific Research Labs)."@fr . . . "B\u6728\uFF08\u3073\u30FC\u304D\u3001\u82F1:B-tree\uFF09\u306F\u3001\u8A08\u7B97\u6A5F\u79D1\u5B66\u306B\u304A\u3051\u308B\u30C7\u30FC\u30BF\u69CB\u9020\u3001\u7279\u306B\u6728\u69CB\u9020\u306E\u4E00\u3064\u3002\u30D6\u30ED\u30C3\u30AF\u5358\u4F4D\u306E\u30E9\u30F3\u30C0\u30E0\u30A2\u30AF\u30BB\u30B9\u304C\u53EF\u80FD\u306A\u88DC\u52A9\u8A18\u61B6\u88C5\u7F6E\uFF08\u30CF\u30FC\u30C9\u30C7\u30A3\u30B9\u30AF\u30C9\u30E9\u30A4\u30D6\u306A\u3069\uFF09\u4E0A\u306B\u6728\u69CB\u9020\u3092\u5B9F\u88C5\u3059\u308B\u306E\u306B\u9069\u3057\u305F\u69CB\u9020\u3068\u3057\u3066\u77E5\u3089\u308C\u308B\u3002 \u5B9F\u30B7\u30B9\u30C6\u30E0\u3067\u3082\u591A\u7528\u3055\u308C\u3066\u304A\u308A\u3001\u30C7\u30FC\u30BF\u30D9\u30FC\u30B9\u7BA1\u7406\u30B7\u30B9\u30C6\u30E0\u306E\u591A\u304F\u306FB\u6728\u306B\u3088\u308B\u7D22\u5F15\u3092\u5B9F\u88C5\u3057\u3066\u3044\u308B\uFF08B\u6728\u306E\u6539\u826F\u578B\u307E\u305F\u306F\u4E9C\u7A2E\u3067\u3042\u308BB+\u6728\u3084B*\u6728\u3092\u4F7F\u3046\u3053\u3068\u304C\u591A\u3044\uFF09\u3002"@ja . . . "En informatique, un arbre B (appel\u00E9 aussi B-arbre par analogie au terme anglais \u00AB B-tree \u00BB) est une structure de donn\u00E9es en arbre \u00E9quilibr\u00E9. Les arbres B sont principalement mis en \u0153uvre dans les m\u00E9canismes de gestion de bases de donn\u00E9es et de syst\u00E8mes de fichiers. Ils stockent les donn\u00E9es sous une forme tri\u00E9e et permettent une ex\u00E9cution des op\u00E9rations d'insertion et de suppression en temps toujours logarithmique."@fr . . . . . . . . . . "B \uD2B8\uB9AC"@ko . . . "B\u6728\uFF08\u3073\u30FC\u304D\u3001\u82F1:B-tree\uFF09\u306F\u3001\u8A08\u7B97\u6A5F\u79D1\u5B66\u306B\u304A\u3051\u308B\u30C7\u30FC\u30BF\u69CB\u9020\u3001\u7279\u306B\u6728\u69CB\u9020\u306E\u4E00\u3064\u3002\u30D6\u30ED\u30C3\u30AF\u5358\u4F4D\u306E\u30E9\u30F3\u30C0\u30E0\u30A2\u30AF\u30BB\u30B9\u304C\u53EF\u80FD\u306A\u88DC\u52A9\u8A18\u61B6\u88C5\u7F6E\uFF08\u30CF\u30FC\u30C9\u30C7\u30A3\u30B9\u30AF\u30C9\u30E9\u30A4\u30D6\u306A\u3069\uFF09\u4E0A\u306B\u6728\u69CB\u9020\u3092\u5B9F\u88C5\u3059\u308B\u306E\u306B\u9069\u3057\u305F\u69CB\u9020\u3068\u3057\u3066\u77E5\u3089\u308C\u308B\u3002 \u5B9F\u30B7\u30B9\u30C6\u30E0\u3067\u3082\u591A\u7528\u3055\u308C\u3066\u304A\u308A\u3001\u30C7\u30FC\u30BF\u30D9\u30FC\u30B9\u7BA1\u7406\u30B7\u30B9\u30C6\u30E0\u306E\u591A\u304F\u306FB\u6728\u306B\u3088\u308B\u7D22\u5F15\u3092\u5B9F\u88C5\u3057\u3066\u3044\u308B\uFF08B\u6728\u306E\u6539\u826F\u578B\u307E\u305F\u306F\u4E9C\u7A2E\u3067\u3042\u308BB+\u6728\u3084B*\u6728\u3092\u4F7F\u3046\u3053\u3068\u304C\u591A\u3044\uFF09\u3002"@ja . . "B-tr\u00E4d"@sv . "Un B-albero (in inglese: B-tree) \u00E8 una struttura dati che permette la rapida localizzazione dei file (record o chiavi), specie nelle basi di dati, riducendo il numero di volte che un utente necessita per accedere alla memoria in cui il dato \u00E8 salvato. Essi derivano dagli alberi binari di ricerca, in quanto ogni chiave appartenente al sottoalbero sinistro di un nodo \u00E8 di valore inferiore rispetto a ogni chiave appartenente ai sottoalberi alla sua destra; inoltre, la loro struttura ne garantisce il : per ogni nodo, le altezze dei sottoalberi destro e sinistro differiscono al pi\u00F9 di una unit\u00E0. Questo \u00E8 il vantaggio principale del B-albero, e permette di compiere operazioni di inserimento, cancellazione e ricerca in tempi ammortizzati logaritmicamente."@it . . . "En las ciencias de la computaci\u00F3n, los \u00E1rboles-B o B-\u00E1rboles son estructuras de datos de \u00E1rbol que se encuentran com\u00FAnmente en las implementaciones de bases de datos y sistemas de archivos. Al igual que los \u00E1rboles binarios de b\u00FAsqueda, son \u00E1rboles balanceados de b\u00FAsqueda, pero cada nodo puede poseer m\u00E1s de dos hijos.\u200B Los \u00E1rboles B mantienen los datos ordenados y las inserciones y eliminaciones se realizan en tiempo logar\u00EDtmico amortizado."@es . . "En les ci\u00E8ncies de la computaci\u00F3, els arbres-B o B-arbres s\u00F3n que es troben comunament en les implementacions de bases de dades i sistemes d'arxius. Els arbres B mantenen les dades ordenades i les insercions i eliminacions es realitzen en temps logar\u00EDtmic amortitzat."@ca . . . "Em ci\u00EAncia da computa\u00E7\u00E3o, uma \u00E1rvore B \u00E9 uma estrutura de dados em \u00E1rvore, auto-balanceada, que armazena dados classificados e permite pesquisas, acesso sequencial, inser\u00E7\u00F5es e remo\u00E7\u00F5es em tempo logar\u00EDtmico. A \u00E1rvore B \u00E9 uma generaliza\u00E7\u00E3o de uma \u00E1rvore de pesquisa bin\u00E1ria em que um n\u00F3 pode ter mais que dois filhos. Diferente das \u00E1rvores de pesquisa bin\u00E1ria auto-balanceadas, a \u00E1rvore B \u00E9 bem adaptada para sistemas de armazenamento que leem e escrevem blocos de dados relativamente grandes, como discos. \u00C9 normalmente usada em bancos de dados e sistemas de arquivos e foi projetada para funcionar especialmente em mem\u00F3ria secund\u00E1ria como um disco magn\u00E9tico ou outros dispositivos de armazenamento secund\u00E1rio. As \u00E1rvores B s\u00E3o semelhantes as \u00E1rvores preto e vermelho, mas s\u00E3o melhores para minimizar opera\u00E7\u00F5es de E/S de disco. Muitos sistemas de bancos de dados usam \u00E1rvores B ou varia\u00E7\u00F5es da mesma para armazenar informa\u00E7\u00F5es. Dentre suas propriedades ela permite a inser\u00E7\u00E3o, remo\u00E7\u00E3o e busca de chaves numa complexidade temporal logar\u00EDtmica e, por esse motivo, \u00E9 muito empregada em aplica\u00E7\u00F5es que necessitam manipular grandes quantidades de informa\u00E7\u00E3o tais como um banco de dados ou um sistemas de arquivos. Inventada por Rudolf Bayer e Edward Meyers McCreight em 1971 enquanto trabalhavam no Boeing Scientific Research Labs, a origem do nome (\u00E1rvore B) n\u00E3o foi definida por estes. Especula-se que o B venha da palavra balanceamento, do nome de um de seus inventores Bayer ou de Boeing, nome da empresa. \u00C1rvores B s\u00E3o uma generaliza\u00E7\u00E3o das \u00E1rvores bin\u00E1ria de busca, pois cada n\u00F3 de uma \u00E1rvore bin\u00E1ria armazena uma \u00FAnica chave de busca, enquanto as \u00E1rvores B armazenam um n\u00FAmero maior do que um de chaves de busca em cada n\u00F3, ou no termo mais usual para essa \u00E1rvore, em cada p\u00E1gina. Como a ideia principal das \u00E1rvores B \u00E9 trabalhar com dispositivos de mem\u00F3ria secund\u00E1ria, quanto menos acessos a disco a estrutura de dados proporcionar, melhor ser\u00E1 o desempenho do sistema na opera\u00E7\u00E3o de busca sobre os dados manipulados. O que significa o B, se significa algo, nunca foi estabelecido."@pt . . "\u0648\u064A\u0646\u0628\u063A\u064A \u0639\u062F\u0645 \u0627\u0644\u062E\u0644\u0637 \u0645\u0639 \u0627\u0644\u062A\u0633\u0644\u0633\u0644 \u0627\u0644\u062B\u0646\u0627\u0626\u064A \u0627\u0644\u0634\u062C\u0631\u064A (\u0628\u0627\u0644\u0625\u0646\u062C\u0644\u064A\u0632\u064A\u0629: Binary tree)\u200F \u0628\u064A \u062A\u0631\u064A (\u0628\u0627\u0644\u0625\u0646\u062C\u0644\u064A\u0632\u064A\u0629: B-tree)\u200F \u0641\u064A \u0639\u0644\u0648\u0645 \u0627\u0644\u062D\u0627\u0633\u0628 \u0647\u064A \u0628\u064A\u0627\u0646\u0627\u062A \u0645\u062A\u0633\u0644\u0633\u0644\u0629 \u0634\u062C\u0631\u064A\u0627 tree data structure , \u0648\u0645\u062A\u0648\u0627\u0632\u0646\u0647 \u0630\u0627\u062A\u064A\u0627 Self-Balancing \u0648\u0647\u064A \u062A\u0633\u0627\u0639\u062F \u0639\u0644\u0649 \u0628\u0642\u0627\u0621 \u0627\u0644\u0628\u064A\u0627\u0646\u0627\u062A \u0645\u0641\u0631\u0648\u0632\u0629 sorted \u0648\u062A\u0633\u0645\u062D \u0628\u0627\u0644\u0628\u062D\u062B searches \u0648\u0648\u0627\u0644\u0648\u0635\u0648\u0644 \u0627\u0644\u0645\u062A\u0633\u0644\u0633\u0644 sequential access \u0648\u0627\u0644\u0625\u062F\u0631\u0627\u062C insertions \u0648\u0627\u0644\u0645\u0633\u062D deletions \u0641\u064A \u0645\u0627 \u064A\u0633\u0645\u0649 logarithmic time , \u0628\u064A \u062A\u0631\u064A \u0647\u064A \u062A\u0639\u0645\u064A\u0645 \u0644\u0644\u0628\u062D\u062B \u0627\u0644\u0634\u062C\u0631\u064A \u0627\u0644\u062B\u0646\u0627\u0626\u064A \u062D\u064A\u062B \u0627\u0646 \u0627\u0644\u0631\u0627\u0628\u0637 \u0627\u0644\u0648\u0627\u062D\u062F Node \u064A\u0645\u0643\u0646 \u0627\u0646 \u064A\u0643\u0648\u0646 \u0644\u0647 \u0623\u0643\u062B\u0631 \u0645\u0646 \u0641\u0631\u0639\u064A\u0646 (Children),. \u0648\u0639\u0644\u0649 \u0639\u0643\u0633 \u0627\u0644\u0628\u064A\u0627\u0646\u0627\u062A \u0627\u0644\u0645\u062A\u0633\u0644\u0633\u0644\u0629 \u0634\u062C\u0631\u064A\u0627 \u0648\u0645\u062A\u0648\u0627\u0632\u0646\u0629 \u0630\u0627\u062A\u064A\u0627\u060C \u0628\u064A - \u062A\u0631\u064A \u0647\u064A \u0627\u0644\u062D\u0644 \u0627\u0644\u0627\u0645\u062B\u0644 \u0644\u0644\u0646\u0638\u0645 \u0627\u0644\u062A\u064A \u062A\u0642\u0631\u0627\u0621 \u0648\u062A\u0643\u062A\u0628 \u0627\u0644\u0643\u0645\u064A\u0627\u062A \u0627\u0644\u0643\u0628\u064A\u0631\u0629 \u0645\u0646 \u0627\u0644\u0628\u064A\u0627\u0646\u0627\u062A\u060C \u0628\u064A \u062A\u0631\u064A \u0647\u064A \u0645\u062B\u0627\u0644 \u062C\u064A\u062F \u0644\u0628\u0646\u064A\u0629 \u0627\u0644\u0628\u064A\u0627\u0646\u0627\u062A \u0644\u0644\u0630\u0627\u0643\u0631\u0629 \u0627\u0644\u062E\u0627\u0631\u062C\u064A\u0629 \u0648\u0647\u064A \u0645\u0633\u062A\u062E\u062F\u0645\u0629 \u0628\u0643\u062B\u0631\u0629 \u0641\u064A \u0642\u0648\u0627\u0639\u062F \u0627\u0644\u0628\u064A\u0627\u0646\u0627\u062A \u0648\u0646\u0638\u0645 \u0627\u0644\u0645\u0644\u0641\u0627\u062A."@ar . . . . . . "En les ci\u00E8ncies de la computaci\u00F3, els arbres-B o B-arbres s\u00F3n que es troben comunament en les implementacions de bases de dades i sistemes d'arxius. Els arbres B mantenen les dades ordenades i les insercions i eliminacions es realitzen en temps logar\u00EDtmic amortitzat."@ca . "B-strom"@cs . "Em ci\u00EAncia da computa\u00E7\u00E3o, uma \u00E1rvore B \u00E9 uma estrutura de dados em \u00E1rvore, auto-balanceada, que armazena dados classificados e permite pesquisas, acesso sequencial, inser\u00E7\u00F5es e remo\u00E7\u00F5es em tempo logar\u00EDtmico. A \u00E1rvore B \u00E9 uma generaliza\u00E7\u00E3o de uma \u00E1rvore de pesquisa bin\u00E1ria em que um n\u00F3 pode ter mais que dois filhos. Diferente das \u00E1rvores de pesquisa bin\u00E1ria auto-balanceadas, a \u00E1rvore B \u00E9 bem adaptada para sistemas de armazenamento que leem e escrevem blocos de dados relativamente grandes, como discos. O que significa o B, se significa algo, nunca foi estabelecido."@pt . . "\uC804\uC0B0\uD559\uC5D0\uC11C B-\uD2B8\uB9AC(B-tree)\uB294 \uB370\uC774\uD130\uBCA0\uC774\uC2A4\uC640 \uD30C\uC77C \uC2DC\uC2A4\uD15C\uC5D0\uC11C \uB110\uB9AC \uC0AC\uC6A9\uB418\uB294 \uD2B8\uB9AC \uC790\uB8CC\uAD6C\uC870\uC758 \uC77C\uC885\uC73C\uB85C, \uC774\uC9C4 \uD2B8\uB9AC\uB97C \uD655\uC7A5\uD574 \uD558\uB098\uC758 \uB178\uB4DC\uAC00 \uAC00\uC9C8 \uC218 \uC788\uB294 \uC790\uC2DD \uB178\uB4DC\uC758 \uCD5C\uB300 \uC22B\uC790\uAC00 2\uBCF4\uB2E4 \uD070 \uD2B8\uB9AC \uAD6C\uC870\uC774\uB2E4. \uBC29\uB300\uD55C \uC591\uC758 \uC800\uC7A5\uB41C \uC790\uB8CC\uB97C \uAC80\uC0C9\uD574\uC57C \uD558\uB294 \uACBD\uC6B0 \uAC80\uC0C9\uC5B4\uC640 \uC790\uB8CC\uB97C \uC77C\uC77C\uC774 \uBE44\uAD50\uD558\uB294 \uBC29\uC2DD\uC740 \uBE44\uD6A8\uC728\uC801\uC774\uB2E4. B-\uD2B8\uB9AC\uB294 \uC790\uB8CC\uB97C \uC815\uB82C\uB41C \uC0C1\uD0DC\uB85C \uBCF4\uAD00\uD558\uACE0, \uC0BD\uC785 \uBC0F \uC0AD\uC81C\uB97C \uB300\uC218 \uC2DC\uAC04\uC73C\uB85C \uD560 \uC218 \uC788\uB2E4. \uB300\uBD80\uBD84\uC758 \uC774\uC9C4 \uD2B8\uB9AC\uB294 \uD56D\uBAA9\uC774 \uC0BD\uC785\uB420 \uB54C \uD558\uD5A5\uC2DD\uC73C\uB85C \uAD6C\uC131\uB418\uB294 \uB370 \uBC18\uD574, B-\uD2B8\uB9AC\uB294 \uC77C\uBC18\uC801\uC73C\uB85C \uC0C1\uD5A5\uC2DD\uC73C\uB85C \uAD6C\uC131\uB41C\uB2E4. n\uAC1C\uC758 \uD0A4 (s1,s2,s3...,sn)\uAC00 \uC788\uB294 \uD55C \uB178\uB4DC\uB97C \uC0DD\uAC01\uD574 \uBCF4\uC790. \uD0A4\uC9D1\uD569\uC740 \uC815\uB82C\uB418\uC5B4 \uC788\uB2E4\uACE0 \uD55C\uB2E4. (\uC989, s1 B-\uD2B8\uB9AC\uB294 \uB178\uB4DC \uC811\uADFC\uC2DC\uAC04\uC774 \uB178\uB4DC\uC5D0\uC11C\uC758 \uC5F0\uC0B0\uC2DC\uAC04\uC5D0 \uBE44\uD574 \uD6E8\uC52C \uAE38 \uACBD\uC6B0, \uB2E4\uB978 \uAD6C\uD604 \uBC29\uC2DD\uC5D0 \uBE44\uD574 \uC0C1\uB2F9\uD55C \uC774\uC810\uC744 \uAC00\uC9C0\uACE0 \uC788\uB2E4. \uC774\uB294 \uB300\uBD80\uBD84\uC758 \uB178\uB4DC\uAC00 \uD558\uB4DC\uB514\uC2A4\uD06C\uC640 \uAC19\uC740 \uC5D0 \uC788\uC744 \uB54C \uC77C\uBC18\uC801\uC73C\uB85C \uC77C\uC5B4\uB09C\uB2E4. \uAC01 \uB0B4\uBD80 \uB178\uB4DC\uC5D0 \uC788\uB294 \uC790\uC2DD \uB178\uB4DC\uC758 \uC218\uB97C \uCD5C\uB300\uD654\uD568\uC73C\uB85C\uC368, \uD2B8\uB9AC\uC758 \uB192\uC774\uB294 \uAC10\uC18C\uD558\uBA70, \uADE0\uD615\uB9DE\uCDA4\uC740 \uB35C \uC77C\uC5B4\uB098\uACE0, \uD6A8\uC728\uC740 \uC99D\uAC00\uD558\uAC8C \uB41C\uB2E4. \uB300\uAC1C \uC774 \uAC12\uC740 \uAC01 \uB178\uB4DC\uAC00 \uC644\uC804\uD55C \uD558\uB098\uC758 \uB514\uC2A4\uD06C \uBE14\uB85D \uD639\uC740 2\uCC28 \uC800\uC7A5\uC7A5\uCE58\uC5D0\uC11C\uC758 \uC720\uC0AC\uD55C \uD06C\uAE30\uB97C \uCC28\uC9C0\uD558\uB3C4\uB85D \uC815\uD574\uC9C4\uB2E4."@ko . . . "\u0411-\u0434\u0435\u0440\u0435\u0432\u0430 (\u0430\u043D\u0433\u043B. B-tree) \u2014 \u0446\u0435 \u043E\u0434\u0438\u043D \u0437 \u0432\u0438\u0434\u0456\u0432 \u0437\u0431\u0430\u043B\u0430\u043D\u0441\u043E\u0432\u0430\u043D\u0438\u0445 \u0434\u0435\u0440\u0435\u0432, \u0449\u043E \u0437\u0430\u0431\u0435\u0437\u043F\u0435\u0447\u0443\u044E\u0442\u044C \u0435\u0444\u0435\u043A\u0442\u0438\u0432\u043D\u0435 \u0437\u0431\u0435\u0440\u0435\u0436\u0435\u043D\u043D\u044F \u0456\u043D\u0444\u043E\u0440\u043C\u0430\u0446\u0456\u0457 \u043D\u0430 \u043C\u0430\u0433\u043D\u0456\u0442\u043D\u0438\u0445 \u0434\u0438\u0441\u043A\u0430\u0445 \u0442\u0430 \u0456\u043D\u0448\u0438\u0445 \u043F\u0440\u0438\u0441\u0442\u0440\u043E\u044F\u0445 \u0437 \u043F\u0440\u044F\u043C\u0438\u043C \u0434\u043E\u0441\u0442\u0443\u043F\u043E\u043C. \u0411-\u0434\u0435\u0440\u0435\u0432\u0430 \u0441\u0445\u043E\u0436\u0456 \u043D\u0430 \u0447\u0435\u0440\u0432\u043E\u043D\u043E-\u0447\u043E\u0440\u043D\u0456, \u0440\u0456\u0437\u043D\u0438\u0446\u044F \u0432 \u0442\u043E\u043C\u0443, \u0449\u043E \u0432 \u0411-\u0434\u0435\u0440\u0435\u0432\u0456 \u0432\u0443\u0437\u043E\u043B \u043C\u043E\u0436\u0435 \u043C\u0430\u0442\u0438 \u0431\u0430\u0433\u0430\u0442\u043E \u0434\u0456\u0442\u0435\u0439, \u043D\u0430 \u043F\u0440\u0430\u043A\u0442\u0438\u0446\u0456 \u0434\u043E \u0442\u0438\u0441\u044F\u0447\u0456, \u0437\u0430\u043B\u0435\u0436\u043D\u043E \u0432\u0456\u0434 \u0445\u0430\u0440\u0430\u043A\u0442\u0435\u0440\u0438\u0441\u0442\u0438\u043A \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u0432\u0430\u043D\u043E\u0433\u043E \u0434\u0438\u0441\u043A\u0430. \u0417\u0430\u0432\u0434\u044F\u043A\u0438 \u0446\u044C\u043E\u043C\u0443 \u043A\u043E\u043D\u0441\u0442\u0430\u043D\u0442\u0430 \u0432 \u043E\u0446\u0456\u043D\u0446\u0456 O(log n) \u0434\u043B\u044F \u0432\u0438\u0441\u043E\u0442\u0438 \u0434\u0435\u0440\u0435\u0432\u0430 \u043C\u0435\u043D\u0448\u0430, \u043D\u0456\u0436 \u0434\u043B\u044F \u0447\u0435\u0440\u0432\u043E\u043D\u043E-\u0447\u043E\u0440\u043D\u0438\u0445 \u0434\u0435\u0440\u0435\u0432. \u042F\u043A \u0456 \u0447\u0435\u0440\u0432\u043E\u043D\u043E-\u0447\u043E\u0440\u043D\u0456 \u0434\u0435\u0440\u0435\u0432\u0430, \u0411-\u0434\u0435\u0440\u0435\u0432\u0430 \u0434\u043E\u0437\u0432\u043E\u043B\u044F\u044E\u0442\u044C \u0440\u0435\u0430\u043B\u0456\u0437\u0443\u0432\u0430\u0442\u0438 \u0431\u0430\u0433\u0430\u0442\u043E \u043E\u043F\u0435\u0440\u0430\u0446\u0456\u0439 \u0437 \u043C\u043D\u043E\u0436\u0438\u043D\u0430\u043C\u0438 \u0440\u043E\u0437\u043C\u0456\u0440\u0443 n \u0437\u0430 \u0447\u0430\u0441 O(log n). \u0412\u0443\u0437\u043E\u043B x, \u044F\u043A\u0438\u0439 \u0437\u0431\u0435\u0440\u0456\u0433\u0430\u0454 n[x] \u043A\u043B\u044E\u0447\u0456\u0432, \u043C\u0430\u0454 n[x]+1 \u0434\u0456\u0442\u0435\u0439. \u041A\u043B\u044E\u0447\u0456, \u0449\u043E \u0437\u0431\u0435\u0440\u0456\u0433\u0430\u044E\u0442\u044C\u0441\u044F \u0432 x \u0441\u043B\u0443\u0436\u0430\u0442\u044C \u0433\u0440\u0430\u043D\u0438\u0446\u044F\u043C\u0438, \u0449\u043E \u0440\u043E\u0437\u0434\u0456\u043B\u044F\u044E\u0442\u044C \u0432\u0441\u0456\u0445 \u0439\u043E\u0433\u043E \u043D\u0430\u0449\u0430\u0434\u043A\u0456\u0432 \u043D\u0430 n[x]+1 \u0433\u0440\u0443\u043F; \u0437\u0430 \u043A\u043E\u0436\u043D\u0443 \u0433\u0440\u0443\u043F\u0443 \u0432\u0456\u0434\u043F\u043E\u0432\u0456\u0434\u0430\u0454 \u043E\u0434\u0438\u043D \u0437 \u043D\u0430\u0449\u0430\u0434\u043A\u0456\u0432 x. \u041F\u0440\u0438 \u043F\u043E\u0448\u0443\u043A\u0443 \u0432 \u0411-\u0434\u0435\u0440\u0435\u0432\u0456 \u043C\u0438 \u043F\u043E\u0440\u0456\u0432\u043D\u044E\u0454\u043C\u043E \u0448\u0443\u043A\u0430\u043D\u0438\u0439 \u043A\u043B\u044E\u0447 \u0437 n[x] \u043A\u043B\u044E\u0447\u0430\u043C\u0438, \u0449\u043E \u0437\u0431\u0435\u0440\u0456\u0433\u0430\u044E\u0442\u044C\u0441\u044F \u0432 x, \u0456 \u0437\u0430 \u0440\u0435\u0437\u0443\u043B\u044C\u0442\u0430\u0442\u0430\u043C\u0438 \u043F\u043E\u0440\u0456\u0432\u043D\u044F\u043D\u043D\u044F \u0432\u0438\u0431\u0438\u0440\u0430\u0454\u043C\u043E \u043E\u0434\u043D\u043E\u0433\u043E \u0437 n[x]+1 \u043D\u0430\u0449\u0430\u0434\u043A\u0456\u0432."@uk . . "B-Baum"@de . . "B-strom je druh stromu. Je specifick\u00FD t\u00EDm, \u017Ee m\u00E1 \u0159\u00E1d a limity na maxim\u00E1ln\u00ED, i minim\u00E1ln\u00ED po\u010Det potomk\u016F vrcholu. B-strom je d\u00EDky t\u00E9to vlastnosti vyv\u00E1\u017Een\u00FD, operace p\u0159id\u00E1n\u00ED, vyjmut\u00ED i vyhled\u00E1v\u00E1n\u00ED tedy prob\u00EDhaj\u00ED v logaritmick\u00E9m \u010Dase. Tato struktura je \u010Dasto pou\u017E\u00EDv\u00E1na v aplikac\u00EDch, kdy nen\u00ED cel\u00E1 struktura ulo\u017Eena v opera\u010Dn\u00ED pam\u011Bti (RAM), ale v n\u011Bjak\u00E9 sekund\u00E1rn\u00ED pam\u011Bti, jako je pevn\u00FD disk (nap\u0159\u00EDklad datab\u00E1ze). Proto\u017Ee p\u0159\u00EDstup do tohoto typu pam\u011Bti je n\u00E1ro\u010Dn\u00FD na \u010Das (hlavn\u011B vyhled\u00E1n\u00ED n\u00E1hodn\u00E9 polo\u017Eky), sna\u017E\u00EDme se minimalizovat po\u010Det p\u0159\u00EDstup\u016F do t\u00E9to pam\u011Bti. P\u0159\u00EDklad: M\u00E1me-li B-strom hloubky 2 a po\u010Det potomk\u016F ka\u017Ed\u00E9ho uzlu je 1 001, m\u016F\u017Eeme do n\u011Bj ulo\u017Eit miliardu kl\u00ED\u010D\u016F (obsahuje milion uzl\u016F) a ke ka\u017Ed\u00E9 polo\u017Ece se dostaneme maxim\u00E1ln\u011B po dvou diskov\u00FDch operac\u00EDch. B-strom je speci\u00E1ln\u00ED p\u0159\u00EDpad (a,b)-stromu, kter\u00FD poskytuje v\u011Bt\u0161\u00ED volnost ve volb\u011B minim\u00E1ln\u00EDho a maxim\u00E1ln\u00EDho po\u010Dtu potomk\u016F ne\u017E B-strom. Auto\u0159i algoritmu, Rudolf Bayer a , nikdy nevysv\u011Btlili, co v n\u00E1zvu znamen\u00E1 p\u00EDsmeno B. Nej\u010Dast\u011Bji se p\u0159edpokl\u00E1d\u00E1, \u017Ee znamen\u00E1 balanced (v angli\u010Dtin\u011B vyv\u00E1\u017Een\u00FD), jeliko\u017E v\u0161echny listy jsou na stejn\u00E9 \u00FArovni stromu. B m\u016F\u017Ee b\u00FDt tak\u00E9 prvn\u00ED p\u00EDsmeno jm\u00E9na Bayer, p\u0159\u00EDpadn\u011B Boeing, oba toti\u017E v t\u00E9 dob\u011B pracovali ve v\u00FDzkumn\u00E9m \u00FAstavu t\u00E9to firmy."@cs . . . "Ett B-tr\u00E4d \u00E4r en datastruktur i form av ett balanserat . Varje nod har mellan m och m/2 barn, d\u00E4r m \u00E4r ett givet heltal st\u00F6rre \u00E4n 1. Roten kan ha s\u00E5 f\u00E5 som 2 stycken n. Den h\u00E4r strukturen kan vara anv\u00E4ndbar om stora delar av tr\u00E4det finns i l\u00E5ngsammare minnen (som en h\u00E5rddisk) eftersom tr\u00E4dets h\u00F6jd kan reduceras genom att man v\u00E4ljer ett stort m."@sv . . . "En las ciencias de la computaci\u00F3n, los \u00E1rboles-B o B-\u00E1rboles son estructuras de datos de \u00E1rbol que se encuentran com\u00FAnmente en las implementaciones de bases de datos y sistemas de archivos. Al igual que los \u00E1rboles binarios de b\u00FAsqueda, son \u00E1rboles balanceados de b\u00FAsqueda, pero cada nodo puede poseer m\u00E1s de dos hijos.\u200B Los \u00E1rboles B mantienen los datos ordenados y las inserciones y eliminaciones se realizan en tiempo logar\u00EDtmico amortizado."@es . . . . . . "B-drzewo \u2013 drzewiasta struktura danych, przechowuj\u0105ca klucze w pewnym porz\u0105dku i powi\u0105zane z nimi dane, u\u017Cywana przede wszystkim w systemach baz danych. G\u0142\u00F3wnym pomys\u0142em zastosowanym w B-drzewach jest struktura wewn\u0119trznego w\u0119z\u0142a. Ka\u017Cdy w\u0119ze\u0142 mo\u017Ce posiada\u0107 od do w\u0119z\u0142\u00F3w potomnych, gdzie to rz\u0105d B-drzewa; wyj\u0105tkiem jest korze\u0144, kt\u00F3ry mo\u017Ce posiada\u0107 od do w\u0119z\u0142\u00F3w potomnych. Te za\u0142o\u017Cenia gwarantuj\u0105, \u017Ce wysoko\u015B\u0107 drzewa zawieraj\u0105cego kluczy b\u0119dzie niska, rz\u0119du co te\u017C powoduje, \u017Ce asymptotyczna z\u0142o\u017Cono\u015B\u0107 czasowa operacji podstawowych: wyszukiwania, wstawiania i kasowania kluczy jest rz\u0119du Niska wysoko\u015B\u0107 drzewa powoduje, \u017Ce liczba w\u0119z\u0142\u00F3w, kt\u00F3re trzeba odczyta\u0107 b\u0105d\u017A zapisa\u0107, jest niewielka. W praktycznych zastosowaniach, w kt\u00F3rych informacje przechowywane s\u0105 na dyskach twardych b\u0105d\u017A p\u0142ytach CD/DVD ma to fundamentalne znaczenie, bowiem czasy dost\u0119pu do tych urz\u0105dze\u0144 s\u0105 du\u017Co wi\u0119ksze ni\u017C do pami\u0119ci wewn\u0119trznej komputera i dominuj\u0105 w ca\u0142kowitym czasie wykonywania operacji na danych (czasy dost\u0119pu do pami\u0119ci komputera rz\u0119du mikro- lub setek nanosekund, natomiast do wsp\u00F3\u0142czesnych dysk\u00F3w twardych to kilka milisekund \u2013 czyli 3\u20134 rz\u0119dy wielko\u015Bci wi\u0119cej). Z kolei zlokalizowanie odpowiedniego klucza b\u0105d\u017A potomka w w\u0119\u017Ale wczytanym do pami\u0119ci wewn\u0119trznej jest du\u017Co szybsze, nawet je\u015Bli rz\u0105d drzewa jest du\u017Cy."@pl . . . . . "Un B-albero (in inglese: B-tree) \u00E8 una struttura dati che permette la rapida localizzazione dei file (record o chiavi), specie nelle basi di dati, riducendo il numero di volte che un utente necessita per accedere alla memoria in cui il dato \u00E8 salvato. Essi derivano dagli alberi binari di ricerca, in quanto ogni chiave appartenente al sottoalbero sinistro di un nodo \u00E8 di valore inferiore rispetto a ogni chiave appartenente ai sottoalberi alla sua destra; inoltre, la loro struttura ne garantisce il : per ogni nodo, le altezze dei sottoalberi destro e sinistro differiscono al pi\u00F9 di una unit\u00E0. Questo \u00E8 il vantaggio principale del B-albero, e permette di compiere operazioni di inserimento, cancellazione e ricerca in tempi ammortizzati logaritmicamente. Sono utilizzati spesso nell'ambito delle basi di dati, in quanto permettono di accedere ai nodi in maniera efficiente sia nel caso essi siano disponibili in memoria centrale (tramite una cache), sia qualora essi siano presenti solo sulla memoria di massa."@it . . . . . . . . . "1970"^^ . . "Arbre B"@fr . . "O"@en . . "O"@en . . "48522"^^ . . . . . "B\u6728"@ja . . . "B-\u0434\u0435\u0440\u0435\u0432\u043E (\u043F\u043E-\u0440\u0443\u0441\u0441\u043A\u0438 \u043F\u0440\u043E\u0438\u0437\u043D\u043E\u0441\u0438\u0442\u0441\u044F \u043A\u0430\u043A \u0411\u0438-\u0434\u0435\u0440\u0435\u0432\u043E) \u2014 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u043D\u044B\u0445, \u0434\u0435\u0440\u0435\u0432\u043E \u043F\u043E\u0438\u0441\u043A\u0430. \u0421 \u0442\u043E\u0447\u043A\u0438 \u0437\u0440\u0435\u043D\u0438\u044F \u0432\u043D\u0435\u0448\u043D\u0435\u0433\u043E \u043B\u043E\u0433\u0438\u0447\u0435\u0441\u043A\u043E\u0433\u043E \u043F\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043B\u0435\u043D\u0438\u044F \u2014 \u0441\u0431\u0430\u043B\u0430\u043D\u0441\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u043E\u0435, \u0441\u0438\u043B\u044C\u043D\u043E \u0432\u0435\u0442\u0432\u0438\u0441\u0442\u043E\u0435 \u0434\u0435\u0440\u0435\u0432\u043E. \u0427\u0430\u0441\u0442\u043E \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u0443\u0435\u0442\u0441\u044F \u0434\u043B\u044F \u0445\u0440\u0430\u043D\u0435\u043D\u0438\u044F \u0434\u0430\u043D\u043D\u044B\u0445 \u0432\u043E \u0432\u043D\u0435\u0448\u043D\u0435\u0439 \u043F\u0430\u043C\u044F\u0442\u0438. \u0418\u0441\u043F\u043E\u043B\u044C\u0437\u043E\u0432\u0430\u043D\u0438\u0435 B-\u0434\u0435\u0440\u0435\u0432\u044C\u0435\u0432 \u0432\u043F\u0435\u0440\u0432\u044B\u0435 \u0431\u044B\u043B\u043E \u043F\u0440\u0435\u0434\u043B\u043E\u0436\u0435\u043D\u043E \u0420. \u0411\u044D\u0439\u0435\u0440\u043E\u043C (\u0430\u043D\u0433\u043B. R. Bayer) \u0438 \u042D. \u041C\u0430\u043A\u041A\u0440\u0435\u0439\u0442\u043E\u043C (\u0430\u043D\u0433\u043B. E. McCreight) \u0432 1970 \u0433\u043E\u0434\u0443. \u0421\u0431\u0430\u043B\u0430\u043D\u0441\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u043E\u0441\u0442\u044C \u043E\u0437\u043D\u0430\u0447\u0430\u0435\u0442, \u0447\u0442\u043E \u0434\u043B\u0438\u043D\u044B \u043B\u044E\u0431\u044B\u0445 \u0434\u0432\u0443\u0445 \u043F\u0443\u0442\u0435\u0439 \u043E\u0442 \u043A\u043E\u0440\u043D\u044F \u0434\u043E \u043B\u0438\u0441\u0442\u044C\u0435\u0432 \u0440\u0430\u0437\u043B\u0438\u0447\u0430\u044E\u0442\u0441\u044F \u043D\u0435 \u0431\u043E\u043B\u0435\u0435, \u0447\u0435\u043C \u043D\u0430 \u0435\u0434\u0438\u043D\u0438\u0446\u0443. \u0412\u0435\u0442\u0432\u0438\u0441\u0442\u043E\u0441\u0442\u044C \u0434\u0435\u0440\u0435\u0432\u0430 \u2014 \u044D\u0442\u043E \u0441\u0432\u043E\u0439\u0441\u0442\u0432\u043E \u043A\u0430\u0436\u0434\u043E\u0433\u043E \u0443\u0437\u043B\u0430 \u0434\u0435\u0440\u0435\u0432\u0430 \u0441\u0441\u044B\u043B\u0430\u0442\u044C\u0441\u044F \u043D\u0430 \u0431\u043E\u043B\u044C\u0448\u043E\u0435 \u0447\u0438\u0441\u043B\u043E \u0443\u0437\u043B\u043E\u0432-\u043F\u043E\u0442\u043E\u043C\u043A\u043E\u0432."@ru . . . "\u0628\u064A - \u062A\u0631\u064A"@ar .