Post reply

Big O(1) in SQL 2012

  • November 13, 2014 at 2:53 am

    #298350

    Hi,

    Big O(1) will be applied for Hash methods not for B-Tree. How to implement it in SQL 2012 ? is it something forcing Hash Loop join instead of Nested Loop ?

    Thanks

    Karthik M

    karthik

  • November 13, 2014 at 2:56 am

    #1758164

    Does Triangular Join use O(N2/2) ?

    karthik

  • November 13, 2014 at 4:32 am

    #1758176

    karthik M (11/13/2014)

    Does Triangular Join use O(N2/2) ?

    Are you writing a thesis, or is there some practical reason for your questions?

    If you haven't even tried to resolve your issue, please don't expect the hard-working volunteers here to waste their time providing links to answers which you could easily have found yourself.

  • November 13, 2014 at 6:46 am

    #1758212

    I have read about O(1) in stackoverflow. So I want to know map it with Sql2012.

    karthik

  • November 13, 2014 at 12:41 pm

    #1758377

    Do you know what O(1) means?

    Gail Shaw
    Microsoft Certified Master: SQL Server, MVP, M.Sc (Comp Sci)
    SQL In The Wild: Discussions on DB performance with occasional diversions into recoverability

    We walk in the dark places no others will enter
    We stand on the bridge and no one may pass

  • November 16, 2014 at 10:31 pm

    #1758866

    O(1) --> It will take constant time, like 14 nanoseconds, or 1 minute no matter the amount of data in the set

    karthik

  • November 17, 2014 at 1:28 am

    #1758885

    Yup, that's correct. So, given that definition, does your original question (how to implement O(1)) make any sense?

    Also, what is the theoretical O(n) for a hash search (see your algorithms textbook)

    Gail Shaw
    Microsoft Certified Master: SQL Server, MVP, M.Sc (Comp Sci)
    SQL In The Wild: Discussions on DB performance with occasional diversions into recoverability

    We walk in the dark places no others will enter
    We stand on the bridge and no one may pass

  • November 17, 2014 at 5:11 am

    #1758932

    O(1) is for FindMin/Max, Search

    O(n) is for Insert operation.

    karthik

  • November 17, 2014 at 5:32 am

    #1758942

    Really?

    Name a search algorithm that has O(1) performance.

    Gail Shaw
    Microsoft Certified Master: SQL Server, MVP, M.Sc (Comp Sci)
    SQL In The Wild: Discussions on DB performance with occasional diversions into recoverability

    We walk in the dark places no others will enter
    We stand on the bridge and no one may pass

  • November 17, 2014 at 5:58 am

    #1758955

    Typo: Not for search...

    karthik

Viewing 10 posts - 1 through 9 (of 9 total)

You must be logged in to reply to this topic. Login to reply