I suggest that you get Donald Knuth's books (Fundamental Algorithms,
Sorting and Seaching and Semi-Numerical Algorithms). They have
everything you need to know, and plenty more. Knuth explains various
type of B-Tree and plenty of merging algorithms.
Cesar David Rodas Maldonado wrote:
I meen, If SQLite has two index and very large Index (about 10.000.000 each
one) how do i merge it, I mean (index1 = index2 for every one and limit it
in thousand).
Understand?
On 9/15/06, Dennis Cote <[EMAIL PROTECTED]> wrote:
Cesar David Rodas Maldonado wrote:
> If there a document of how SQLite Virtual Machine Works ( papers )? I
> would
> like do something similar with B-Tree, B+ Tree but i dont know how to
> merge
> a select with tow Index? Understand my question??
>
> Please answer me
>
see the links VDBE Tutorial and VDBE Opcodes near he bottom of the
documentation page http://www.sqlite.org/docs.html
Dennis Cote
-----------------------------------------------------------------------------
To unsubscribe, send email to [EMAIL PROTECTED]
-----------------------------------------------------------------------------
-----------------------------------------------------------------------------
To unsubscribe, send email to [EMAIL PROTECTED]
-----------------------------------------------------------------------------
