3 ms·
That tree structure my friend is called a binary search tree. It is essentially a permutation of the same kind of search.
by crimsonalucard 10y ago
That tree structure my friend is called a binary search tree. It is essentially a permutation of the same kind of search.
- irishsultan 10y agoSure, it's clearly sort of the same thing, but it's not in fact a binary search (if only because few DBs will have a tree with a branching factor of 2), and this is assuming your index is in fact a tree and not a hash index (do you really want to specify what kind of index it is, each time you use it? for that matter do you really want to prevent usage of an index just because you or one of your colleagues wasn't aware of it's existence)
- crimsonalucard 10y agoWhen did I say you should index the db as soon as you search? All I'm saying is change the API from a expression based query language to a imperative language.... noSQL.