专业英语翻译.doc

姓名; 王光华( 2011310687 ) 第三组 . Indexing 索引 An indexing scheme allows to have an anization of data for quick retrieval in large databases. Most of the solutions presented involve a dimensionality reduction in order to index this representation using a spatial access method. Several studies suggest that the various representations differ but slightly in terms of indexing power [Keogh and Kasetty 2003]. 大型数据库中的高效的组织索引方案允许数据的快速检索。提出的大多数解决方案涉及使用空间的访问方法, 以一个降维索引此表示。一些研究表明, 不同的表述, 但略有不同的索引能力方面[ Keogh and Kasetty 2003 ] 。(页下角的 puting Surveys, Vol. 45, No. 1, Article 12, Publication date: November 2012 ) ACM 计算调查,卷 45 ,1 号,第 12 ,出版日期: Time-Series Data Mining 时间序列数据挖掘 12:21 Table I. Comparison of the Distance Measures surveyed in This Article with the of Robustness 比较距离的措施调查在本文的鲁棒性。表此处省掉 Each distance measure is thus distinguished as scale (amplitude), warp (time), noise or outliers robust. The next column shows whether the proposed distance is a metric. The cost is given asa simplified factor plexity. The last column gives the minimum number of parameters setting required by the distance measure [Keogh and Kasetty 2003]. 因此, 每个距离测度作为区分量表( 振幅),经( 时间), 噪声或离群强劲。下一列显示建议的距离是否是一个度量。成本给出的计算复杂性的简化因子。最后一列给出了距离测量[ 基奥和 2003 Kasetty] 所需的参数设置的最小数目。 However, wider differences arise concerning the quality of results and the speed of querying. There are two main issues when designing an indexing scheme