URI:
   DIR Return Create A Forum - Home
       ---------------------------------------------------------
       ExcelSoft Database Professionals
  HTML https://esdbp.createaforum.com
       ---------------------------------------------------------
       *****************************************************
   DIR Return to: General
       *****************************************************
       #Post#: 74--------------------------------------------------
       SQL Server 2014 works in the way developer wants 
       By: srinivasma_exceldbp Date: June 10, 2014, 12:43 am
       ---------------------------------------------------------
       When SQL Server 2005 was released, one of the big stories was
       around CLR. Many were saying that T-SQL stored procedures would
       be a thing of the past because we now had CLR, and that
       obviously going to be much faster than using the abstracted
       T-SQL. Around the same time, we were seeing technologies like
       Linq-to-SQL produce poor T-SQL equivalents. Developers  wanted
       to move away from T-SQL, having lost trust in it.
       CLR hasn’t exactly become the default option for stored
       procedures, although there are plenty of situations where it can
       be useful for getting faster performance.
       SQL Server 2014 is different though, through Hekaton – its
       In-Memory OLTP environment.
       When you create a table using Hekaton (that is, a
       memory-optimized one), the table you create is the kind of thing
       you’d’ve made as a developer. It creates code in C leveraging
       structures and pointers and arrays, which it compiles into fast
       code. When you insert data into it, it creates a new instance of
       a structures  in memory, and adds it to an array. When the
       insert is committed, a small write is made to the transaction to
       make sure it’s durable, but none of the locking and latching
       behavior that typifies transactional systems is needed. Indexes
       are done using hashes and using bw-trees (which avoid locking
       through the use of pointers) and by handling each updates as a
       delete-and-insert.
       This is data the way that developers do it when they’re coding
       for performance. Being done in C, it compiles to very quick
       code, and although these tables don’t support every feature that
       regular SQL tables do, this is still an excellent direction that
       has been taken
       Developer should know table design NOT supported by  In Memory
       OLTP features . See the details in below URL
       Transact-SQL Constructs Not Supported by In-Memory OLTP:
  HTML http://technet.microsoft.com/en-us/library/dn246937(v=sql.120).aspx
       *****************************************************