2. Introduction Easy and fast accessibility to the database Main problem: request time limits number of points to fetch What has been done so far: 2D vector map 2D vector map with close-ups 3D iso-vorticity surfaces 5/18/11 2
3. Caching requests To prevent repetitive requests Cache files locally stored Fast development on custom applications Preloading data in cache 5/18/11 3
4. Built-in SOAP functions Very time consuming due to DOM approach Bottleneck: constructing XML request and parsing XML response Solution: fast rewritten SOAP functions Results: large time gain, more points to be requested 5/18/11 4
7. Example: 2D vector map 256x256 = 65536 points on area of 1024x1024 points Arbitrary time step High resolution in contours, low resolution in quiver Calculation time: ~1 min 5/18/11 7
9. Example: 2D vector map close-ups Four steps, zooming in to center of previous: 128x128 on 1024x1024 area 128x128 on 256x256 area 64x64 on 64x64 area 16x16 on 16x16 area Emphasizes large and small-scale structures Calculation time: ~ 1 min 5/18/11 9
