I am wondering how fast search would be done with packed records...
struct{
int iD;
char * Text[];
}packedProduct;
struct{
int ID;
char* SKU;
char* UPC;
}Product;
It looks like your packed records are stored as follows:
- 2 bytes for ID
- several bytes for
I have read some of the posts regarding fast database searches. I am
wondering how fast search would be done with packed records, since I was
told and learned that record storage should be used with packed records.
However, I am not sure about how to do sorting with null terminated strings.
Here
