A data integration index-hiberarchy index tree based on urbanization integration system

Urban information is a kind of multi-sources data, and the variety of these data demands that we should set up an information system. One of the major tasks is to store massive spatial data and non-spatial data and manage these data effectively. One of the other major tasks of urbanization integration is how to search for spatial data and non-spatial data what we need into massive information, so we need to establish indexes for spatial data and non-spatial data and construct the relation between the two kinds of data in order to convenient query. The paper is focused on data indexes construction, classified indexes for non-spatial data, R-trees index for spatial data and puts forward an area hiberarchy index tree to build up direct relationship between spatial data and non-spatial data for seamless queries, and the experiment shows that the hiberarchy index tree is much validated and something useful is obtained.

[1]  W. Mackaness,et al.  The application of agents in automated map generalization , 1999 .

[2]  Robert Weibel,et al.  Computational Perspectives on Map Generalization , 1998, GeoInformatica.

[3]  Mario A. López,et al.  STR: a simple and efficient algorithm for R-tree packing , 1997, Proceedings 13th International Conference on Data Engineering.

[4]  Christos Faloutsos,et al.  The TV-tree: An index structure for high-dimensional data , 1994, The VLDB Journal.

[5]  Hans-Peter Kriegel,et al.  Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space , 2000, IEEE Trans. Knowl. Data Eng..

[6]  Robert Weibel,et al.  Map Generalization for On-demand Web Mapping , 2000 .

[7]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[8]  Mario A. López,et al.  A greedy algorithm for bulk loading R-trees , 1998, GIS '98.

[9]  Peter Dadam.  Verteilte Datenbanken und Client/Server-Systeme - Grundlagen, Konzepte und Realisierungsformen , 1996 .

[10]  Hans-Peter Kriegel,et al.  A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems , 1993, SSD.

[11]  Monika Sester,et al.  Linking Objects of Different Spatial Data Sets by Integration and Aggregation , 1998, GeoInformatica.

[12]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[13]  Beng Chin Ooi,et al.  Indexing the Distance: An Efficient Method to KNN Processing , 2001, VLDB.

[14]  Shin'ichi Satoh,et al.  The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.

[15]  Ramesh C. Jain,et al.  Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[16]  Kothuri Venkata Ravi Kanth,et al.  Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data , 2002, SIGMOD '02.

[17]  Hans-Peter Kriegel,et al.  The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.

[18]  Divyakant Agrawal,et al.  Approximate nearest neighbor searching in multimedia databases , 2001, Proceedings 17th International Conference on Data Engineering.

[19]  Hanan Samet,et al.  Recent developments in linear quadtree-based geographic information systems , 1987, Image Vis. Comput..

[20]  David B. Lomet,et al.  The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.