<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>

<channel>
	<title>Sherlock Group</title>
	<atom:link href="http://blog.sherlock-group.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.sherlock-group.com</link>
	<description></description>
	<pubDate>Sun, 07 Feb 2010 06:33:54 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5</generator>
	<language>en</language>
			<item>
		<title>Order By - in SQL</title>
		<link>http://blog.sherlock-group.com/2008/12/order-by-in-sql/</link>
		<comments>http://blog.sherlock-group.com/2008/12/order-by-in-sql/#comments</comments>
		<pubDate>Sat, 13 Dec 2008 04:14:36 +0000</pubDate>
		<dc:creator>sherlock</dc:creator>
		
		<category><![CDATA[Programming]]></category>

		<category><![CDATA[Query]]></category>

		<category><![CDATA[sql]]></category>

		<guid isPermaLink="false">http://blog.sherlock-group.com/?p=92</guid>
		<description><![CDATA[ms_user table



user_id
username
email
area_id


1
sherlock
c_sherlock@email.com
1


2
poirot
poirot@email.com
2


3
watson
b_watson@email.com
1


4
hasting
hasting@email.com
2


5
mycroft
a_mycroft@email.com
1



SELECT *  FROM `ms_user`
ORDER BY `area_id` , `email` DESC , `username`;
have the result ::



user_id
username
email
area_id


1
sherlock
c_sherlock@email.com
1


2
watson
b_watson@email.com
1


5
mycroft
a_mycroft@email.com
1


3
poirot
poirot@email.com
2


4
hasting
hasting@email.com
2



]]></description>
			<content:encoded><![CDATA[<p>ms_user table</p>
<table border="1" cellspacing="1" cellpadding="1">
<tbody>
<tr>
<td>user_id</td>
<td>username</td>
<td>email</td>
<td>area_id</td>
</tr>
<tr>
<td>1</td>
<td>sherlock</td>
<td>c_sherlock@email.com</td>
<td>1</td>
</tr>
<tr>
<td>2</td>
<td>poirot</td>
<td>poirot@email.com</td>
<td>2</td>
</tr>
<tr>
<td>3</td>
<td>watson</td>
<td>b_watson@email.com</td>
<td>1</td>
</tr>
<tr>
<td>4</td>
<td>hasting</td>
<td>hasting@email.com</td>
<td>2</td>
</tr>
<tr>
<td>5</td>
<td>mycroft</td>
<td>a_mycroft@email.com</td>
<td>1</td>
</tr>
</tbody>
</table>
<p>SELECT *  FROM `ms_user`<br />
ORDER BY `area_id` , `email` DESC , `username`;</p>
<p><span id="more-92"></span>have the result ::</p>
<table  border="1" cellspacing="1" cellpadding="1">
<tbody>
<tr>
<td>user_id</td>
<td>username</td>
<td>email</td>
<td>area_id</td>
</tr>
<tr>
<td>1</td>
<td>sherlock</td>
<td>c_sherlock@email.com</td>
<td>1</td>
</tr>
<tr>
<td>2</td>
<td>watson</td>
<td>b_watson@email.com</td>
<td>1</td>
</tr>
<tr>
<td>5</td>
<td>mycroft</td>
<td>a_mycroft@email.com</td>
<td>1</td>
</tr>
<tr>
<td>3</td>
<td>poirot</td>
<td>poirot@email.com</td>
<td>2</td>
</tr>
<tr>
<td>4</td>
<td>hasting</td>
<td>hasting@email.com</td>
<td>2</td>
</tr>
</tbody>
</table>
]]></content:encoded>
			<wfw:commentRss>http://blog.sherlock-group.com/2008/12/order-by-in-sql/feed/</wfw:commentRss>
		</item>
		<item>
		<title>The boolean full-text search following operators</title>
		<link>http://blog.sherlock-group.com/2008/08/the-boolean-full-text-search-following-operators/</link>
		<comments>http://blog.sherlock-group.com/2008/08/the-boolean-full-text-search-following-operators/#comments</comments>
		<pubDate>Sat, 09 Aug 2008 05:11:29 +0000</pubDate>
		<dc:creator>sherlock</dc:creator>
		
		<category><![CDATA[Programming]]></category>

		<category><![CDATA[Query]]></category>

		<guid isPermaLink="false">http://blog.sherlock-group.com/?p=70</guid>
		<description><![CDATA[The boolean full-text search capability supports the following operators:
1. +
A leading plus sign indicates that this word must be present in every row returned.
2. -
A leading minus sign indicates that this word must not be present in any row returned.
3. (no operator)
By default (when neither + nor - is specified) the word is optional, but [...]]]></description>
			<content:encoded><![CDATA[<p>The boolean full-text search capability supports the following operators:<br />
1. +<br />
A leading plus sign indicates that this word must be present in every row returned.<br />
2. -<br />
A leading minus sign indicates that this word must not be present in any row returned.<br />
3. (no operator)<br />
By default (when neither + nor - is specified) the word is optional, but the rows that contain it are rated higher. This mimics the behavior of <a href="http://blog.sherlock-group.com/2008/08/match-against/">MATCH() &#8230; AGAINST()</a> without the IN BOOLEAN MODE modifier.<br />
4. &gt; &lt;<br />
These two operators are used to change a word&#8217;s contribution to the relevance value that is assigned to a row. The &gt; operator increases the contribution and the &lt; operator decreases it. See the example below.<br />
5. ( )<span id="more-70"></span>Parentheses are used to group words into subexpressions. Parenthesized groups can be nested.<br />
6. ~<br />
A leading tilde acts as a negation operator, causing the word&#8217;s contribution to the row relevance to be negative. It&#8217;s useful for marking noise words. A row that contains such a word is rated lower than others, but is not excluded altogether, as it would be with the - operator.<br />
7. *<br />
An asterisk is the truncation operator. Unlike the other operators, it should be appended to the word.<br />
8. &#8221;<br />
A phrase that is enclosed within double quote (‘&#8221;’) characters matches only rows that contain the phrase literally, as it was typed. The full-text engine splits the phrase into words, performs a search in the FULLTEXT index for the words. Before MySQL 5.0.3, the engine then performs a substring search for the phrase in the records that are found, so the match must include non-word characters in the phrase. As of MySQL 5.0.3, non-word characters need not be matched exactly: Phrase searching requires only that matches contain exactly the same words as the phrase and in the same order. For example, &#8220;test phrase&#8221; matches &#8220;test, phrase&#8221; as of MySQL 5.0.3, but not before.</p>
<p>Eg ::</p>
<ul type="disc">
<li><code class="literal">'apple banana'</code><br />
Find rows that contain at least one of the two words.</li>
<li><code class="literal">'+apple +juice'<br />
</code>Find rows that contain both words.</li>
<li><code class="literal">'+apple macintosh'</code><br />
Find rows that contain the word “<span class="quote">apple</span>”, but rank  rows higher if they also contain “<span class="quote">macintosh</span>”.</li>
<li><code class="literal">'+apple -macintosh'</code><br />
Find rows that contain the word “<span class="quote">apple</span>” but not  “<span class="quote">macintosh</span>”.</li>
<li><code class="literal">'+apple +(&gt;turnover &lt;strudel)'<br />
</code>Find rows that contain the words “<span class="quote">apple</span>” and “<span class="quote">turnover</span>”, or “<span class="quote">apple</span>” and “<span class="quote">strudel</span>” (in any order), but rank “<span class="quote">apple  turnover</span>” higher than “<span class="quote">apple strudel</span>”.</li>
<li><code class="literal">'apple*'</code><br />
Find rows that contain words such as “<span class="quote">apple</span>”, “<span class="quote">apples</span>”, “<span class="quote">applesauce</span>”, or “<span class="quote">applet</span>”.</li>
<li><code class="literal">'"some words"'</code><br />
Find rows that contain the exact phrase “<span class="quote">some words</span>”  (for example, rows that contain “<span class="quote">some words of wisdom</span>”  but not “<span class="quote">some noise words</span>”). Note that the ‘<code class="literal">"</code>’ characters that surround the phrase are operator  characters that delimit the phrase. They are not the quotes that surround the  search string itself.</li>
</ul>
<p>Source :: Mysql Manual</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.sherlock-group.com/2008/08/the-boolean-full-text-search-following-operators/feed/</wfw:commentRss>
		</item>
		<item>
		<title>MATCH () AGAINST ()</title>
		<link>http://blog.sherlock-group.com/2008/08/match-against/</link>
		<comments>http://blog.sherlock-group.com/2008/08/match-against/#comments</comments>
		<pubDate>Sat, 09 Aug 2008 05:05:46 +0000</pubDate>
		<dc:creator>sherlock</dc:creator>
		
		<category><![CDATA[Programming]]></category>

		<category><![CDATA[Query]]></category>

		<guid isPermaLink="false">http://blog.sherlock-group.com/?p=69</guid>
		<description><![CDATA[The MATCH() function performs a natural language  search for a string against a text collection. A collection is a set of one or  more columns included in a FULLTEXT index. The search  string is given as the argument to AGAINST(). For  every row in the table, MATCH() returns a relevance  [...]]]></description>
			<content:encoded><![CDATA[<p>The <code class="literal">MATCH()</code> function performs a natural language  search for a string against a text collection. A collection is a set of one or  more columns included in a <code class="literal">FULLTEXT</code> index. The search  string is given as the argument to <code class="literal">AGAINST()</code>. For  every row in the table, <code class="literal">MATCH()</code> returns a relevance  value, that is, a similarity measure between the search string and the text in  that row in the columns named in the <code class="literal">MATCH()</code> list.</p>
<p>By default, the search is performed in case-insensitive fashion. In MySQL 4.1  and up, you can make a full-text search by using a binary collation for the  indexed columns. For example, a column that has a character set of <code class="literal">latin1</code> can be assigned a collation of <code class="literal">latin1_bin</code> to make it case sensitive for full-text  searches.<span id="more-69"></span></p>
<p>When <code class="literal">MATCH()</code> is used in a <code class="literal">WHERE</code> clause, as in the preceding example, the rows  returned are automatically sorted with the highest relevance first. Relevance  values are non-negative floating-point numbers. Zero relevance means no  similarity. Relevance is computed based on the number of words in the row, the  number of unique words in that row, the total number of words in the collection,  and the number of documents (rows) that contain a particular word.</p>
<p>Eg ::<br />
1 . mysql&gt; SELECT * FROM articles WHERE MATCH (title,body) AGAINST (&#8217;database&#8217;);</p>
<table border="1">
<tbody>
<tr>
<td>id</td>
<td>title</td>
<td>body</td>
</tr>
<tr>
<td>5</td>
<td>MySQL vs. YourSQL</td>
<td>In the following database comparison &#8230;</td>
</tr>
<tr>
<td>1</td>
<td>MySQL Tutorial</td>
<td>DBMS stands for DataBase &#8230;</td>
</tr>
</tbody>
</table>
<p>2. mysql&gt; SELECT id, body, MATCH (title,body) AGAINST  -&gt; (&#8217;Security implications of running MySQL as root&#8217;) AS score  -&gt; FROM articles WHERE MATCH (title,body) AGAINST  -&gt; (&#8217;Security implications of running MySQL as root&#8217;);</p>
<table border="1">
<tbody>
<tr>
<td>id</td>
<td>body</td>
<td>score</td>
</tr>
<tr>
<td>4</td>
<td>1. Never run mysqld as root. 2. &#8230;</td>
<td>I1.5219271183014</td>
</tr>
<tr>
<td>6</td>
<td>When configured properly, MySQL &#8230;</td>
<td>1.3114095926285</td>
</tr>
</tbody>
</table>
<p>more :: <a href="http://blog.sherlock-group.com/2008/08/the-boolean-full-text-search-following-operators/">The boolean full-text search following operators</a></p>
]]></content:encoded>
			<wfw:commentRss>http://blog.sherlock-group.com/2008/08/match-against/feed/</wfw:commentRss>
		</item>
		<item>
		<title>The Special Syntaxes of Google</title>
		<link>http://blog.sherlock-group.com/2008/07/the-special-syntaxes-of-google/</link>
		<comments>http://blog.sherlock-group.com/2008/07/the-special-syntaxes-of-google/#comments</comments>
		<pubDate>Thu, 31 Jul 2008 16:25:34 +0000</pubDate>
		<dc:creator>sherlock</dc:creator>
		
		<category><![CDATA[General]]></category>

		<guid isPermaLink="false">http://blog.sherlock-group.com/?p=67</guid>
		<description><![CDATA[
site:
site: allows you to narrow your search by either a site or a top-level domain.
AltaVista, for example, has two syntaxes for this function (host: and domain:), but
Google has only the one.
site:loc.gov
site:thomas.loc.gov
link:
link: returns a list of pages linking to the specified URL. Enter
link:www.google.com and you&#8217;ll be returned a list of pages that link to Google.
Don&#8217;t worry [...]]]></description>
			<content:encoded><![CDATA[<ol>
<li><strong>site</strong>:<br />
site: allows you to narrow your search by either a site or a top-level domain.<br />
AltaVista, for example, has two syntaxes for this function (host: and domain:), but<br />
Google has only the one.<br />
site:loc.gov<br />
site:thomas.loc.gov</li>
<li><strong>link</strong>:<br />
link: returns a list of pages linking to the specified URL. Enter<br />
link:www.google.com and you&#8217;ll be returned a list of pages that link to Google.<br />
<span id="more-67"></span>Don&#8217;t worry about including the http:// bit; you don&#8217;t need it, and, indeed, Google<br />
appears to <a href="http://blog.sherlock-group.com/2008/06/insert-ignore-mysql-query/">ignore</a> it even if you do put it in. link: works just as well with &#8220;deep&#8221;<br />
URLs—http://www.raelity.org/apps/blosxom/ for instance—as with top-level URLs such<br />
as raelity.org.</li>
<li><strong>inurl</strong>:<br />
inurl: restricts your search to the URLs of web pages. This syntax tends to work well<br />
for finding search and help pages, because they tend to be rather regular in composition.<br />
An allinurl: variation finds all the words listed in a URL but doesn&#8217;t mix well with<br />
some other special syntaxes.<br />
inurl:help<br />
allinurl:search help</li>
<li><strong>filetype</strong>:<br />
filetype: searches the suffixes or filename extensions. These are usually, but not<br />
necessarily, different file types. I like to make this distinction, because searching for<br />
filetype:htm and filetype:html will give you different result counts, even<br />
though they&#8217;re the same file type. You can even search for different page generators, such<br />
as ASP, PHP, CGI, and so forth—presuming the site isn&#8217;t hiding them behind redirection<br />
and proxying. Google indexes several different Microsoft formats, including: PowerPoint<br />
(PPT), Excel (XLS), and Word (DOC).<br />
homeschooling filetype:pdf<br />
&#8220;leading economic indicators&#8221; filetype:ppt</li>
</ol>
]]></content:encoded>
			<wfw:commentRss>http://blog.sherlock-group.com/2008/07/the-special-syntaxes-of-google/feed/</wfw:commentRss>
		</item>
		<item>
		<title>What is PageRank?</title>
		<link>http://blog.sherlock-group.com/2008/07/what-is-pagerank/</link>
		<comments>http://blog.sherlock-group.com/2008/07/what-is-pagerank/#comments</comments>
		<pubDate>Fri, 25 Jul 2008 15:34:32 +0000</pubDate>
		<dc:creator>sherlock</dc:creator>
		
		<category><![CDATA[General]]></category>

		<guid isPermaLink="false">http://blog.sherlock-group.com/?p=64</guid>
		<description><![CDATA[PageRank is considers the importance of each page that casts a vote, as votes from some pages are considered to have greater value, thus giving the linked page greater value. We have always taken a pragmatic approach to help improve search quality and create useful products, and our technology uses the collective intelligence of the [...]]]></description>
			<content:encoded><![CDATA[<p>PageRank is considers the importance of each page that casts a vote, as votes from some pages are considered to have greater value, thus giving the linked page greater value. We have always taken a pragmatic approach to help improve search quality and create useful products, and our <a href="http://blog.sherlock-group.com/category/technology/">technology</a> uses the collective intelligence of the web to determine a page&#8217;s importance.</p>
<p><em>from: google.com<br />
Source :: <a href="http://www.smiling-dolphin.com/my_blog/see/90/pagerank/">http://www.smiling-dolphin.com<br />
</a></em></p>
<p>It may look daunting to nonmathematicians, but the PageRank algorithm is in fact elegantly<br />
simple and is calculated as follows:</p>
<p><span id="more-64"></span><a href="http://blog.sherlock-group.com/wp-content/uploads/2008/07/pagerank.jpg"></a></p>
<p><a href="http://blog.sherlock-group.com/2008/07/what-is-pagerank/"><img class="alignnone size-medium wp-image-65" title="pagerank" src="http://blog.sherlock-group.com/wp-content/uploads/2008/07/pagerank-300x39.jpg" alt="" width="300" height="39" /></a></p>
<p>where:<br />
· PR(A) is the PageRank of a page A.<br />
· PR(T1) is the PageRank of a page T1.<br />
· C(T1) is the number of outgoing links from the page T1.<br />
· d is a damping factor in the range 0 &lt; d &lt; 1, usually set to 0.85.<br />
The PageRank of a web page is therefore calculated as a sum of the PageRanks of all pages<br />
linking to it (its incoming links), divided by the number of links on each of those pages (its<br />
outgoing links).<br />
<em> Source ::  Google Hacks</em></p>
]]></content:encoded>
			<wfw:commentRss>http://blog.sherlock-group.com/2008/07/what-is-pagerank/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Five Elements (Wu Xing)</title>
		<link>http://blog.sherlock-group.com/2008/07/five-elements-wu-xing/</link>
		<comments>http://blog.sherlock-group.com/2008/07/five-elements-wu-xing/#comments</comments>
		<pubDate>Sun, 20 Jul 2008 13:34:54 +0000</pubDate>
		<dc:creator>sherlock</dc:creator>
		
		<category><![CDATA[Astronomy]]></category>

		<category><![CDATA[Chinese philosophy]]></category>

		<guid isPermaLink="false">http://blog.sherlock-group.com/?p=61</guid>
		<description><![CDATA[According to Wu Xing theory, the structure of the cosmos mirrors the five elements. Each &#8220;element&#8221; has a complex series of associations with different aspects of nature, as can be seen in the following table. In the ancient Chinese form of geomancy known as Feng Shui practitioners all based their art and system on the [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://blog.sherlock-group.com/2008/07/five-elements-wu-xing/"><img class="alignleft size-medium wp-image-60" style="float: left;" title="five elements" src="http://blog.sherlock-group.com/wp-content/uploads/2008/07/fiveelementscyclebalanceimbalance1.jpg" alt="" width="180" height="175" /></a>According to Wu Xing theory, the structure of the cosmos mirrors the five elements. Each &#8220;element&#8221; has a complex series of associations with different aspects of nature, as can be seen in the following table. In the ancient Chinese form of geomancy known as Feng Shui practitioners all based their art and system on the five elements (Wu Xing). All of these elements are represented within the Bagua. Associated with these elements are colors, seasons and shapes; all of which are interacting with each other.</p>
<p>Based on a particular directional energy flow from one element to the next, the interaction can be expansive, destructive, or exhaustive. With proper knowledge of such aspect of energy flow will enable the Feng Shui practitioner to apply certain cures or rearrangement of energy in a way they believe to be beneficial.</p>
<p><span id="more-61"></span>The elements are:<br />
» metal (Chinese: 金, pinyin: jīn, ) (literal translation meaning &#8220;gold&#8221;)<br />
» wood (Chinese: 木, pinyin: mù)<br />
» water (Chinese: 水, pinyin: shuǐ)<br />
» fire (Chinese: 火, pinyin: huǒ), and<br />
» earth (Chinese: 土, pinyin: tǔ, ).</p>
<table border="1" cellspacing="0" cellpadding="0">
<tbody>
<tr>
<th>Element</th>
<th>Wood</th>
<th>Fire</th>
<th>Earth</th>
<th>Metal</th>
<th>Water</th>
</tr>
<tr>
<th>I Ching</th>
<td>Wood, splinter</td>
<td>Fire, lightning</td>
<td>Earth, sand</td>
<td>Metal, iron</td>
<td>Water, ice</td>
</tr>
<tr>
<th>Trigrams</th>
<td>:|| (☴ 巽 <em>xùn</em>) |:: (☳ 震 <em>zhèn</em>)</td>
<td>|:| (☲ 離 <em>lí</em>)</td>
<td>::: (☷ 坤 <em>kūn</em>) ::| (☶ 艮 <em>gèn</em>)</td>
<td>||| (☰ 乾 <em>qián</em>) ||: (☱ 兌 <em>duì</em>)</td>
<td>:|: (☵ 坎 <em>kǎn</em>)</td>
</tr>
</tbody>
</table>
<p>The doctrine of five phases describes two Cycles of Balance, a generating or creation (生, shēng) cycle and an overcoming or destruction (克/剋, kè) cycle of interactions between the phases.<br />
Generating<br />
The common memory jogs to help remember which order the phases are in are:<br />
» Wood feeds Fire;<br />
» Fire creates Earth (ash);<br />
» Earth bears Metal;<br />
» Metal carries Water (as in a bucket or tap);<br />
» Water nourishes Wood.</p>
<p>Other common words for this cycle include &#8220;begets&#8221;, &#8220;engenders&#8221; and &#8220;mothers&#8221;<br />
Overcoming<br />
» Wood parts Earth;<br />
» Earth absorbs Water;<br />
» Water quenches Fire;<br />
» Fire melts Metal;<br />
» Metal chops Wood.<br />
This cycle might also be called &#8220;controls&#8221;, &#8220;restrains&#8221; or &#8220;fathers&#8221;.<br />
There are also two <strong>Cycles of Imbalance</strong>, an overacting cycle (<em>cheng</em>) and an insulting cycle (<em>wu</em>).</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.sherlock-group.com/2008/07/five-elements-wu-xing/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Detik.com Map - New Format</title>
		<link>http://blog.sherlock-group.com/2008/07/detikcom-map-new-format/</link>
		<comments>http://blog.sherlock-group.com/2008/07/detikcom-map-new-format/#comments</comments>
		<pubDate>Tue, 08 Jul 2008 18:24:19 +0000</pubDate>
		<dc:creator>sherlock</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://blog.sherlock-group.com/?p=52</guid>
		<description><![CDATA[Now detik.com have a new fitur, Map, have u even try it ??
Eg ::
Map of bina nusantara
&#8220;the map&#8221; is only the street, there is no building picture in the map by default, but you can see building picture by click the &#8220;information peta(Direktori)&#8221;. You can dragging on the map.
It have a legend on the right [...]]]></description>
			<content:encoded><![CDATA[<p>Now detik.com have a new fitur, Map, have u even try it ??</p>
<p>Eg ::<br />
Map of <a href="http://map.detik.com/index.php?searchmode=1&amp;city=Jakarta&amp;search=bina+nusantara&amp;btnsubmit=Cari">bina nusantara</a></p>
<p>&#8220;the map&#8221; is only the street, there is no building picture in the map by default, but you can see building picture by click the &#8220;information peta(Direktori)&#8221;. You can dragging on the map.<br />
It have a legend on the right panel, and we can print out the map.</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.sherlock-group.com/2008/07/detikcom-map-new-format/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Having and Where - Mysql Query</title>
		<link>http://blog.sherlock-group.com/2008/07/having-and-where-mysql-query/</link>
		<comments>http://blog.sherlock-group.com/2008/07/having-and-where-mysql-query/#comments</comments>
		<pubDate>Sat, 05 Jul 2008 12:01:55 +0000</pubDate>
		<dc:creator>sherlock</dc:creator>
		
		<category><![CDATA[Programming]]></category>

		<category><![CDATA[Query]]></category>

		<guid isPermaLink="false">http://blog.sherlock-group.com/?p=51</guid>
		<description><![CDATA[&#8220;Having&#8221; clause is like &#8220;Where&#8221; clause, but it use when the query need to refer to aggregate functions,  which the &#8220;WHERE&#8221; clause cannot. 
SELECT user, MAX(salary) FROM users GROUP BY user HAVING MAX(salary);
Don&#8217;t use HAVING for items that should be in the WHERE clause.
For example, do not write this:
SELECT col_name FROM tbl_name HAVING col_name [...]]]></description>
			<content:encoded><![CDATA[<p>&#8220;Having&#8221; clause is like &#8220;Where&#8221; clause, but it use when the query need to refer to aggregate functions,  which the &#8220;WHERE&#8221; clause cannot. </p>
<p>SELECT <em>user</em>, MAX(<em>salary</em>) FROM <em>users</em> GROUP BY <em>user</em> HAVING MAX(<em>salary</em>);</p>
<p>Don&#8217;t use HAVING for items that should be in the WHERE clause.<br />
For example, do not write this:<br />
SELECT <em>col_name</em> FROM <em>tbl_name</em> HAVING <em>col_name</em> &gt; 0;<br />
Write this instead:<br />
SELECT <em>col_name</em> FROM <em>tbl_name</em> WHERE <em>col_name</em> &gt; 0;</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.sherlock-group.com/2008/07/having-and-where-mysql-query/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Improve the percentage of connection bandwidth</title>
		<link>http://blog.sherlock-group.com/2008/07/improve-the-percentage-of-connection-bandwidth/</link>
		<comments>http://blog.sherlock-group.com/2008/07/improve-the-percentage-of-connection-bandwidth/#comments</comments>
		<pubDate>Sat, 05 Jul 2008 11:40:25 +0000</pubDate>
		<dc:creator>sherlock</dc:creator>
		
		<category><![CDATA[Operating System]]></category>

		<category><![CDATA[Windows Xp]]></category>

		<guid isPermaLink="false">http://blog.sherlock-group.com/?p=49</guid>
		<description><![CDATA[1. Start, Run, gpedit.msc, press Enter.
2. Choice Administrative Templates, Network, QoS Packet Scheduler
3. Double click at &#8220;Limit reservable bandwidth&#8221;, set configuration from “not configured” to “Enabled”  and set Bandwidth limit (%) from 20% to 0%.
Explain ::
Determines the percentage of connection bandwidth that the system can reserve. This value limits the combined bandwidth reservations of [...]]]></description>
			<content:encoded><![CDATA[<p>1. Start, Run, gpedit.msc, press Enter.<br />
2. Choice Administrative Templates, Network, QoS Packet Scheduler<span id="more-49"></span><br />
3. Double click at &#8220;Limit reservable bandwidth&#8221;, set configuration from “not configured” to “Enabled”  and set Bandwidth limit (%) from 20% to 0%.</p>
<p>Explain ::<br />
Determines the percentage of connection bandwidth that the system can reserve. This value limits the combined bandwidth reservations of all programs running on the system.<br />
By default, the Packet Scheduler limits the system to 20 percent of the bandwidth of a connection, but you can use this setting to override the default.<br />
If you enable this setting, you can use the &#8220;Bandwidth limit&#8221; box to adjust the amount of bandwidth the system can reserve.<br />
If you disable this setting or do not configure it, the system uses the default value of 20 percent of the connection.</p>
<p>Only work at <a href="http://blog.sherlock-group.com/category/operating-system/windows-xp/">Windows XP</a> Professional</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.sherlock-group.com/2008/07/improve-the-percentage-of-connection-bandwidth/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Windows Xp recovery register</title>
		<link>http://blog.sherlock-group.com/2008/07/windows-xp-recovery-register/</link>
		<comments>http://blog.sherlock-group.com/2008/07/windows-xp-recovery-register/#comments</comments>
		<pubDate>Wed, 02 Jul 2008 01:02:28 +0000</pubDate>
		<dc:creator>sherlock</dc:creator>
		
		<category><![CDATA[Operating System]]></category>

		<category><![CDATA[Windows Xp]]></category>

		<guid isPermaLink="false">http://blog.sherlock-group.com/?p=43</guid>
		<description><![CDATA[winsockxpfix
 download for fix your registry :: Windows XP
]]></description>
			<content:encoded><![CDATA[<p><a href="http://blog.sherlock-group.com/wp-content/uploads/2008/07/winsockxpfix.rar">winsockxpfix<br />
</a> download for fix your registry :: <a href="http://blog.sherlock-group.com/category/operating-system/windows-xp/">Windows XP</a></p>
]]></content:encoded>
			<wfw:commentRss>http://blog.sherlock-group.com/2008/07/windows-xp-recovery-register/feed/</wfw:commentRss>
		</item>
	</channel>
</rss>
