Michael Cahill wrote:
Quote:
The common approach to this is to use unique record numbers as the keys
in the primary (without duplicates, obviously), and have both A and B
in the data. You could use a DB_RECNO type database for this.
Then create two secondaries: one for A and one for B. Both can have
DB_DUPSORT set.
Regards,
Michael. |
So I can not create two secondary indices without creating a primary
one first? Correct?
This is my opinion too, but I want to be sure.
AND SO you cannot actually what is done with for example mysql have two
secondary indices in relation R and nothing more...
THE problem is that I want to measure the time need to query the BTREES
so by having another access method for the primary database is
additional time
AND another thing that I want to actually only create two btrees over a
relation -not inside a database- and I thought Berkeley DB was very
useful...