Hi, I have developed a site on linux server(my testing host server). But When I move the site to live server, which is IIS, Windows 2003... my site is very slow. It takes around 20 seconds to load a page. My code is in PHP and I am using Wordpress. Normal Html, Php pages are running fast, but when it connects to MySql.. it takes 4 to 5...
I have a table with large number of rows(~200 million) and I want to process these values in c#, after reading them from memory. Processing requires grouping entries by column values in a way that can't be done inside the sql server itself. Problem is that reading the whole data at once gives me a OutOfMemory exception, and takes a lot o...
i was reading Dive into HTML5: Offline web apps: Cache manifest when i got an idea. can i use it (HTML5 Cache Manifest) to cache files (eg. CSS/JS/Images/etc) for offline capability. but also for performance. user wont need to load those files when they visit your site again? or will it (files cached by cache manifest) work only in offli...
Hello, I have a query which can be expressed 2 different ways with the same results. Which one is better - for performance or other reasons? First query: SELECT post_id FROM posts WHERE post_date BETWEEN '2010-01-01 00:00:00' AND '2010-12-31 23:59:59' Second query: SELECT post_id FROM posts WHERE YEAR(post_date)=2010 Tha...
Hey all, I have this relatively large table in a separate filegroup (2 GB, well, it's not THAT large but large enough I think to start thinking about performance as it's a heavy duty table). This is the only table in this filegroup. Right now the filegroup contains only one datafile. Assuming the table is well-indexed and that index ...
I am doing a query which fetches two fields. I need each of those fields into a different array. Will this rerun the query for each call or just re iterate over the result set? $a= Laststatment->fetchAll(PDO::FETCH_COLUMN,0); $b= Laststatment->fetchAll(PDO::FETCH_COLUMN,1); ...
Does anyone know of any performance benchmarks of Java's new Garbage First (G1) Garbage Collector (as compared to the "old" GCs)? In terms of GC pause times, Sun states that G1 is sometimes better and sometimes worse than CMS. While the G1 collector is successful at limiting total pause time, it's still only a soft real-time collector....
I have a large (150m+ row) table, which is partitioned into quarters using a DATE partition key. When I query the table using something like... SELECT * FROM LARGE_TABLE WHERE THE_PARTITION_DATE >= TO_DATE('1/1/2009', 'DD/MM/YYYY') AND THE_PARTITION_DATE < TO_DATE('1/4/2009', 'DD/MM/YYYY'); ... partition pruning works correctly...
Are there any performance differences between float x, y; // Set x and y if(x > y) { // do something } and float x,y; // Set x and y if(x.CompareTo(y) > 0) { // do something } Are they doing the same thing behind the scenes or is there more to it. I have a piece of performance critical code that does this compari...
I want to add natural numbers from A to B in a set. Currently I am inserting each and every number from A to B, one by one in the set like this, set<int> s; for(int j=A; j<=B; j++) s.insert(j); But it takes O(n) time (here n = (B - A)+1). Is there any pre-defined way in STL to do it in O(1) time? Thanks ...
postgres 8.3 / Ubuntu Karmic / 32-bit (in virtualbox): duration: 76.534 ms statement: truncate audit.users cascade duration: 0.952 ms statement: delete from audit.users postgres 8.4 / Ubuntu lucid / 64-bit (native, on the machine hosting the karmic virtualbox): duration: 1469.271 ms statement: truncate audit.users cascade ...
Have a DTS package that is running in Development, SIT, and UAT. All of the SQL Servers in each of the environments has the same linked servers setup and are the tech specs similar. The DTS package takes different amounts of time to execute. The package should take about 3 hours to run. There are indexes on the tables that are access...
For you database design/performance gurus out there. I'm designing a table, I have the choice of either use int or nvarchar (128) for a column, assume space is not a problem. My question is which will give performance when I search with int column where ID = 12324 or when I search with nvarchar column (the Key is the entire value, ...
I am looking for a solution for monitoring a number of .NET components for a system where performance is critical. I have been looking at performance counters, which generally provide the information needed. The end result is that I would like a number of counters written to a database to be able to report upon. I would like to hold...
What are the alternatives on IE 8 that can work like the Firebug Net Panel? ...
Is there a performance cost to static inner class? Or should I just write the same static class as a non-inner class? ...
I'm doing some queries that require a lot of joined rows have some of their fields added and multiplied together. I know it is sort of vague, but my question is which numeric data type is fastest for these types of operations? Will FLOAT be faster than DOUBLE since DOUBLE is 8 bytes, and FLOAT is 4? Will INT be faster than FLOAT (ev...
Hi, I was wondering if it was possible to speed up this MySQL query. Currently, I am calling it 20,000+ times, and it takes a while to run (a while being about 10 to 20 minutes). Here is the basic table layout: db1: INT(11) id VARCHAR(45) col1 VARCHAR(100) col2 VARCHAR(100) col3 db2: VARCHAR(45) id db3: VARCHAR(45) fk_db2 INT(11) fk...
I´ve a line of code that is called millions of times inside a for loop, checking if a passed argument is double.NaN. I´ve profiled my application and one of the bottlenecks is this simple function: public void DoSomething(double[] args) { for(int i = 0; i < args.Length;i++) { if(double.IsNan(args[i])) { //...
While writing javascript, one can define a method in 3 different ways. 1] A function in global namespace function doSomething(); 2] A function that is member of a function function Clazz() {} Clazz.doSomething = function(){}; 3] A function that is memeber of the instance of function function Clazz() {} Clazz.prototype.doSomething...