Igor Tandetnik,
>> How come you only show one function? A user-defined aggregate function is
>> actually represented by two C[++] functions - one that is called for every
>> row
>> and performs actual aggregation, and another that's called at the end of
>> each
>> group, reports the result
Frank Chang wrote:
>The explain query plan for select FieldName, min(rowid) from
> BlobLastNameTest group by FieldName shows a full index scan.
Of course. How else do you expect to be able to look at every FieldName?
You seem to be expecting some kind of a "compressed" index - an index
Igor Tandetnik,
The explain query plan for select FieldName, min(rowid) from
BlobLastNameTest group by FieldName shows a full index scan, even after I run
ANALYZE TABLE AND INDEX ON FIELDNAME, which could be problematic when the
number of rows in BlobLastNameTest increases by a facto
Igor Tandetnik,
>>> Explain the problem you are trying to solve, *not* your proposed solution.
>>> <<<
What we are trying to achieve is to to find the minimum row id for each
unique Field Name in BLobLastNameTest where many rows can have the same
FIELDNAME but distinct BLOBS(Vertice
Frank Chang wrote:
> Igor Tandetnik,
> The fieldname groups in our BlobLastNameTable consist of
> multiple rows where each pair of columns [FieldName,
> BLOB[Vertices]] is unique.
How so? You have FieldName declared as PRIMARY KEY. From your original post:
CREATE
Igor Tandetnik,
The fieldname groups in our BlobLastNameTable consist of
multiple rows where each pair of columns [FieldName, BLOB[Vertices]] is unique.
Therefore, every fieldname group does not just have a single row but instead
1000's or 1's rows. So that is why we use
6 matches
Mail list logo