| Subject | Re: ORDER BY on large VARCHAR columns |
|---|---|
| Author | robert_difalco |
| Post date | 2004-10-28T16:52:22Z |
--- In firebird-support@yahoogroups.com, "Ann W. Harrison"
<aharrison@i...> wrote:
first guess; save that I was thinking an int64 instead of a float.
My only issue is wondering how long an INSERT could take if I have
10,000,000 records (this is really the upper limit of how large this
table may grow).
I also wonder if with this FLOAT or INT64 column, if I could do a
binary search to find the new INSERT position. Just not exactly sure
how to do that (i.e. look at previous records from my first SELECT).
R.
<aharrison@i...> wrote:
> At 04:50 PM 10/27/2004, robert_difalco wrote:Cool, if you check out my first post on this subject, that was my
>
> Creating a floating point column that's used just for sorting that
> varchar.
first guess; save that I was thinking an int64 instead of a float.
My only issue is wondering how long an INSERT could take if I have
10,000,000 records (this is really the upper limit of how large this
table may grow).
I also wonder if with this FLOAT or INT64 column, if I could do a
binary search to find the new INSERT position. Just not exactly sure
how to do that (i.e. look at previous records from my first SELECT).
R.