Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>It depends what else you're doing with the numbers. You can trade off a slight loss in space efficiency and a modest loss in efficiency of multiprecision arithmetic in return for very efficient conversion to and from decimal. The key is to do multiprecision arithmetic with a base that is a power of 10 rather than a power of 2.</p> <p>For example, you might use base 10,000, where you pack one digit into a 16-bit word and you do your arithmetic on digits in 32-bit integers. (If you're on a 64-bit machine you can double that and do base 1,000,000,000.) This kind of code is relatively efficient timewise, although not quite as fast as using the native power of two because you can't take advantage of the carry bit on the hardware. And you can't represent as many integers in the same number of bits. But it's a whiz at converting to and from decimal, because you get to convert the individual digits without any long division.</p> <p>If you need to represent the full range of numbers from zero to <code>((1 &lt;&lt; 128) - 1)</code>, you can still do this, but add an extra digit, so your numbers will be bigger.</p> <p>If it turns out you really need the extra space/speed (maybe you're doing a lot of cryptographic 128-bit calculations) then the method of simultanous div/mod by 10 is the fastest method I know. The only other trick is that if small integers are common, you can handle them specially. (That is, if the three most significant 32-bit words are all zero, just use the native division to convert.)</p> <blockquote> <p>Is there a clever way to implement this function that I'm not seeing?</p> </blockquote> <p>Dave Hanson's <a href="http://www.cs.princeton.edu/software/cii/" rel="nofollow noreferrer">C Interfaces and Implementations</a> has a lengthy chapter on multiprecision arithmetic. Dividing a large number by a single digit is a special case that has this efficient implementation:</p> <pre><code>int XP_quotient(int n, T z, T x, int y) { int i; unsigned carry = 0; for (i = n - 1; i &gt;= 0; i--) { carry = carry*BASE + x[i]; z[i] = carry/y; carry %= y; } return carry; } </code></pre> <p>For full understanding, it really helps to have the book, but the <a href="https://github.com/drh/cii/blob/master/src/xp.c" rel="nofollow noreferrer">source code</a> is still a lot easier to understand than the GNU source code. And you could easily adapt it to use base 10,000 (it currently uses base 256).</p> <p>Summary: if your performance bottleneck is conversion to decimal, implement <strong>multiprecision arithmetic with a base that is a power of 10</strong>. If your machine's native word size is 32 and you are using C&nbsp;code, use 10,000&nbsp;in a 16-bit word.</p>
    singulars
    1. This table or related slice is empty.
    1. POFastest way to convert binary to decimal?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USjp48
    1. USNorman Ramsey
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POFastest way to convert binary to decimal?
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload