索引的

According to the data's division and organization, multidimensional data indexes can be divided to two classes: indexes based on space, indexes base on data .

根据数据的划分组织方式，多维索引结构分为两大类：基于空间划分的索引结构和基于数据划分的索引结构。

Google Web search team infrastructure software engineers Ye Xie Er Bote and尼森哈扎伊 said:"Of course, we do not index these pages 1 trillion in each of a page Because a lot of similar content pages, or automatically generated content, users do not have much value, but we have such a huge volume of the index are proud that our goal is to index the world's data."

谷歌Web搜索基础设施小组软件工程师耶西。阿尔波特和尼森。哈扎伊称："当然，我们不会索引这1万亿幅页面中的每一幅页面，因为很多页面内容相近，或是自动生成内容，对于用户没有太大价值。但是，我们为拥有如此巨大的索引量而感到自豪，我们的目标就是要索引全世界的数据。"

Then, the index corresponding to the closest codevector is transmitted to the decoder. Due to the spatial correlation of an image block, the VQ index for a block is highly related to those of its adjacent blocks. If we can remove the kind of redundancy, the bitrate required for coding the VQ indexes can be reduced.

由於影像方块间具有空间相关联性，因此每个方块的索引值与其邻近四周方块的索引值间存在极高的相关联性，假如我们能移除这些关联性累赘，则编码向量量化索引值所需的位元率将可大为减少。

First, we discuss the classification of existing spatial indexing methods and point out the problems of them. Second, the approximate representation of spatial objects is given. Third, the structure and the algorithm of CP tree, which based...

本文首先介绍了目前常用的几类空间索引技术及其特点，接着讨论了面向地理信息的空间索引技术面临的基本问题，提出了基于凸多边形的空间索引结构—— CP-树，并侧重分析了其空间运算算法及时空效率，最后指出了空间索引技术所存在的问题及下一步的研究方向。

Coordinate sequence method is made up of the instruct information of polygon boundary x, y coordinate. It is the easiest polygon vector encoding method. The file structure of this method is easy, but because of the polygon boundary has stored two times, it will produce data redundancy, moreover, short of neighbor threshold information; Tree index encoding method make all the boundary points digitizing, store the coordinate sequence, connect the point index to boundary line, and then connect the line index to other polygons, so as to the tree index structure has came into being. It eliminates neighbor polygons boundary data redundancy problems; Topology structure encoding method is a method which by setting up a complete topology relationship structure, resolve the neighbor threshold and island information process problem. However, it makes arithmetic more complicated and makes database bigger.

坐标序列法是由多边形边界的x，y坐标对集合及说明信息组成，是最简单的一种多边形矢量编码法，文件结构简单，但多边形边界被存储两次产生数据冗余，而且缺少邻域信息；树状索引编码法是将所有边界点进行数字化，顺序存储坐标对，由点索引与边界线号相联系，以线索引与各多边形相联系，形成树状索引结构，消除了相邻多边形边界数据冗余问题；拓扑结构编码法是通过建立一个完整的拓扑关系结构，彻底解决邻域和岛状信息处理问题的方法，但增加了算法的复杂性和数据库的大小。

When should searching engine spider to get when requesting a certain URL 404 condition are responded to, know this URL namely already invalidation, index no longer this webpage, feedback to delete this URL denotive webpage from inside index database to data center, of course, delete a process to need for a long time likely, and when should searching engine to get 200 condition are responded to, can think this Url is effective, can index, can collect its index database, such result is these two different Url have identical content: Define the content of 404 wrong pages oneself, this meeting is brought about appear duplicate webpage problem.

当搜索引擎蜘蛛在请求某个URL时得到404状态回应时，即知道该URL已经失效，便不再索引该网页，并向数据中心反馈将该URL表示的网页从索引数据库中删除，当然，删除过程有可能需要很长时间，而当搜索引擎得到200状态回应时，则会认为该url是有效的，便会去索引，并会将其收录到索引数据库，这样的结果便是这两个不同的url具有完全相同的内容：自定义404错误页面的内容，这会导致出现复制网页问题。

Based on fractal coding the index file have two characters: First, similar images have similar iterative function so as to produce similar index file, and the similar index file can retrieval the similar image; Second, unsimilar images have unsimilar iterative function, vice versa.

这个分形编码方法建立的索引文件具有三个性质：(1)相似图像有相似分形函数能产生相似索引文件，相似索引文件能检索到相似图像；(2)不相似图像有不相似分形函数，反之亦然。

The spatial data index betakes the spatial data structure based on the improved R-Tree structure, and the property index uses the B+ tree data structure.

空间数据索引采用基于改进R-Tree的空间数据索引结构，属性数据索引采用B~+树数据结构。

The index plates available with the Brown and Sharpe milling machines are Plate no.1: 15, 16, 17,18,19,20 holes The index plate used on Cincinnati and Parkinson dividing heads is Plate 1: Side 1 4,25,28,30,34,37,38,39,41,42 and 43 holes It is also possible to get additional plates from Cincinnati to increase the indexing capability a follows: Plate 2: Side 1 4,46,79,93,109,123,139,153,167,181,197 holes Plate 3: Side 1 26,42,73,87,103,119,133,149,161,175,191 holes

The索引板材可利用对布朗和Sharpe铣床是 Plate no.1 ： 15， 16， 17，18，19，20个孔 The在辛辛那提和帕金森分度头使用的索引板材是 Plate 1 ：一面4，25，28，30，34，37，38，39，41，42个和43个孔 It也是可能从辛辛那提得到另外的板材增加索引能力a跟随： Plate 2 ：一面4，46，79，93，109，123，139，153，167，181，197个孔 Plate 3 ：一面26，42，73，87，103，119，133，149，161，175，191个孔

First-generation search engine (1994 ~ 1995) in the amount of indexed pages are generally several orders of magnitude of about one million, using full-text search technology, and distributed parallel computing technology, but little re-collection of the page and go to refresh the index, the index is generally less at 1,000,000 pages, and its retrieval slower and generally have to wait for 10 seconds or longer, while absorbing the search request has also been very limited business model at the exploratory phase and not yet been born.

第一代搜索引擎(1994年～1995年)的索引网页量一般都在数百万量级左右，采用全文检索技术和分布式并行运算技术，但极少重新搜集网页并去刷新索引，一般都索引少于1，000，000个网页，而且其检索速度较慢，一般都要等待10秒甚至更长的时间，同时承受的检索请求也受到很大限制，商业模式处于探索期并且尚未成型。

On the other hand, the more important thing is because the urban housing is a kind of heterogeneity products.

另一方面，更重要的是由于城市住房是一种异质性产品。

Climate histogram is the fall that collects place measure calm value, cent serves as cross axle for a few equal interval, the area that the frequency that the value appears according to place is accumulated and becomes will be determined inside each interval, discharge the graph that rise with post, also be called histogram.

气候直方图是将所收集的降水量测定值，分为几个相等的区间作为横轴，并将各区间内所测定值依所出现的次数累积而成的面积，用柱子排起来的图形，也叫做柱状图。