Re^3: Bid data but need fast response time

All databases should cache MRU -- mysql has a really good read only cache.

But performance will heavily depend on how you map your data structure to the schema.

For a purely perl approach I think I might try Tie::File and split the data into fixed length lines, but without knowing more about your problem it's difficult to tell ;)

Comment on Re^3: Bid data but need fast response time

Replies are listed 'Best First'.
Re^4: Bid data but need fast response time by Anonymous Monk on May 21, 2012 at 15:07 UTC
My point is that my application is more like a spell checker -- which would probably be terribly inefficient if implemented via mysql. I suppose a super long query like, "Select Code,Instances from Codes where code in ('cdfe','abcd','asdf','qwet',...)" would be the most efficient query. (I would expect to retrieve 10,000 to 100,000 codes for a typical query.) HOWEVER -- even with indices, this seems more like a "DBM" rather than an RDBM problem.	[reply]

Replies are listed 'Best First'.

Re^4: Bid data but need fast response time
by Anonymous Monk on May 21, 2012 at 15:07 UTC

"Select Code,Instances from Codes where code in ('cdfe','abcd','asdf','qwet',...)"

would be the most efficient query. (I would expect to retrieve 10,000 to 100,000 codes for a typical query.) HOWEVER -- even with indices, this seems more like a "DBM" rather than an RDBM problem.

[reply]