Concept for a Web Map Implementation with Faster Query Response

Vector data and in particular road networks are being used in many application domains such as in mobile computing. These systems would prefer to receive the query results very quickly. Lots of research is going on to make the query response faster. One technique is to compress vector data so that they can be transferred to the client quickly. If we look different compression technique that are used to make the response faster, we will see that some of them do not make the response fast enough and some of them make response fast but very complex to implement. We report the concept for the implementation of a web map with a simple compression technique to send query response to the client, and found it making response fast. We have used some open source/free components to make the development quick and easy. This paper may work as a guide line for quick implementation of a web map. Keywords: Web Map, PostGIS, Geoserver, GeoWebCache, Compression.

[1]  Alexander Kolesnikov,et al.  Reference line approach for vector data compression , 2004, 2004 International Conference on Image Processing, 2004. ICIP '04..

[2]  Yang Cai,et al.  Visual transformation for interactive spatiotemporal data mining , 2007, Knowledge and Information Systems.

[3]  Cyrus Shahabi,et al.  Alternative strategies for Performing Spatial Joins on Web Sources , 2003, Knowledge and Information Systems.

[4]  Cyrus Shahabi,et al.  A hybrid aggregation and compression technique for road network databases , 2008, Knowledge and Information Systems.

[5]  Johan Persson.  STREAMING OF COMPRESSED MULTI-RESOLUTION GEOGRAPHIC VECTOR DATA , 2004 .

[6]  A. Saalfeld.  Topologically Consistent Line Simplification with the Douglas-Peucker Algorithm , 1999 .

[7]  Michela Bertolotto,et al.  A multi-level data structure for vector maps , 2004, GIS '04.

[8]  Shin-Ting Wu,et al.  A non-self-intersection Douglas-Peucker algorithm , 2003, 16th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2003).

[9]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[10]  Yan Huang,et al.  Vector map compression: a clustering approach , 2002, GIS '02.

[11]  Cláudio de Souza Baptista,et al.  A multiresolution approach for Internet GIS applications , 2004, Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004..

[12]  Thomas K. Peucker,et al.  2. Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature , 2011 .

[13]  Qing Zhu,et al.  AN EFFICIENT DATA MANAGEMENT APPROACH FOR LARGE CYBERCITY GIS , 2002 .

[14]  Giuliana Dettori,et al.  Towards a Formal Model for Multi-Resolution Spatial Maps , 1995, SSD.

[15]  Michela Bertolotto,et al.  Progressive Transmission of Vector Map Data over the World Wide Web , 2001, GeoInformatica.

[16]  Barbara P. Buttenfield,et al.  Transmitting Vector Geospatial Data across the Internet , 2002, GIScience.

[17]  Tinghua Ai,et al.  Progressive Transmission of Vector Data Based on Changes Accumulation Model , 2004, SDH.

[18]  Michela Bertolotto,et al.  Efficiently Generating Multiple Representations for Web Mapping , 2005, W2GIS.