SitePoint Sponsor

User Tag List

Results 1 to 3 of 3
  1. #1
    SitePoint Wizard bronze trophy
    Join Date
    Jul 2008
    Posts
    5,757
    Mentioned
    0 Post(s)
    Tagged
    0 Thread(s)

    index update speed

    http://dev.mysql.com/doc/refman/5.0/...ert-speed.html
    The size of the table slows down the insertion of indexes by log N, assuming B-tree indexes.
    N stands for how many rows in the table?

    So for a table with:
    100 rows, slowdown = 1
    1,000 rows, slowdown = 2
    10,000 rows, slowdown = 3
    100,000 rows, slowdown = 4

    Is my understanding correct?

  2. #2
    Follow Me On Twitter: @djg gold trophysilver trophybronze trophy Dan Grossman's Avatar
    Join Date
    Aug 2000
    Location
    Philadephia, PA
    Posts
    20,578
    Mentioned
    1 Post(s)
    Tagged
    0 Thread(s)
    You're off by 1 assuming log base 10, but that's the right idea.

    The base of the log isn't 10, though. A B-tree data structure enforces a logarithmic relationship between the number of nodes and the height of the tree, but the base depends on the implementation.

  3. #3
    SitePoint Wizard bronze trophy
    Join Date
    Jul 2008
    Posts
    5,757
    Mentioned
    0 Post(s)
    Tagged
    0 Thread(s)
    Thanks


Bookmarks

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •