Skip to main content
replaced http://stackoverflow.com/ with https://stackoverflow.com/
Source Link

From the comments, it appears as though you are searching 250 swimmers with 25 properties each.

Even if this is done by application code, it should still take an unnoticeable amount of time, unless you are making N queries per swimmer, or any sort of complex lookup per swimmer. If this is the case, look up the N+1 select problem and use the minimum number queries/lookups to build your swimmers.

SO answer on N+1 selectSO answer on N+1 select

PHP article on N+1 select

From the comments, it appears as though you are searching 250 swimmers with 25 properties each.

Even if this is done by application code, it should still take an unnoticeable amount of time, unless you are making N queries per swimmer, or any sort of complex lookup per swimmer. If this is the case, look up the N+1 select problem and use the minimum number queries/lookups to build your swimmers.

SO answer on N+1 select

PHP article on N+1 select

From the comments, it appears as though you are searching 250 swimmers with 25 properties each.

Even if this is done by application code, it should still take an unnoticeable amount of time, unless you are making N queries per swimmer, or any sort of complex lookup per swimmer. If this is the case, look up the N+1 select problem and use the minimum number queries/lookups to build your swimmers.

SO answer on N+1 select

PHP article on N+1 select

Source Link
FMJaguar
  • 3.1k
  • 20
  • 15

From the comments, it appears as though you are searching 250 swimmers with 25 properties each.

Even if this is done by application code, it should still take an unnoticeable amount of time, unless you are making N queries per swimmer, or any sort of complex lookup per swimmer. If this is the case, look up the N+1 select problem and use the minimum number queries/lookups to build your swimmers.

SO answer on N+1 select

PHP article on N+1 select