刚刚没头没脑得忙了一阵，抽空上来转转。2007 年的生日就快过去，没有任何节目，和平常没有任何分别，可能唯一的不同就是今天第一次上通宵 night shift。说来也奇怪，开始还有点小兴奋，很早就赶到公司来了，可能第一次上比较新鲜吧，不过熬到现在的确有点累了。今天一大早就起来开始忙活了，下午想补个觉，却一直无法睡着，处于假寐状态。不过现在倒也不觉得困，只是头有点晕。现在的身体状态真的越来越差了，老是觉得疲惫，真的老了，这不又不知不觉地老了一岁。刚看到新闻，侯耀文同志就这样不知不觉地去了，不知道俺啥时候也就这样，平平淡淡地去了……

I was reading Pete Finnigans blog this morning and ran across "a rant".

A rant I very much can relate to.

One that I myself experience from time to time.

Read this - and especially the last paragraph.

Note to Pete - if this is the first time someone has every written to you in this fashion - you are very lucky :)  I love it when they use sarcasm in "thanking you" as this individual did.

©作者：Fenng 发布在 dbanotes.net

周云蓬的那首《中国孩子》因为最近的一系列事件而被纷纷引用。明天就有机会去现场听这位传奇盲歌手演唱啦。其实他比多数人都看得清楚。

时间：2007 年 6 月 24 日晚 21 点
地点：杭州.旅行者酒吧 (西湖区曙光路 176 号)
演出乐队：周云蓬
票价：30元

演出信息来自: 生活在现场

--EOF--

相关文章|Related Articles

评论数量(1)|Add Comments

本文网址：http://www.dbanotes.net/mylife/china_boys.html

Quest Recursive SQL Transformation technology is an innovative AI technology that simulates human SQL transformation technique. It incorporates a set of transformation rules to transform SQL statements on a section-by-section basis. This replaces the trial and error method used by human to rewrite the syntax of a SQL statement. Each transformation rule in the optimization engine is independent from one another, like a capsule; the rule’s capsule can only be opened when all necessary conditions are satisfied (see figure 6). This guarantees the semantic equivalence of the rewritten SQL statements so that they produce the same results as the original SQL. When a SQL statement is transformed by one rule to produce a new SQL syntax, the new syntax may now satisfy the requirements of another rule, hence transformation action is carried out in a recursive manner (see figure 7).

  Figure 6: Recursive Transformation Engine             Figure 7: Chain Effect of SQL Transformation(Insert Image)

Let’s take a look at the following SQL statement and use two of the built-in transformation rules to see how this Recursive Transformation works. We will use one rule which transforms the IN condition to an EXISTS condition and than use another rule that does the reverse, changing the EXISTS condition to an IN condition. We will illustrate this with the following SQL statement.

The first two levels of transformation are shown in the left side of figure 8. SQL statements with syntax different from the original can be produced by following a set of transformation rules. You can see that for each rule applied to the SQL statement, the newly transformed SQL will satisfy another rule. And the order in which the rules are processed can result in different SQL alternatives. In this example, the source SQL has gone through two transformation rules executed in a recursive manner. If we do not stop the recursive transformation, the loop will continue infinitely. A total of 4 unique SQL statements (marked by the solid boxes in Figure 8) are generated by the two transformation rules. If each of these SQL statements ends up with a new execution plan, we potentially have three SQL statements that may give us different performance that can be used as a benchmark to the original SQL statement.

 
Figure 8: A SQL statement being transformed by two recursive transformation rules

Actually, implementing a transformation rule requires a more complicated control than it is shown in this illustration. For example, Quest SQL Optimizer has to check whether a set operator (UNION, MINUS, or INTERSECT) is in a sub-query, whether multiple items are in the SELECT list, and etc…. But the beauty of those rules is that they are self-protected, which means that the transformation and conditional checking are encapsulated into a one rule-capsule to prevent generating incorrect SQL statements (SQL statements that do not produce the same result as the original SQL). In our Recursive Transformation Engine, we have a multitude of transformation rules which can handle very complicated situations. The result of the recursive transformation for a complex SQL statement may exceed what you can imagine. For example, some transformation rules can be applied endlessly to transform a SQL statement to another semantically equivalent statement without limitation, so quotas must be used to control the number of SQL alternatives that are generated. 

Today, with our Recursive SQL Transformation Engine, you can explore ultimate potential that a database SQL optimizer can give to speedup your SQL statements.

©作者：Fenng 发布在 dbanotes.net

前天晚上从上海坐火车回来，晕车了。一行三个人的座位号来去居然是一样的(我们是到上海才买的回程票)，都在最后面。上车就感觉有些不对劲儿，胃不舒服。一路上大部分时间都是趴着，也没睡着。我斜后方有位腐败干部模样的人呼噜打的山响，呼噜呼噜的更让我恶心了，结果还差五分钟到站的时候就吐了，一个呕吐袋都没够。唉，这个难受啊。

晕车是我的老毛病了，小时候更为严重一些，从小到大没少遭罪，上小学的时候还差点出事。也用过不下几十个秘方，几乎都不管用。近乎医学的说法是"与耳中有平衡功能的前庭器官运动感应神经有关"，准确的说，我是"晕动症"，汽车晕，火车晕，船也晕，飞机更晕，做马车也晕，在人群中，人头晃动，也晕，当然，骑自行车不晕。

每次晕车都要几天才能缓过精神来。

前两天出去 Outing ，提前吃了一片晕车药，倒是反应不是很激烈。这一类的药物基本上是刺激神经的，副作用似乎很大。"饮鸩止渴"

--EOF--

相关文章|Related Articles

• 仙居漂流
• 看图挑错
• 三步杀人曲
• 又到六一儿童节

评论数量(7)|Add Comments

本文网址：http://www.dbanotes.net/mylife/train_sickness.html

You might have seen Havoc (and, yes, that’s his real name) on the pages of Red Hat Magazine, last year or long before that. You can usually catch up with him–and the rest of the emerging technologies engineers–at the Red Hat Summit.

We cornered him in San Diego this past May after his Summit presentation to see just what he had been working on.

When you’re done, sign up for Mugshot’s Red Hat Magazine group. We’d love to have you.

Yes, Log Buffer turns 50 today, as Elisa Gabbert publishes the big five-oh on Eye on Oracle. The big DBA-blog conversation does not stop. Read Log Buffer’s homepage and get in touch to edit and publish one yourself. Thanks to all of Log Buffer’s editor/publishers and all its readers for making it such a success. [...]

PersonalBrain软件能够像你一样“思考”，它还能帮你搭建出一张独特的思维“蜘蛛网”。