Integer division is exact, and requires space as large as the denominator. Are you perhaps asking what the most efficient method is for integer division without remainder? Have a look at the division algorithm: if $a=qb+r$ with $0\le r<|b|$, then $\lfloor\frac{a}{b}\rfloor=q$, and $\lceil\frac{a}{b}\rceil$ is either also $q$ (if $r=0$) or else $q+1$ (for r>0). The work required to find $q$ given arbitrary $a$ & $b$ is equivalent to division, but under special conditions (e.g. if $b$ is fixed, or is a power of two) can be implemented much more efficiently. Check out Knuth's Seminumerical Algorithms chapter 4 (Arithmetic) if such a special case might apply, or if you are concerned about accuracy. Is your concern how to program this efficiently on any given platform in any given language to arbitrary precision? Or do you just want to be able to calculate at will (for example with a computer algebra system such as sage)?
In fact, if we start by truncating $a$ and $b$ to fewer digits of accuracy, the estimated quotient will still be within $\pm1$ of $q$ provided that we haven't truncated too much of $b$ away, as @deinst illustrates. Are you looking for such a guarantee?