2007-06-24 Sun
曾经在公司的内网上,看到一个写杨梅虫的帖子,他们把杨梅浸泡在谈盐水中,那些杨梅虫就会慢慢的爬出来。那个发帖的人还用特写镜头拍了杨梅虫的样子,因为我生平怕那种肉乎乎的小虫,从此之后,我对杨梅一直心存芥蒂,不敢多吃。
但是,这个周末,老婆受同一个小区的朋友的邀请,一起去慈溪摘杨梅,我们两辆车,还在有些梅雨的天气中就出发了。路上的时候,雨还是时下时停的,但是到达目的地——慈溪大山杨梅园的时候,天气竟然出奇的好了起来。
大山杨梅园在一个山窝窝里面,不过山路还算良好,我们在最后的一段路上,也是一直问过去的,还好的是,终于是找到了。不过可惜的是,今年的杨梅比往年要早一个星期左右,我们过去的时候,树上的杨梅已经不多了,算是赶了一个晚场。
找到了我们在网上联系的当地农户,就开始上山采吃了,每个人20元,可以随意吃,可为难了我这个对杨梅心存恐惧的人。不过,看到很多在那里边摘边吃的人,心想,反正吃不死,虫也是肉,吃吧,否则浪费了这20元钱啊。
不过,我还是问了问旁边一个正在吃杨梅的MM,“听说杨梅有虫的,是不是啊”,那MM很轻松的回答,“是的,有虫的,不过,高蛋白,还美容养颜呢”。我晕,既然MM都不怕,那就放心吃吧。
吃完下山,又买了两篮,这个时候,也正好看到一条杨梅虫在杨梅上爬来爬去,第一次真正看到这个东西,居然那么大,有6-7毫米长,当时我就差点倒了。不过,既然已经吃了,可能还吃了很多条下去了,你总不能吐出来吧,就当人家MM说的那样,高蛋白,美容养颜去吧。
2007-06-23 Sat
刚刚没头没脑得忙了一阵,抽空上来转转。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
评论数量(2)|Add Comments
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.
2007-06-22 Fri
AnySQL.net
DBA notes
Oracle & Starcraft
eagle's home
Oraus.net
AnySQL.net English
Oracle Scratchpad
Oracle Life
OracleDBA Blog
Photos from dbanotes
Chanel [K]
xzh2000的博客
Oracle Security Blog
ERN空间
Eddie Awad's Blog
MySQL Performance Blog
The Tom Kyte Blog
del.icio.us/fenng/oracle
AIXpert
O'Reilly Databases
Red Hat Magazine
DBASupport
DB2 Magazine 中文版
developerWorks : AIX 专区的文章,教程
Pythian Group Blog
车东[Blog^2]
blue_prince
玉面飞龙的BLOG
此生 今世
人生就是如此
Orange Tiger 木匠 的 web log
生活帮-LifeBang
Fenng's shared items in Google Reader
Hey!! Sky!
jametong's shared items in Google Reader
dba on unix
Oracle Notes Wiki
Welcome to brotherxiao's Home