B-link-tree3. B-Link Tree ã¨ã¯ (history) A variant of B*-Tree (they call) actually.. a B+-tree? (data stored in leaf only) 1981 å¹´ PHILIP.L. LEHMAN , S.BING YAO †Efficient Locking for Concurrent Operations on B-Trees †ã¨ã„ã†è«–æ–‡ã§ç™ºè¡¨ 当時，複数㮠プãƒã‚»ã‚¹ ã§åŒæ™‚実効性をæŒã¤ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã®æ§‹ç¯‰ãŒæµè¡Œã‚Šã ã£ãŸ ( らã—ã„ è«–æ–‡ã®ä¸»çœ¼ã¯å¦‚何ã«åŠ¹çŽ‡ã®ã‚ˆã高ã„åŒæ™‚実効性を有ã™ã‚‹ç´¢å¼•ã‚’構築ã™ã‚‹ã‹ï¼Ž 4. B*-Tree an elegant(?) variant on B+-tree keep pages at least 2/3 full, guaranteed . The benefit over B+
「RDBMSã®æ™‚代ã®çµ‚ã‚ã‚ŠãŒè¦‹ãˆã¦ããŸã€ã«ã¤ã„ã¦ãã‚ãã‚一言言ã£ã¦ãŠãã‹ - ã²ãŒã‚„ã™ã‚’技術ブãƒã‚°
{{#tags}}- {{label}}
{{/tags}}