ndbc 2012 报告 - 计算机学会数据库专业会.pptVIP

三句格言（1） 科学上没有平坦的大道，真理长河中有无数礁石险滩。只有不畏攀登的采药者，只有不怕巨浪的弄潮儿，才能登上高峰采得仙草，深入水底觅得骊珠。 三句格言（2） 当官的道路红彤彤 经商的道路黄灿灿 学术的道路黑洞洞 三句格言（3） 不要努力成为一个成功者，要努力成为一个有价值的人。? 克服英语论文语言障碍 多读相关的论文进行学习和揣摩 Abstract 部分的优秀句子举例（1） 开门见山，直接说本文的主要内容：We study the problem of processing subgraph queries on a database that consists of a set of graphs. The answer to a subgraph query is the set of graphs in the database that are supergraphs of the query. In this article, we propose an efficient index, FG*-index, to solve this problem. 说本文的主要内容和研究问题的重要性This paper investigates the problem of efficiently computing the confidences of distinct tuples? in the answers to conjunctive queries with inequalities () on tuple-independent probabilistic databases. This problem is fundamental to probabilistic dabases and was recetly stated open. 经常说某些工作是第一个工作This is the first work that reasons about keyword search strategies from a formal perspective. 说试验结果方面的改善 Our experimental results show that this reformulation of non-inner joins as complex predicates can improve optimization time by orders of magnitude, compared to known algorithms dealing with complex join predicates and non-inner joins. once again, this gives dynamic programming a distinct advantage over current memoization technqiues. Abstract 部分的优秀句子举例（2） 说新方法的额外开销很小We also show through complexity and performance analysis that the structural signature scheme is efficient; with respect to the Merkle hash signature, it incurs comparable cost for signing the trees and incurs lower cost for user-side integrity verification.说已有的研究很多，但是还没有满足某个条件的：Nearest neighbour (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational database, and (ii) its query cost should grow sub-linearly with the dataset size