I'm trying to perform a search that I can't find any information about
in MySQL's manuals, discussion groups, or on the Web.
I'm used to using BerkeleyDB's Btree, so I can browse to find the
alphabetically next match against a query.
If I query "faction" in a BDB btree database and use DB_SET_RANGE as
one of the parameters, I can get "fiction" as the next closest higher
match.
I cannot figure out how to simulate this in MySQL. Do I need to create
a BDB table? (Also, I'm using pre-compiled binaries of 4.1.3 for Linux
i386 -- I don't see BDB as a table option.)
Thanks!
in MySQL's manuals, discussion groups, or on the Web.
I'm used to using BerkeleyDB's Btree, so I can browse to find the
alphabetically next match against a query.
If I query "faction" in a BDB btree database and use DB_SET_RANGE as
one of the parameters, I can get "fiction" as the next closest higher
match.
I cannot figure out how to simulate this in MySQL. Do I need to create
a BDB table? (Also, I'm using pre-compiled binaries of 4.1.3 for Linux
i386 -- I don't see BDB as a table option.)
Thanks!