Choosing R-Tree Or Quadtree Spatial Dataindexing In One Oracle Spatial Database System To Make Faster Showing Geographical Map In Mobile Geographical Information System Technology

{"references": ["Rajinder, S. N. (2004). Cartographic visualisation for mobile\napplication. Master-s thesis, ITC/IIRS.", "Peng, Z. R. &amp; Tsou, M. H. (2003). Internet GIS: Distributed Geographic\nInformation Services for the Internet and Wireless Network. John Wiley\nand Sons Inc.", "Mensah, E. (2007). Designing a Prototype Mobile GIS to Support\nCadastral Data Collection in Ghana, 44.", "Vckovski, A. (1999). Interoperability and spacial information theory.\nInteroperating Geographic Information Systems.", "Kraak, M. J. (2002). Current trends in visualisation of geographic data\nwith special reference to cartography. Invited paper: In Proceedings of\nthe XXIIth INCA Congress 2002, Indian National Cartographic\nAssociation: Convergence of Imagery Information and Maps, volume\n22, 319-324.", "Chen, K., &amp; Shi, W. (2002), A Study of Dynamic Database in Mobile\nGIS.", "Guttman, A. (1984). R-Trees: A Dynamic Index Structure for Spatial\nSearching. Proc. 1984 ACM SIGMOD International Conference on\nManagement of Data, pp. 47-57. ISBN 0-89791-128-8.", "Zhu, Q., Gong, J., Zhang, J. (2007). An efficient 3D R-tree spatial index\nmethod for virtual geographic environments. ISPRS Journal of\nPhotogrammetry and Remote Sensing, Volume 62, Issue 3, August\n2007, pp 217-224.", "Lee, T., Moon, B., Lee, S. (2006). Bulk insertion for R-trees by seeded\nclustering. Data &amp; Knowledge Engineering, Volume 59, Issue 1,\nOctober 2006, pp 86-106.\n[10] Lee, M. L., Hsu, W., Jensen, C. S., Cui, B., Teo, K. L. (2003).\nSupporting Frequent Updates in R-Trees: A Bottom-Up Approach.\nProceedings 2003 VLDB Conference, 2003, pp 608-619.\n[11] An, N., Kothuri, R. K. V., Ravada, S. (2003). Improving Performance\nwith Bulk-Inserts in Oracle R-Trees. Proceedings 2003 VLDB\nConference, 2003, pp 948-951.\n[12] Chan, E. P. F., &amp; Chow, K. K. W. (2002). On multi-scale display of\ngeometric objects. Data &amp; Knowledge Engineering, Volume 40, Issue 1,\nJanuary 2002, pp 91-119.\n[13] Yun, J. K., Kim, D. O., Hong, D. S., Kim, M. H., Han, K.J. (2006). A\nreal-time mobile GIS based on the HBR-tree next term for location\nbased services. Computers &amp; Industrial Engineering, Volume 51, Issue\n1, September 2006, pp 58-71.\n[14] Francis, D. H., Madria, S., Sabharwal, C. (2008). A scalable constraintbased\nQ-hash indexing for moving objects. Information Sciences,\nVolume 178, Issue 6, 15 March 2008, pp 1442-1460.\n[15] Liu, C. M., &amp; Fu, S. Y. (2008). Effective protocols for kNN search on\nbroadcast multi-dimensional index trees. Information Systems, Volume\n33, Issue 1, March 2008, pp 18-35.\n[16] Finkel, R., &amp; Bentley, J. L. (1974). Quad Trees: A Data Structure for\nRetrieval on Composite Keys. Acta Informatica 4 (1): 1-9.\n[17] Oracle Spatial 10g White Paper (2006). Oracle Spatial Quadtree\nIndexing, 10g Release 1 (10.1).\n[18] Chang, C. Y., Maciejewski, A. A., Balakrishnan, V., Roberts, R. G.,\nSaitwal, K. (2006). Quadtree-based eigen decomposition for pose\nestimation in the presence of occlusion and background clutter.\n[19] Geller, S., Talke, J., Krafczyk, M. (2007). Lattice-Boltzmann Method on\nQuadtree-Type Grids for Fluid Structure Interaction. Fluid-Structure\nInteraction, 270-293.\n[20] Tzouramanis, T., Vassilakopoulos, M., Manolopoulos, Y. (2000).\nMultiversion Linear Quadtree for Spatio-Temporal Data. Current Issues\nin Databases and Information Systems, 279-292.\n[21] Zhang, L. &amp; Xi, L. F. (2007). A Novel Fractal Image Coding Based on\nQuadtree Partition of the Adaptive Threshold Value. Theoretical\nAdvances and Applications of Fuzzy Logic and Soft Computing, 504-\n512.\n[22] Varas, J. (2007). Mobile Robot Path Planning Among Weighted Regions\nUsing Quadtree Representations. Computer Aided Systems Theory -\nEUROCAST\u251c\u00f3\u00d4\u00e9\u00bc\u212299, 239-249.\n[23] Cheng, S. W. &amp; Lee, K. H. (2008). Quadtree Decomposition, Steiner\nTriangulation, and Ray Shooting. Algorithms and Computation, 368-\n377.\n[24] Grbovic, J. P., Fagg, G. E., Angskun, T., Bosilca, G., Dongarra, J. J.\n(2006). MPI Collective Algorithm Selection and Quadtree Encoding.\nRecent Advances in Parallel Virtual Machine and Message Passing\nInterface, 40-48.\n[25] Varas, J. (2007). Mobile Robot Path Planning Among Weighted Regions\nUsing Quadtree Representations. Computer Aided Systems Theory -\nEUROCAST\u251c\u00f3\u00d4\u00e9\u00bc\u212299, 239-249.\n[26] Mir, Z. H. &amp; Ko, Y. B. (2006). A Quadtree-Based Data Dissemination\nProtocol for Wireless Sensor Networks with Mobile Sinks. Personal\nWireless Communications, 447-458.\n[27] Samet, R. &amp; Ozsavas, E. (2007). Optimization of Quadtree\nTriangulation for Terrain Models. Advanced Concepts for Intelligent\nVision Systems, 48-59.\n[28] Mir, Z. H. &amp; Ko, Y. B. (2007). A quadtree-based hierarchical data\ndissemination for mobile sensor networks. Telecommunication\nSystems, 117-128.\n[29] Reza, A. W., Eswaran, C., Hati, S. (2007). Diabetic Retinopathy: A\nQuadtree Based Blood Vessel Detection Algorithm Using RGB\nComponents in Fundus Images. Journal of Medical Systems, 147-155.\n[30] Tanin, E., Harwood, A., Samet, H. (2006). Using a distributed quadtree\nindex in peer-to-peer networks. The VLDB Journal, The International\nJournal on Very Large Data Bases, 165-178.\n[31] H. Samet (1989). The design and analysis of spatial data structures.\nAddison-Wesley Publishing Co..\n[32] A. Guttman (1984). R-trees: A dynamic index structure for spatial\nsearching. Proc. A CM SIGMOD Int. Conf. on Management of Data,\npages 47-57.\n[33] T. Sellis, N. Roussopoulos, and C. Faloutsos (1988). The r+-tree: A\ndynamic index for multi-dimensional objects. Procdf the Int. Conf. on\nVery Large Data Bases, 13:507-518.\n[34] N. Beckmann, H. Kriegel, R. Schneider, B. Seeger (1990). The R* tree:\nAn efficient and robust access method for points and rectangles. In Proc.\nACM SIGMOD Int. Conf. on Management of Data, pages 322-331.\n[35] S. Berchtold, D. A. Keim, and H. P. Kreigel (1996). The X-tree: An\nindex structure for high dimensional data. Procff the Int. Conf. on Very\nLarge Data Bases.\n[36] S. T. Leutenegger, M. A. Lopez, J. M. Edgington (1997). STR: A simple\nand efficient algorithm for R-tree packing. In Proe. Int. Conf. on Data\nEngineering.\n[37] V. Gaede &amp; O. Gunther (1998). Multidimensional access methods. ACM\nComputing Surveys, 30(2).\n[38] K. V. Ravi Kanth, Siva Ravada, J. Sharma, J. Banerjee (1999). Indexing\nmedium-dimensionality data in oracle. In Proc. ACM SIGMOD Int.\nConf. on Management of Data.\n[39] K. V. Ravi Kanth &amp; Siva Ravada (2001). Efficient processing of large\nspatial queries using interior approximations. In Symposium on Spatial\nand Temporal Databases (SSTD).\n[40] Oracle Application Server 10g White Paper (2007). Oracle Application\nServer 10g."]}