i select data from table and show on one page but page load take more time bcz table have 4 lac records

so i what do for quickly fetch data from table plz tell me any solution for it immediately any one

regards,

pradeep kumar jangir

To decide about strategy – you just benchmark each if them and decide what work better for you.

So, do you think i could use one of the strategies i mentioned above?

In simple answer – no, MySQL does not have bitmap indexes.

I’ve a Real Estate web app, where some houses can be marked as “Distinguished”, something like “Featured”. So those property is shown in a special way.

I’d like to look up in the database for all the properties with a given Feature. Supose there’s 3 kinds of feature (eg. Special, Great, Good), and every property has its own. If i’ve 500 properties, my selectivity is about 0,006, then a index wouldn’t be a good choice. But i still want to speed up my search, what can i do? I’ve been thinking to have 3 in-memory arrays containing the ids of the properties. One array for each feature. So, for example, i’d have the array of Special props, and would be like this:
SpecialsProps = [1,15,52,355,61,123,561].

Then if i need to search for all the special props, i would perform a “SELECT … WHERE id IN SpecialProps”, and then, the ID Primary Key, Unique Index would be use. But, in this case, doing so, i’d force to look several times for the index and the ids, and wouldn’t be faster than making a full scan (at least, that’s what i think). Another good strategy is, having all the properties cached, i could reference them directly.

So, to finalize this comment, a simple question. Does MySQL have any index like the BitMap from Oracle?

Thank you very much!

Thanks in Advance
Vijay

When businesses need to group one type of server in with similar kinds, rack mount computer cases are brought in. Holding as many as 40 single servers, they feature common temperature-monitoring systems, linked drive bays and up to a maximum of 10 air-…