Skip to main content

Home/ ProgrammingPages/ Group items tagged http

Rss Feed Group items tagged

Navneet Kumar

MySQL Performance Blog » MySQL Query Cache - 0 views

  • It does not cache the plan but full result sets
  • so it looks at first letter of the query and if it is “S” it proceeds with query lookup in cache if not - skips it.
  • Might not work with transactions
  • ...15 more annotations...
  • uses non-deterministic functions such as UUID(), RAND(), CONNECTION_ID() etc it will not be cached.
  • If table gets modification all queries derived from this table are invalidated at once
  • if you have high write application such as forums, query cache efficiency might be pretty low due to this.
  • all queries are removed from cache on table modifications - if there are a lot of queries being cached this might reduce update speed a bit
  • Qcache_free_memory and Qcache_lowmem_prunes
  • number of your selects - Com_select and see how many of them are cached. Query Cache efficiency would be Qcache_hits/(Com_select+Qcache_hits).
  • One portion of query cache overhead is of course inserts so you can see how much of inserted queries are used: Qcache_hits/Qcache_inserts Other portion of overhead comes from modification statements which you can calculate by (Com_insert+Com_delete+Com_update+Com_replace)/Qcache_hits
  • want to set query cache
  • means it is much more efficient as query which required processing millions of rows now can be instantly summoned from query cache
  • It also means query has to be exactly the same and deterministic, so hit rate would generally be less
  • full page caching
  • not using query_cache_wlock_invalidate=ON locking table for write would not invalidate query cache so you can get results evenif table is locked and is being prepared to be updated
  • it can serve responses very fast doing no extra conversion or processing.
  • but it is still not as fast as specially designed systems such as memcached or local shared memory.
  • It is not distributed If you have 10 slaves and use query cache on all of them cache content will likely be the same, so you have multiple copies of the same data in cache effectively wasting memory
  •  
    mysql query caching
Navneet Kumar

mysql query cache - 0 views

  •  
    tuning mysql performance with query caching
Navneet Kumar

Pythian Group Blog » MySQL: Tuning filesorts and temporary tables - 0 views

  •  
    filesort and temporary tables in query
Navneet Kumar

SQL Server Data Structure - 0 views

  •  
    MS SQL Server Data structures. how data is stored in ms sql  server
Navneet Kumar

Vi for programmers - Program - UNIX - Builder AU - 0 views

  •  
    taming vim, vim options
Navneet Kumar

10 secret MySQL client startup options you should know - 1 views

  •  
    mysql client options
Navneet Kumar

MySQL AB :: MySQL 5.0 Reference Manual :: 13 Storage Engines - 0 views

  •  
    mysql storage engines myisam and innodb
Navneet Kumar

Unusual software bug - Wikipedia, the free encyclopedia - 0 views

  •  
    heisenbug, bohrbug, mandelbug, schroedinbug
Navneet Kumar

PatHelland's WebLog : Normalization Is for Sissies - 0 views

  •  
    de-normalization is ok if you are not going to update
Navneet Kumar

What about Sun embracing JavaScript? - 0 views

  • There's a lot of work being done by the Mozilla foundation and Adobe to integrate a killer JavaScript interpreter into both Flash and Firefox using Adobe's Tamarin engine
Navneet Kumar

SQL Server 7.0: System Error Messages - 0 views

  •  
    All ms-sql system error messages
Navneet Kumar

SQL Server 7.0: Resolving System Error Messages - 0 views

  •  
    some ms-sql error-code  descriptions
Navneet Kumar

MySQL Reference Manual for version 5.0.3-alpha - 23 Error Handling in MySQL - 0 views

  •  
    mysql error codes
Navneet Kumar

Bruce Eckel's MindView, Inc: 3-10-04 Generics Aren't - 0 views

  • Generics seem to only solve the problem of automatically casting in and out of containers.
  • So if we write generic code that actually takes a "type of anything," that type can only be an Object, and our generic code must only call Object methods on it.
  • generics have no advantage. In fact, it's confusing if you see them used, because you scratch your head and wonder "why does he need a generic here? What is the advantage?" Answer: none.
  • ...3 more annotations...
  • Java Generics use "erasure," which drops everything back to Object if you try to say "any type." So when I say <T>, it doesn't really mean "anything" like C++/ADA/Python etc. does, it means "Object."
  • So generics are really "autocasting."
  • That's the way of the Java world, and we are going to miss out on latent typing (it's actually possible to simulate latent typing using reflection, as I do once or twice in Thinking in Java, but it's messy and much less elegant).
  •  
    bruce Eckel article on java generics, and how it does  nothing more than  autocasting. Also templating or parameterized type in C++, Ruby, Python
Navneet Kumar

An Unorthodox Approach to Database Design : The Coming of the Shard | High Scalability - 0 views

  •  
    shard architecture partitions data onto multiple servers, so each server holds a shard of data
« First ‹ Previous 61 - 80 of 97 Next ›
Showing 20 items per page