doc/documentation/manual-pages/ja/man3/btree.3

.\" Copyright (c) 1990, 1993
.\"	The Regents of the University of California.  All rights reserved.
.\"
.\" Redistribution and use in source and binary forms, with or without
.\" modification, are permitted provided that the following conditions
.\" are met:
.\" 1. Redistributions of source code must retain the above copyright
.\"    notice, this list of conditions and the following disclaimer.
.\" 2. Redistributions in binary form must reproduce the above copyright
.\"    notice, this list of conditions and the following disclaimer in the
.\"    documentation and/or other materials provided with the distribution.
.\" 3. All advertising materials mentioning features or use of this software
.\"    must display the following acknowledgement:
.\"	This product includes software developed by the University of
.\"	California, Berkeley and its contributors.
.\" 4. Neither the name of the University nor the names of its contributors
.\"    may be used to endorse or promote products derived from this software
.\"    without specific prior written permission.
.\"
.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
.\" ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
.\" SUCH DAMAGE.
.\"
.\"	@(#)btree.3	8.4 (Berkeley) 8/18/94
.\" %FreeBSD: src/lib/libc/db/man/btree.3,v 1.3.2.2 2001/12/14 18:33:49 ru Exp %
.\" $FreeBSD$
.\"
.Dd August 18, 1994
.Dt BTREE 3
.Os
.Sh ̾¾Î
.Nm btree
.Nd "btree ¥Ç¡¼¥¿¥Ù¡¼¥¹¥¢¥¯¥»¥¹Êý¼°"
.Sh ½ñ¼°
.In sys/types.h
.In db.h
.Sh ²òÀâ
¥ë¡¼¥Á¥ó
.Fn dbopen
¤Ï¡¢¥Ç¡¼¥¿¥Ù¡¼¥¹¥Õ¥¡¥¤¥ë¤Ø¤Î¥é¥¤¥Ö¥é¥ê¥¤¥ó¥¿¥Õ¥§¡¼¥¹¤Ç¤¹¡£
¥µ¥Ý¡¼¥È¤µ¤ì¤Æ¤¤¤ë¥Õ¥¡¥¤¥ë·Á¼°¤Î 1 ¤Ä¤Ï
.Nm
¥Õ¥¡¥¤¥ë¤Ç¤¹¡£
¥Ç¡¼¥¿¥Ù¡¼¥¹¥¢¥¯¥»¥¹Êý¼°¤Î°ìÈÌŪ¤ÊÀâÌÀ¤Ï
.Xr dbopen 3
¤Ë¤¢¤ê¤Þ¤¹¡£¤³¤Î¥Þ¥Ë¥å¥¢¥ë¥Ú¡¼¥¸¤Ï¡¢
.Nm
¤Ë¸ÇÍ­¤Î¾ðÊó¤Ë¤Ä¤¤¤Æ¤À¤±ÀâÌÀ¤·¤Æ¤¤¤Þ¤¹¡£
.Pp
.Nm
¥Ç¡¼¥¿¹½Â¤¤Ï¡¢´ØÏ¢¤¹¤ë¥­¡¼ / ¥Ç¡¼¥¿¤Î¥Ú¥¢¤ò³ÊǼ¤¹¤ë¡¢
¥½¡¼¥ÈºÑ¤ß¤Î¥Ð¥é¥ó¥¹¤Î¤È¤ì¤¿¥Ä¥ê¡¼¹½Â¤¤Ç¤¹¡£
.Pp
.Fn dbopen
¤ËÄ󶡤µ¤ì¤ë
.Nm
¥¢¥¯¥»¥¹Êý¼°¤Ë¸ÇÍ­¤Î¥Ç¡¼¥¿¹½Â¤¤Ï¡¢
¼¡¤Î¤è¤¦¤Ë
.Aq Pa db.h
¥¤¥ó¥¯¥ë¡¼¥É¥Õ¥¡¥¤¥ë¤ËÄêµÁ¤µ¤ì¤Æ¤¤¤Þ¤¹¡£
.Bd -literal
typedef struct {
	u_long flags;
	u_int cachesize;
	int maxkeypage;
	int minkeypage;
	u_int psize;
	int (*compare)(const DBT *key1, const DBT *key2);
	size_t (*prefix)(const DBT *key1, const DBT *key2);
	int lorder;
} BTREEINFO;
.Ed
.Pp
¤³¤Î¹½Â¤ÂΤΥ¨¥ì¥á¥ó¥È¤Ï¼¡¤Î¤È¤ª¤ê¤Ç¤¹¡£
.Bl -tag -width indent
.It Va flags
flag ¤ÎÃͤϰʹߤÎÃͤÎ
.Em or
(ÏÀÍýÏÂ) ¤ò¼è¤ë¤³¤È¤Ë¤è¤Ã¤ÆÄêµÁ¤µ¤ì¤Þ¤¹¡£
.Bl -tag -width indent
.It Dv R_DUP
¥Ä¥ê¡¼ÆâÉô¤Ë½ÅÊ£¤·¤¿¥­¡¼¤òµöÍƤ·¤Þ¤¹¡£
¤¹¤Ê¤ï¤Á¡¢ÁÞÆþ¤¹¤ë¥­¡¼¤¬
¥Ä¥ê¡¼Æâ¤Ë´û¤Ë¸ºß¤¹¤ë¾ì¹ç¤Ë¤âÁÞÆþ¤òµöÍƤ·¤Þ¤¹¡£
.Xr dbopen 3
¤Ëµ­½Ò¤µ¤ì¤¿¥Ç¥Õ¥©¥ë¥È¤ÎÆ°ºî¤È¤·¤Æ¤Ï¡¢
¿·¤·¤¤¥­¡¼¤òÁÞÆþ¤¹¤ë¤È¤­¤Ë°ìÃפ¹¤ë¥­¡¼¤ò¾å½ñ¤­¤¹¤ë¤«¡¢
¤Þ¤¿¤Ï
.Dv R_NOOVERWRITE
¥Õ¥é¥°¤¬»ØÄꤵ¤ì¤Æ¤¤¤ë¾ì¹ç¤Ï½èÍý¼ºÇÔ¤·¤Þ¤¹¡£
.Dv R_DUP
¥Õ¥é¥°¤Ï
.Dv R_NOOVERWRITE
¥Õ¥é¥°¤Ë¤è¤Ã¤Æ¾å½ñ¤­¤µ¤ì¡¢
.Dv R_NOOVERWRITE
¥Õ¥é¥°¤¬»ØÄꤵ¤ì¤Æ¤¤¤ë¾ì¹ç¤Ï¡¢
½ÅÊ£¤¹¤ë¥­¡¼¤ò¥Ä¥ê¡¼¤ËÁÞÆþ¤·¤è¤¦¤È¤¹¤ë½èÍý¤¬¼ºÇÔ¤·¤Þ¤¹¡£
.Pp
¥Ç¡¼¥¿¥Ù¡¼¥¹¤Ë½ÅÊ£¤·¤¿¥­¡¼¤¬´Þ¤Þ¤ì¤Æ¤¤¤ë¾ì¹ç¡¢
.Va get
¥ë¡¼¥Á¥ó¤ò»ÈÍѤ¹¤ë¤È¡¢
¥­¡¼ / ¥Ç¡¼¥¿¤Î¥Ú¥¢¤Î¼è¤ê½Ð¤·¤Î½ç½ø¤Ï̤ÄêµÁ¤Ë¤Ê¤ê¤Þ¤¹¡£
¤·¤«¤·¡¢R_CURSOR ¥Õ¥é¥°¤òÀßÄꤷ¤Æ
.Va seq
¥ë¡¼¥Á¥ó¤ò¸Æ¤Ó½Ð¤¹¤È¡¢
½ÅÊ£¤·¤¿¥­¡¼¤ÎÏÀÍýŪ¤Ê
.Dq ºÇ½é
¤¬É¬¤ºÊÖ¤µ¤ì¤Þ¤¹¡£
.El
.It Va cachesize
¥á¥â¥ê¥­¥ã¥Ã¥·¥å¤Î¼¨º¶¤¹¤ëºÇÂ祵¥¤¥º (¥Ð¥¤¥Èñ°Ì)¡£
¤³¤ÎÃͤÏ
.Em ñ¤Ë
¥¢¥É¥Ð¥¤¥¹¤Ë¤¹¤®¤º¡¢
¥¢¥¯¥»¥¹Êý¼°¤Ï½èÍý¼ºÇÔ¤»¤º¤Ë¿¤¯¤Î¥á¥â¥ê¤ò³ä¤ê¿¶¤ê¤Þ¤¹¡£
³Æ¸¡º÷¤¬¥Ä¥ê¡¼¤Î¥ë¡¼¥È¥Ú¡¼¥¸¤òÄ´ºº¤¹¤ë¤Î¤Ç¡¢
ºÇ¤âºÇ¶á¤Ë»ÈÍѤµ¤ì¤¿¥Ú¡¼¥¸¤ò¥­¥ã¥Ã¥·¥å¤¹¤ë¤È¡¢
¥¢¥¯¥»¥¹»þ´Ö¤¬Ã»¤¯¤Ê¤ê¤Þ¤¹¡£
¤µ¤é¤Ë¡¢ÊªÍýŪ¤Ê½ñ¤­¹þ¤ß¤Ï²Äǽ¤Ê¸Â¤êÃٱ䤵¤ì¤ë¤Î¤Ç¡¢
ŬÅ٤ʥ­¥ã¥Ã¥·¥å¤ÏÆþ½ÐÎÏÁàºî¤Î²ó¿ô¤òÂçÉý¤Ë¸º¾¯¤Ç¤­¤Þ¤¹¡£
ÌÀ¤é¤«¤Ë¡¢¥­¥ã¥Ã¥·¥å¤ò»ÈÍѤ¹¤ë¤È¡¢
¥Ä¥ê¡¼¤ò½¤Àµ¤·¤Æ¤¤¤ë´Ö¤Ë¥·¥¹¥Æ¥à¤¬¥¯¥é¥Ã¥·¥å¤·¤¿¾ì¹ç¡¢
¥Ç¡¼¥¿¤¬ÇË»¤Þ¤¿¤ÏÁÓ¼º¤µ¤ì¤ë¸«¹þ¤ß¤ÏÁýÂ礷¤Þ¤¹ (ÁýÂ礹¤ë¤À¤±¤Ç¤¹)¡£
.Va cachesize
¤¬ 0 (¥µ¥¤¥º¤¬»ØÄꤵ¤ì¤Æ¤¤¤Ê¤¤) ¤Î¾ì¹ç¡¢
¥Ç¥Õ¥©¥ë¥È¤Î¥­¥ã¥Ã¥·¥å¤¬»ÈÍѤµ¤ì¤Þ¤¹¡£
.It Va maxkeypage
1 ¥Ú¡¼¥¸¤Ë³ÊǼ¤µ¤ì¤ë¥­¡¼¤ÎºÇÂç¿ô¡£¸½»þÅÀ¤Ç¤Ï¼Â¸½¤µ¤ì¤Æ¤¤¤Þ¤»¤ó¡£
.\" The maximum number of keys which will be stored on any single page.
.\" Because of the way the
.\" .Nm
.\" data structure works,
.\" .Va maxkeypage
.\" must always be greater than or equal to 2.
.\" If
.\" .Va maxkeypage
.\" is 0 (no maximum number of keys is specified) the page fill factor is
.\" made as large as possible (which is almost invariably what is wanted).
.It Va minkeypage
1 ¥Ú¡¼¥¸¤Ë³ÊǼ¤µ¤ì¤ë¥­¡¼¤ÎºÇ¾¯¿ô¡£
¤³¤ÎÃͤò»ÈÍѤ·¤Æ¡¢
¥ª¡¼¥Ð¥Õ¥í¡¼¥Ú¡¼¥¸¤Ë¤É¤Î¥­¡¼¤¬³ÊǼ¤µ¤ì¤ë¤«¤òȽÄꤷ¤Þ¤¹¡£
¤¹¤Ê¤ï¤Á¡¢¥­¡¼¤Þ¤¿¤Ï¥Ç¡¼¥¿¹½Â¤¤¬¡¢minkeypage Ãͤǽü»»¤µ¤ì¤¿
pagesize ¤è¤êŤ¤¾ì¹ç¤Ï¡¢¥Ú¡¼¥¸¼«ÂΤˤǤϤʤ¯¡¢
¥ª¡¼¥Ð¥Õ¥í¡¼¥Ú¡¼¥¸¤Ë³ÊǼ¤µ¤ì¤Þ¤¹¡£
.Va minkeypage
¤¬ 0 (¥­¡¼¤ÎºÇ¾¯¿ô¤¬»ØÄꤵ¤ì¤Æ¤¤¤Ê¤¤) ¤Î¾ì¹ç¡¢
ÃÍ 2 ¤¬»ÈÍѤµ¤ì¤Þ¤¹¡£
.It Va psize
¥Ú¡¼¥¸¥µ¥¤¥º¤Ï¡¢¥Ä¥ê¡¼Æâ¤Î¥Î¡¼¥É¤Ë»ÈÍѤµ¤ì¤ë¥Ú¡¼¥¸¤Î¥µ¥¤¥º
(¥Ð¥¤¥Èñ°Ì) ¤Ç¤¹¡£ºÇ¾¯¥Ú¡¼¥¸¥µ¥¤¥º¤Ï 512 ¥Ð¥¤¥È¤Ç¤¢¤ê¡¢
ºÇÂç¥Ú¡¼¥¸¥µ¥¤¥º¤Ï 64K ¤Ç¤¹¡£
.Va psize
¤¬ 0 (¥Ú¡¼¥¸¥µ¥¤¥º¤¬»ØÄꤵ¤ì¤Æ¤¤¤Ê¤¤) ¤Î¾ì¹ç¡¢
¥Ú¡¼¥¸¥µ¥¤¥º¤Ï¡¢´ðÁؤȤʤäƤ¤¤ë
¥Õ¥¡¥¤¥ë¥·¥¹¥Æ¥àÆþ½ÐÎÏ¥Ö¥í¥Ã¥¯¥µ¥¤¥º¤ò´ðÁäˤ·¤ÆÁªÂò¤µ¤ì¤Þ¤¹¡£
.It Va compare
compare ¤Ï¥­¡¼Èæ³Ó´Ø¿ô¤Ç¤¹¡£
ºÇ½é¤Î¥­¡¼°ú¿ô¤¬ 2 ÈÖ¤á¤Î¥­¡¼°ú¿ô¤è¤ê¾®¤µ¤¤¤È¹Í¤¨¤é¤ì¤ë¤È¤­¤Ï¡¢
0 ¤è¤ê¾®¤µ¤¤À°¿ô¤òÊÖ¤¹É¬Íפ¬¤¢¤ê¤Þ¤¹¡£
2 ÈÖ¤á¤Î¥­¡¼°ú¿ô¤ÈƱ¤¸¤È¹Í¤¨¤é¤ì¤ë¤È¤­¤Ï¡¢
0 ¤òÊÖ¤¹É¬Íפ¬¤¢¤ê¤Þ¤¹¡£
2 ÈÖ¤á¤Î¥­¡¼°ú¿ô¤è¤êÂ礭¤¤¤È¹Í¤¨¤é¤ì¤ë¤È¤­¤Ï¡¢
0 ¤è¤êÂ礭¤¤À°¿ô¤òÊÖ¤¹É¬Íפ¬¤¢¤ê¤Þ¤¹¡£
»ØÄê¤Î¥Ä¥ê¡¼¤Ë¤Ä¤¤¤Æ¤Ï¡¢¥Ä¥ê¡¼¤¬³«¤«¤ì¤ë¤¿¤Ó¤Ë¡¢
Ʊ¤¸Èæ³Ó´Ø¿ô¤ò»ÈÍѤ¹¤ëɬÍפ¬¤¢¤ê¤Þ¤¹¡£
.Va compare
¤¬
.Dv NULL
¤Î¾ì¹ç (Èæ³Ó´Ø¿ô¤¬»ØÄꤵ¤ì¤Ê¤¤¾ì¹ç)¡¢
¥­¡¼¤Ï¼­½ñŪ¤ËÈæ³Ó¤µ¤ì¡¢
û¤¤¥­¡¼¤ÏŤ¤¥­¡¼¤è¤ê¾®¤µ¤¤¤È¸«¤Ê¤µ¤ì¤Þ¤¹¡£
.It Va prefix
.Va prefix
¤ÏÀÜƬ¸ìÈæ³Ó´Ø¿ô¤Ç¤¹¡£
»ØÄꤹ¤ë¤È¡¢¤³¤Î¥ë¡¼¥Á¥ó¤Ï¡¢2 ÈÖ¤á¤Î¥­¡¼¤È¤Ê¤ë°ú¿ô¤Î¥Ð¥¤¥È¿ô¤òÊÖ¤·¤Þ¤¹¡£
¤³¤ì¤Ï¡¢2 ÈÖ¤á¤Î°ú¿ô¤¬1 ÈÖ¤á¤Î°ú¿ô¤è¤êÂ礭¤¤¤³¤È¤òȽÄꤹ¤ë¤¿¤á¤ËɬÍפǤ¹¡£
¥­¡¼¤¬Åù¤·¤¤¾ì¹ç¤Ï¡¢¥­¡¼¤ÎŤµ¤¬ÊÖ¤µ¤ì¤ë¤Ï¤º¤Ç¤¹¡£
¤³¤Î¥ë¡¼¥Á¥ó¤ÎÊØÍø¤µ¤Ï¤­¤ï¤á¤Æ¥Ç¡¼¥¿¤Ë°Í¸¤·¤Þ¤¹¡£
¤·¤«¤·¡¢¥Ç¡¼¥¿¥»¥Ã¥È¤Ë¤è¤Ã¤Æ¤Ï¡¢
¥Ä¥ê¡¼¤Î¥µ¥¤¥º¤È¸¡º÷»þ´Ö¤¬ÂçÉý¤Ëºï¸º¤Ç¤­¤ë¤³¤È¤â¤¢¤ë¤³¤È¤ËÃí°Õ¤·¤Æ¤¯¤À¤µ¤¤¡£
.Va prefix
¤¬
.Dv NULL
(ÀÜƬ¸ì´Ø¿ô¤¬»ØÄꤵ¤ì¤Æ¤¤¤Ê¤¤) ¤Ç¤¢¤Ã¤Æ¡¢
.Em ¤·¤«¤â
Èæ³Ó´Ø¿ô¤¬»ØÄꤵ¤ì¤Ê¤¤¾ì¹ç¤Ï¡¢
¥Ç¥Õ¥©¥ë¥È¤Î¼­½ñŪ¤ÊÈæ³Ó¥ë¡¼¥Á¥ó¤¬»ÈÍѤµ¤ì¤Þ¤¹¡£
.Va prefix
¤¬
.Dv NULL
¤Ç¤¢¤ê¡¢¤·¤«¤âÈæ³Ó¥ë¡¼¥Á¥ó¤¬»ØÄꤵ¤ì¤Æ¤¤¤ë¾ì¹ç¡¢
Èæ³Ó¤Ï¹Ô¤ï¤ì¤Þ¤»¤ó¡£
.It Va lorder
³ÊǼ¤µ¤ì¤¿¥Ç¡¼¥¿¥Ù¡¼¥¹¥á¥¿¥Ç¡¼¥¿Æâ¤ÎÀ°¿ô¤Î¥Ð¥¤¥È½ç½ø¡£
¿ô»ú¤ÏÀ°¿ô¤È¤·¤Æ¤Î½ç½ø¤òɽ¤¹¤Ï¤º¤Ç¤¹¡£
¤¿¤È¤¨¤Ð¡¢¥Ó¥Ã¥°¥¨¥ó¥Ç¥£¥¢¥ó½ç¤Ç¤Ï¿ô»ú 4,321 ¤Ë¤Ê¤ê¤Þ¤¹¡£
.Va lorder
¤¬ 0 ¤Î (½ç½ø¤¬»ØÄꤵ¤ì¤Æ¤¤¤Ê¤¤) ¾ì¹ç¡¢
¸½ºß¤Î¥Û¥¹¥È½ç½ø¤¬»ÈÍѤµ¤ì¤Þ¤¹¡£
.El
.Pp
¥Õ¥¡¥¤¥ë¤¬´û¤Ë¸ºß¤·¤Æ¤¤¤ë¾ì¹ç
(¤·¤«¤â
.Dv O_TRUNC
¥Õ¥é¥°¤¬»ØÄꤵ¤ì¤Æ¤¤¤Ê¤¤¾ì¹ç)¡¢
¥Ñ¥é¥á¡¼¥¿
.Va flags ,
.Va lorder ,
.Va psize
¤Ë¤Ä¤¤¤Æ»ØÄꤵ¤ì¤¿Ãͤϡ¢
¥Ä¥ê¡¼¤¬ºîÀ®¤µ¤ì¤¿¤È¤­¤Ë»ÈÍѤµ¤ì¤¿ÃͤΤ¿¤á¤Ë̵»ë¤µ¤ì¤Þ¤¹¡£
.Pp
¥Ä¥ê¡¼¤ÎÁ°Êý¥·¡¼¥±¥ó¥·¥ã¥ëÁöºº¤Ï¡¢
ºÇ¤â¾®¤µ¤¤¥­¡¼¤«¤éºÇ¤âÂ礭¤¤¥­¡¼¤Ë¸þ¤«¤¤¤Þ¤¹¡£
.Pp
¥Ä¥ê¡¼¤«¤é¥­¡¼ / ¥Ç¡¼¥¿¤Î¥Ú¥¢¤òºï½ü¤¹¤ë¤³¤È¤Ë¤è¤Ã¤Æ²òÊü¤µ¤ì¤¿¶õ´Ö¤Ï¡¢
ºÆ¤ÓÍ׵ᤵ¤ì¤ë¤³¤È¤Ï¤¢¤ê¤Þ¤»¤ó¤¬¡¢
ºÆ»ÈÍѤΤ¿¤á¤ËÍøÍѤǤ­¤ë¤è¤¦¤Ë¤µ¤ì¤ë¤Î¤¬ÉáÄ̤Ǥ¹¡£
¤¹¤Ê¤ï¤Á¡¢
.Nm
µ­²±°è¤ÏÀ®Ä¹¤Î¤ß¤Ç¤¹¡£
Í£°ì¤Î²ò·èºö¤Ï¡¢²áÅ٤ʺï½ü¤òÈò¤±¤ë¤³¤È¡¢
¤Þ¤¿¤Ï´û¸¤Î¥Ä¥ê¡¼¤ÎÁöºº¤«¤éÄê´üŪ¤Ë¿·¤·¤¤¥Ä¥ê¡¼¤òºîÀ®¤¹¤ë¤³¤È¤Ç¤¹¡£
.Pp
.Nm
Æâ¤Î¸¡º÷¡¢ÁÞÆþ¡¢¤ª¤è¤Óºï½ü¤Ï¤¹¤Ù¤Æ¡¢
´ðÄ줬ʿ¶Ñ¤Î¥Õ¥£¥ëÍ×°ø¤Ç¤¢¤ë´ðÄì N ¤Î O ¤ÎÂпô¤Ç´°Î»¤·¤Þ¤¹¡£
½ç½øÉÕ¤±¤é¤ì¤¿¥Ç¡¼¥¿¤ò
.Nm
¤ËÁÞÆþ¤¹¤ë¤È¡¢
¥Õ¥£¥ëÍ×°ø¤¬Ä㤯¤Ê¤ë¤³¤È¤¬¤è¤¯¤¢¤ê¤Þ¤¹¡£
¤³¤Î¼ÂÁõ¤Ç¤Ï¡¢½ç½øÉÕ¤±¤é¤ì¤¿ÁÞÆþ¤¬ºÇÎɤΥ±¡¼¥¹¤È¤Ê¤ê¡¢
Ä̾ï¤Î¥Ú¡¼¥¸¥Õ¥£¥ëÍ×°ø¤è¤ê¤Ï¤ë¤«¤ËÎɤ¤·ë²Ì¤Ë¤Ê¤ë¤è¤¦¤Ë½¤Àµ¤·¤Æ¤¢¤ê¤Þ¤¹¡£
.Sh ¥¨¥é¡¼
.Nm
¥¢¥¯¥»¥¹Êý¼°¥ë¡¼¥Á¥ó¤Ï¡¢¥é¥¤¥Ö¥é¥ê¥ë¡¼¥Á¥ó
.Xr dbopen 3
¤Ë¤Ä¤¤¤Æ»ØÄꤷ¤¿¥¨¥é¡¼¤Î¾ì¹ç¡¢½èÍý¼ºÇÔ¤·¡¢
.Va errno
¤òÀßÄꤹ¤ë²ÄǽÀ­¤¬¤¢¤ê¤Þ¤¹¡£
.Sh ´ØÏ¢¹àÌÜ
.Xr dbopen 3 ,
.Xr hash 3 ,
.Xr mpool 3 ,
.Xr recno 3
.Rs
.%T "The Ubiquitous B-tree"
.%A Douglas Comer
.%J "ACM Comput. Surv. 11"
.%N 2
.%D June 1979
.%P 121-138
.Re
.Rs
.%A Bayer
.%A Unterauer
.%T "Prefix B-trees"
.%J "ACM Transactions on Database Systems"
.%N 1
.%V Vol. 2
.%D March 1977
.%P 11-26
.Re
.Rs
.%B "The Art of Computer Programming Vol. 3: Sorting and Searching"
.%A D. E. Knuth
.%D 1968
.%P 471-480
.Re
.Sh ¥Ð¥°
¥Ó¥Ã¥°¥¨¥ó¥Ç¥£¥¢¥ó¤ª¤è¤Ó¥ê¥È¥ë¥¨¥ó¥Ç¥£¥¢¥ó¤Î¥Ð¥¤¥È½ç½ø¤À¤±¤¬¥µ¥Ý¡¼¥È
¤µ¤ì¤Æ¤¤¤Þ¤¹¡£