Gecko [ 122.154.134.11 ]

Name	Size	Permission
close.html	2.65 KB	-rw-r--r--
count.html	1.75 KB	-rw-r--r--
curclose.html	1.82 KB	-rw-r--r--
curdel.html	1.7 KB	-rw-r--r--
curdup.html	2.23 KB	-rw-r--r--
curget.html	7.14 KB	-rw-r--r--
curput.html	4.23 KB	-rw-r--r--
cursor.html	3.79 KB	-rw-r--r--
delete.html	1.83 KB	-rw-r--r--
get.html	2.52 KB	-rw-r--r--
join.html	9.22 KB	-rw-r--r--
open.html	3.11 KB	-rw-r--r--
opensub.html	5.25 KB	-rw-r--r--
ops.html	9.79 KB	-rw-r--r--
put.html	2.33 KB	-rw-r--r--
second.html	10.87 KB	-rw-r--r--
second.javas	3.92 KB	-rw-r--r--
stat.html	1.84 KB	-rw-r--r--
sync.html	2.3 KB	-rw-r--r--
truncate.html	1.49 KB	-rw-r--r--
upgrade.html	3.29 KB	-rw-r--r--
verify.html	3.46 KB	-rw-r--r--

Code Editor : second.html

<html>
<head>
<title>Berkeley DB Reference Guide: Secondary indices</title>
<meta name="description" content="Berkeley DB: An embedded database programmatic toolkit.">
<meta name="keywords" content="embedded,database,programmatic,toolkit,btree,hash,hashing,transaction,transactions,locking,logging,access method,access methods,Java,C,C++">
</head>
<body bgcolor=white>
<a name="2"></a><a name="3"></a>
<table width="100%"><tr valign=top>
<td><dl><dt>Berkeley DB Reference Guide:<dd>Access Methods</dl></td>
<td align=right><a href="../am/close.html"><img src="../../images/prev.gif" alt="Prev"></a><a href="../toc.html"><img src="../../images/ref.gif" alt="Ref"></a><a href="../am/cursor.html"><img src="../../images/next.gif" alt="Next"></a>
</td></tr></table>
Secondary indices
A secondary index, put simply, is a way to efficiently access records
in a database (the primary) by means of some piece of information other
than the usual (primary) key. In Berkeley DB, this index is simply another
database whose keys are these pieces of information (the secondary
keys), and whose data are the primary keys. Secondary indices can be
created manually by the application; there is no disadvantage, other
than complexity, to doing so. However, when the secondary key can be
mechanically derived from the primary key and datum that it points to,
as is frequently the case, Berkeley DB can automatically and transparently
manage secondary indices.
As an example of how secondary indices might be used, consider a
database containing a list of students at a college, each of whom has
a unique student ID number. A typical database would use the student
ID number as the key; however, one might also reasonably want to be
able to look up students by last name. To do this, one would construct
a secondary index in which the secondary key was this last name.
In SQL, this would be done by executing something like the following:
<blockquote><pre>CREATE TABLE students(student_id CHAR(4) NOT NULL,
	lastname CHAR(15), firstname CHAR(15), PRIMARY KEY(student_id));
CREATE INDEX lname ON students(lastname);</pre></blockquote>
In Berkeley DB, this would work as follows (a
<a href="second.javas">Java API example is also available</a>):
<pre><blockquote>struct student_record {
	char student_id[4];
	char last_name[15];
	char first_name[15];
};

void
second()
{
	DB *dbp, *sdbp;
	int ret;
	
	/* Open/create primary */
	if ((ret = db_create(&dbp, dbenv, 0)) != 0)
		handle_error(ret);
	if ((ret = dbp-&gt;open(dbp, NULL,
	 "students.db", NULL, DB_BTREE, DB_CREATE, 0600)) != 0)
		handle_error(ret);
	
	/*
	 * Open/create secondary. Note that it supports duplicate data
	 * items, since last names might not be unique.
	 */
	if ((ret = db_create(&sdbp, dbenv, 0)) != 0)
		handle_error(ret);
	if ((ret = sdbp-&gt;set_flags(sdbp, DB_DUP | DB_DUPSORT)) != 0)
		handle_error(ret);
	if ((ret = sdbp-&gt;open(sdbp, NULL,
	 "lastname.db", NULL, DB_BTREE, DB_CREATE, 0600)) != 0)
		handle_error(ret);
	
	/* Associate the secondary with the primary. */
	if ((ret = dbp-&gt;associate(dbp, NULL, sdbp, getname, 0)) != 0)
		handle_error(ret);
}

/*
 * getname -- extracts a secondary key (the last name) from a primary
 * 	key/data pair
 */
int
getname(secondary, pkey, pdata, skey)
	DB *secondary;
	const DBT *pkey, *pdata;
	DBT *skey;
{
	/*
	 * Since the secondary key is a simple structure member of the
	 * record, we don't have to do anything fancy to return it. If
	 * we have composite keys that need to be constructed from the
	 * record, rather than simply pointing into it, then the user's
	 * function might need to allocate space and copy data. In
	 * this case, the DB_DBT_APPMALLOC flag should be set in the
	 * secondary key DBT.
	 */
	memset(skey, 0, sizeof(DBT));
	skey-&gt;data = ((struct student_record *)pdata-&gt;data)-&gt;last_name;
	skey-&gt;size = sizeof((struct student_record *)pdata-&gt;data)-&gt;last_name;
	return (0);
}</blockquote></pre>
From the application's perspective, putting things into the database
works exactly as it does without a secondary index; one can simply
insert records into the primary database. In SQL one would do the
following:
<blockquote><pre>INSERT INTO student
 VALUES ("WC42", "Churchill ", "Winston ");</pre></blockquote>
and in Berkeley DB, one does:
<blockquote><pre>struct student_record s;
DBT data, key;

memset(&key, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
memset(&s, 0, sizeof(struct student_record));
key.data = "WC42";
key.size = 4;
memcpy(&s.student_id, "WC42", sizeof(s.student_id));
memcpy(&s.last_name, "Churchill ", sizeof(s.last_name));
memcpy(&s.first_name, "Winston ", sizeof(s.first_name));
data.data = &s;
data.size = sizeof(s);
if ((ret = dbp-&gt;put(dbp, txn, &key, &data, 0)) != 0)
	handle_error(ret);</pre></blockquote>
Internally, a record with secondary key "Churchill" is inserted into
the secondary database (in addition to the insertion of "WC42" into the
primary, of course).
Deletes are similar. The SQL clause:
<blockquote><pre>DELETE FROM student WHERE (student_id = "WC42");</pre></blockquote>
looks like:
<blockquote><pre>DBT key;

memset(&key, 0, sizeof(DBT));
key.data = "WC42";
key.size = 4;
if ((ret = dbp-&gt;del(dbp, txn, &key, 0)) != 0)
	handle_error(ret);</pre></blockquote>
Deletes can also be performed on the secondary index directly; a delete
done this way will delete the "real" record in the primary as well. If
the secondary supports duplicates and there are duplicate occurrences of
the secondary key, then all records with that secondary key are removed
from both the secondary index and the primary database. In
SQL:
<blockquote><pre>DELETE FROM lname WHERE (lastname = "Churchill ");</pre></blockquote>
In Berkeley DB:
<blockquote><pre>DBT skey;

memset(&skey, 0, sizeof(DBT));
skey.data = "Churchill ";
skey.size = 15;
if ((ret = sdbp-&gt;del(sdbp, txn, &skey, 0)) != 0)
	handle_error(ret);</pre></blockquote>
Gets on a secondary automatically return the primary datum. If
<a href="../../api_c/db_get.html">DB-&gt;pget</a> or <a href="../../api_c/dbc_get.html">DBcursor-&gt;pget</a> is used in lieu of <a href="../../api_c/db_get.html">DB-&gt;get</a>
or <a href="../../api_c/dbc_get.html">DBcursor-&gt;get</a>, the primary key is returned as well. Thus, the
equivalent of:
<blockquote><pre>SELECT * from lname WHERE (lastname = "Churchill ");</pre></blockquote>
would be:
<blockquote><pre>DBT data, pkey, skey;

memset(&skey, 0, sizeof(DBT));
memset(&pkey, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
skey.data = "Churchill ";
skey.size = 15;
if ((ret = sdbp-&gt;pget(sdbp, txn, &skey, &pkey, &data, 0)) != 0)
	handle_error(ret);
/*
 * Now pkey contains "WC42" and data contains Winston's record.
 */</pre></blockquote>
To create a secondary index to a Berkeley DB database, open the database that
is to become a secondary index normally, then pass it as the "secondary"
argument to the <a href="../../api_c/db_associate.html">DB-&gt;associate</a> method for some primary database.
After a <a href="../../api_c/db_associate.html">DB-&gt;associate</a> call is made, the secondary indices become
alternate interfaces to the primary database. All updates to the
primary will be automatically reflected in each secondary index that has
been associated with it. All get operations using the <a href="../../api_c/db_get.html">DB-&gt;get</a>
or <a href="../../api_c/dbc_get.html">DBcursor-&gt;get</a> methods on the secondary index return the primary datum
associated with the specified (or otherwise current, in the case of
cursor operations) secondary key. The <a href="../../api_c/db_get.html">DB-&gt;pget</a> and
<a href="../../api_c/dbc_get.html">DBcursor-&gt;pget</a> methods also become usable; these behave just like
<a href="../../api_c/db_get.html">DB-&gt;get</a> and <a href="../../api_c/dbc_get.html">DBcursor-&gt;get</a>, but return the primary key in
addition to the primary datum, for those applications that need it as
well.
Cursor get operations on a secondary index perform as expected; although
the data returned will by default be those of the primary database, a
position in the secondary index is maintained normally, and records will
appear in the order determined by the secondary key and the comparison
function or other structure of the secondary database.
Delete operations on a secondary index delete the item from the primary
database and all relevant secondaries, including the current one.
Put operations of any kind are forbidden on secondary indices, as there
is no way to specify a primary key for a newly put item. Instead, the
application should use the <a href="../../api_c/dbc_put.html">DBcursor-&gt;put</a> or <a href="../../api_c/db_put.html">DB-&gt;put</a> methods
on the primary database.
Any number of secondary indices may be associated with a given primary
database, up to limitations on available memory and the number of open
file descriptors.
Note that although Berkeley DB guarantees that updates made using any
<a href="../../api_c/db_class.html">DB</a> handle with an associated secondary will be reflected in the
that secondary, associating each primary handle with all the appropriate
secondaries is the responsibility of the application and is not enforced
by Berkeley DB. It is generally unsafe, but not forbidden by Berkeley DB, to modify
a database that has secondary indices without having those indices open
and associated. Similarly, it is generally unsafe, but not forbidden,
to modify a secondary index directly. Applications that violate these
rules face the possibility of outdated or incorrect results if the
secondary indices are later used.
If a secondary index becomes outdated for any reason, it should be
discarded using the <a href="../../api_c/db_remove.html">DB-&gt;remove</a> method and a new one created
using the <a href="../../api_c/db_associate.html">DB-&gt;associate</a> method. If a secondary index is no
longer needed, all of its handles should be closed using the
<a href="../../api_c/db_close.html">DB-&gt;close</a> method, and then the database should be removed using
a new database handle and the <a href="../../api_c/db_remove.html">DB-&gt;remove</a> method.
Closing a primary database handle automatically dis-associates all
secondary database handles associated with it.
<table width="100%"><tr><td> </td><td align=right><a href="../am/close.html"><img src="../../images/prev.gif" alt="Prev"></a><a href="../toc.html"><img src="../../images/ref.gif" alt="Ref"></a><a href="../am/cursor.html"><img src="../../images/next.gif" alt="Next"></a>
</td></tr></table>
Copyright (c) 1996,2008 Oracle. All rights reserved.
</body>
</html>

${this.title}

Code Editor : second.html