- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Spatial trend prefetching for online maps mashups
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Spatial trend prefetching for online maps mashups Zhang, Jun
Abstract
Mashups try to merge some specific information together with online maps application by displaying related markers onto maps. Sometimes markers will be displayed very slowly. In this thesis, we have presented an approach to improve the performance of related applications by reducing network latency for those responses. We use Spatial Trend Web Prefetching Model to predict the areas which can be possibly arrived at after next movements. We classified movements into three patterns. Then this model will check history operations done by a specific user, find possible pattern he may be following and then predict next possible operations for the user according to the specific algorithm responding to that pattern. In our experiments done for lab environment (Nearby Cities application) and Internet environment (Skype-Google Map application), we can see that our approach can achieve hit rate of about 85% when movement interval is not less than l000ms and larger than 30% when movement interval is less than l000ms.
Item Metadata
Title |
Spatial trend prefetching for online maps mashups
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
2008
|
Description |
Mashups try to merge some specific information together with online maps
application by displaying related markers onto maps. Sometimes markers
will be displayed very slowly. In this thesis, we have presented an approach
to improve the performance of related applications by reducing network
latency for those responses. We use Spatial Trend Web Prefetching Model
to predict the areas which can be possibly arrived at after next movements.
We classified movements into three patterns. Then this model will check
history operations done by a specific user, find possible pattern he may be
following and then predict next possible operations for the user according to
the specific algorithm responding to that pattern. In our experiments done
for lab environment (Nearby Cities application) and Internet environment
(Skype-Google Map application), we can see that our approach can achieve
hit rate of about 85% when movement interval is not less than l000ms and
larger than 30% when movement interval is less than l000ms.
|
Extent |
2111528 bytes
|
Genre | |
Type | |
File Format |
application/pdf
|
Language |
eng
|
Date Available |
2009-03-05
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0051241
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2008-11
|
Campus | |
Scholarly Level |
Graduate
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International