You only need to store 0.5 sqrt(N) keys (the baby steps) : from 1*G to 0.5*sqrt(N)*G
And next step is to calculate required memory for 0.5*sqrt(2^134) points.
After this calculation you will lose all your interest in BSGS
Or may be you are going to break a lot of <64bit points? Even so, kang is faster because you can have precomputed db of DPs and reduce time in 10 times or even more.
If the goal is to retrieve a private key in a 2^134 interval, there is no doubt: BSGS is not the algorithm to use.
But in a 2^64 interval, BSGS can be faster.