Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICDE.2010.5447897
DC FieldValue
dc.titleLocating mapped resources in Web 2.0
dc.contributor.authorZhang, D.
dc.contributor.authorOoi, B.C.
dc.contributor.authorTung, A.K.H.
dc.date.accessioned2013-07-04T08:41:05Z
dc.date.available2013-07-04T08:41:05Z
dc.date.issued2010
dc.identifier.citationZhang, D., Ooi, B.C., Tung, A.K.H. (2010). Locating mapped resources in Web 2.0. Proceedings - International Conference on Data Engineering : 521-532. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDE.2010.5447897
dc.identifier.isbn9781424454440
dc.identifier.issn10844627
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/42008
dc.description.abstractMapping mashups are emerging Web 2.0 applications in which data objects such as blogs, photos and videos from different sources are combined and marked in a map using APIs that are released by online mapping solutions such as Google and Yahoo Maps. These objects are typically associated with a set of tags capturing the embedded semantic and a set of coordinates indicating their geographical locations. Traditional web resource searching strategies are not effective in such an environment due to the lack of the gazetteer context in the tags. Instead, a better alternative approach is to locate an object by tag matching. However, the number of tags associated with each object is typically small, making it difficult for an object to capture the complete semantics in the query objects. In this paper, we focus on the fundamental application of locating geographical resources and propose an efficient tag-centric query processing strategy. In particular, we aim to find a set of nearest co-located objects which together match the query tags. Given the fact that there could be large number of data objects and tags, we develop an efficient search algorithm that can scale up in terms of the number of objects and tags. Further, to ensure that the results are relevant, we also propose a geographical context sensitive geo-tf-idf ranking mechanism. Our experiments on synthetic data sets demonstrate its scalability while the experiments using the real life data set confirm its practicality. © 2010 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ICDE.2010.5447897
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1109/ICDE.2010.5447897
dc.description.sourcetitleProceedings - International Conference on Data Engineering
dc.description.page521-532
dc.identifier.isiut000286933100055
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.