Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8571541
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 11, 20262026-06-11T18:48:16+00:00 2026-06-11T18:48:16+00:00

What is the time complexity of simple SQL statements like the following? INSERT into

  • 0

What is the time complexity of simple SQL statements like the following?

INSERT into table (col1, col2, col3) values ("a", "b", "c")

How does it depend on the following:

  1. size of the table
  2. datatype of col1, col2
  3. number of columns in the table viz. col1, col2, col3, etc

Does this depend on whether I am using MyISAM or InnoDB?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-11T18:48:17+00:00Added an answer on June 11, 2026 at 6:48 pm

    The MySQL 5.0 documentation has a nice page on this topic.

    The article provides approximate proportial costs for each of the subtasks involved in an insertion task.

    The time required for inserting a row is determined by the following factors, where the numbers indicate approximate proportions:

    Connecting: (3)

    Sending query to server: (2)

    Parsing query: (2)

    Inserting row: (1 × size of row)

    Inserting indexes: (1 × number of indexes)

    Closing: (1)

    This does not take into consideration the initial overhead to open
    tables, which is done once for each concurrently running query.

    The size of the table slows down the insertion of indexes by log N,
    assuming B-tree indexes.

    The rest of article provides techniques for speeding up insertions, useful if insert speed becomes a bottleneck in your application.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Wikipedia says the following on A*'s complexity: The time complexity of A* depends on
In C#.NET, I like using HashSets because of their supposed O(1) time complexity for
I am trying to check the time complexity of the below simple program. The
Is the time complexity of the Oracle MAX function O(1), O(log n) or O(n)
What is the time complexity of this nifty function 'assoc'?
What is the time complexity of accessing a column by its name in an
Find out the time complexity (Big Oh Bound) of the recurrence T(n) = T(⌊n⌋)
Could you please help me find out the time complexity of the Fleury' algorithm
Hi I want to know what is the time complexity of the replaceAll function
Is it possible to solve a problem of O(n!) complexity within a reasonable time

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.