A new spatial index structure for GIS data

3rd International Conference on Multimedia and Ubiquitous Engineering, MUE 2009

Volumn , Issue , 2009, Pages 471-476

  Wu, Xiaoqian ^a   Zang, Chuanqin ^b  

^a Department of Research and Development   (China)

^b RESEARCH INSTITUTE OF CHEMICAL DEFENSE   (China)

Author keywords

GIS; Multidimensional data; Spatial access method; Spatial index

Indexed keywords

DAILY LIVES; DATABASE TECHNOLOGY; GIS DATA; HIGH EFFICIENCY; INDEX STRUCTURE; KEY COMPONENT; MULTIDIMENSIONAL DATA; NEW INDICES; R-TREE INDEX STRUCTURE; SPATIAL ACCESS METHODS; SPATIAL DATA; SPATIAL DATABASE; SPATIAL INDEX STRUCTURE; SPATIAL INDICES;

DATABASE SYSTEMS; DECISION TREES; GEOGRAPHIC INFORMATION SYSTEMS; MULTIMEDIA SYSTEMS;

DATA HANDLING;

EID: 72849116176     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MUE.2009.83     Document Type: Conference Paper

References (34)

1. Bentley J. L., Multidimensional binary search trees used for associative searching [J]. Commun. ACM, 1975, 18(9): 509-517.
2. Fuchs H., Kedem Z., Naylor B., On visible surface generation by a priori tree structures [J]. Computer Graph., 1980, 14(3): 124-133.
3. Ohsawa Y., Sakauchi M., BD-tree: A new n-dimensional data structure with efficient dynamic characteristics [A]. In Proceedings of the Ninth World Computer Congress, 1983: 539-544.
4. Finkel R., Bentley J. L., Quadtrees: A data structure for retrieval of composite keys [J]. Acta Inf., 1974, 4(1): 1-9.
5. Samet H., The quadtree and related hierarchical data structure [J]. ACM Comput. Surv., 1984, 16(2): 187-260.
6. Nievergelt J., Hinterberger H., Sevcik K., The grid file: An adaptable, symmetric multikey file structure [A]. In Proceedings of the Third ECI Conference, Duijvestijn and Lockemann, Eds., LNCS 123, Springer-Verlag, 1981: 236-251.
7. Robinson J. T., The K-D-B-tree: A search structure for largemultidimen sional dynamic indexes [A]. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1981: 10-18.
8. Freeston M., The BANG file: A new kind of grid file [A]. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1987: 260-269.
9. Henrich A., Six H.-W., Widmayer P., The LSD tree: Spatial access to multidimensional point and non-point objects [A]. In Proceedings of the Fifteenth International Conference on Very Large Data Bases, 1989: 45-53.
10. Seeger B., Kriegel H.-P., The buddy-tree: An efficient and robust access method for spatial data base systems [A]. In Proceedings of the Sixteenth International Conference on Very Large Data Bases, 1990: 590-601.
11. Freeston M., A general solution of the n-dimensional B-tree problem [A]. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1995: 80-91.
12. Guttman A., R-trees: A dynamic index structure for spatial searching [A]. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1984: 47-54.
13. *-tree: An efficient and robust access method for points and rectangles [A]. In Proceedings of ACM SIGMOD International Conference on Management of Data, 1990: 322-331.
14. Sellis T., Roussopoulos N., Faloutsos C., The R+-tree: A dynamic index for multi-dimensional objects [A]. In Proceedings of the Thirteenth International Conference on Very Large Data Bases, 1987: 507-518.
15. Berchtold S., Keim D., Kriegel H.-P., The X-tree: An index structure for high-dimensional data [A]. In Proceedings of the 22nd International Conference on Very Large Data Bases, 1996: 28-39.
16. Matsuyama T., Hao L. V., Nagao M., A file organization for geographic information systems based on spatial proximity [J]. Int. J. Comput. Vis. Graph. Image Process., 1984, 26(3): 303-318.
17. Ooi B. C., Mcdonell K. J., Sacks-Davis R., Spatial kd-tree: An indexing mechanism for spatial databases [A]. In Proceedings of the IEEE Computer Software and Applications Conference, 1987: 433-438.
18. Ohsawa Y., Sakauchi M., A new tree type data structure with homogeneous node suitable for a very large spatial database [A]. In Proceedings of the Sixth IEEE International Conference on Data Engineering, 1990: 296-303.
19. Kamel I., Faloutsos C., Hilbert R-tree: An improved R-tree using fractals [A]. In Proceedings of the Twentieth International Conference on Very Large Data Bases, 1994: 500-509.
20. Leutenegger S. T., Edgington J., Lopez M. A., STR-A Simple and Efficient Algorithm for R-tree Packing [A]. The 13th IEEE ICDE Conference, Birmingham, England, 1997: 497-506.
21. Faloutsos C., Sellis T., Roussopoulos N., Analysis of object-oriented spatial access methods [A]. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1987: 426-439.
22. Kamel I., Faloutsos C., On packing R-trees [A]. In Proceedings of the Second International Conference on Information and Knowledge Management, 1993: 490-499.
23. Pagel B. U., Six H.-W., Toben H., Widmayer P., Towards an analysis of range query performance in spatial data structures [A]. In Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993: 214-221.
24. Leutenegger S. T., Lopez M. A., The Effect of Buffering on the Performance of R-Trees [J], IEEE Transactions on knowledge and data engineering, 2000: 33-44.
25. Theodoridis Y., Stefanakis E., Sellis T., Efficient Cost Models for Spatial Queries Using R-Trees [J]. IEEE Transactions on knowledge and data engineering, 2000, 12(1): 19-32.
26. Weber R., Schek H.-J., Blott S., A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces [A]. In Proceedings of the 24th International Conference on Very Large Data Bases, 1998: 194-205.
27. Berchtold S., Böhm C., Jagadish H. V., Kriegel H.-P., Sander J., Independent quantization: An index compression technique for high-dimensional data spaces [A]. In Proceedings of the 16th International Conference on Data Engineering, 2000: 577-588.
28. Lin K.-I., Jagadish H., Faloutsos C., The TV-tree: An index structure for high-dimensional data [J]. VLDB J., 1994, 3(4): 517-543.
29. Hjaltason G. R., Samet H., Ranking in spatial databases [A]. In Proceedings of the Fourth International Symposium on Advances in Spatial Databases, 1995: 83-95.
30. Theodoridis Y., Sellis T. K., A model for the prediction of R-tree performance [A]. In Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1996: 161-171.
31. Hungyi L., Powhei H., KuanghuaA H., A new indexing method with high storage utilization and retrieval efficiency for large spatial databases [J]. Information and Software Technology, 2007, 49: 817-826.
32. Rui L., Bir B., Chinya R., Michael K., Jinfeng N., Uncertain spatial data handling: Modeling, indexing and query [J]. Computers & Geosciences, 2007, 33: 42-61.
33. Bernard C., Ding L., Avner M., Approximate range searching in higher dimension [J]. Computational Geometry, 2008, 39: 24-29.
34. *-Trees with Arbitrary Node Extents [J]. IEEE Transactions on knowledge and data engineering, 2004, 16: 653-668.