TY - GEN
T1 - Co-spatial searcher
T2 - 17th International Conference on Database Systems for Advanced Applications, DASFAA 2012
AU - Zhang, Jinzeng
AU - Meng, Xiaofeng
AU - Zhou, Xuan
AU - Liu, Dongqi
PY - 2012
Y1 - 2012
N2 - The proliferation of geo-social network, such as Foursquare and Facebook Places, enables users to generate location information and its corresponding descriptive tags. Using geo-social networks, users with similar interests can plan for social activities collaboratively. This paper proposes a novel type of query, called Tag-based top-k Collaborative Spatial (TkCoS) query, for users to make outdoor plans collaboratively. This type of queries aim to retrieve groups of geographic objects that can satisfy a group of users' requirements expressed in tags, while ensuring that the objects be within the minimum spatial distance from the users. To answer TkCoS queries efficiently, we introduce a hybrid index structure called Spatial-Tag R-tree (STR-tree), which is an extension of the R-tree. Based on STR-tree, we propose a query processing algorithm that utilizes both spatial and tag similarity constraints to prune search space and identify desired objects quickly. Moreover, a differential impact factor is adopted to fine-tune the returned results in order to maximize the users' overall satisfaction. Extensive experiments on synthetic and real datatsets validate the efficiency and the scalability of the proposed algorithm.
AB - The proliferation of geo-social network, such as Foursquare and Facebook Places, enables users to generate location information and its corresponding descriptive tags. Using geo-social networks, users with similar interests can plan for social activities collaboratively. This paper proposes a novel type of query, called Tag-based top-k Collaborative Spatial (TkCoS) query, for users to make outdoor plans collaboratively. This type of queries aim to retrieve groups of geographic objects that can satisfy a group of users' requirements expressed in tags, while ensuring that the objects be within the minimum spatial distance from the users. To answer TkCoS queries efficiently, we introduce a hybrid index structure called Spatial-Tag R-tree (STR-tree), which is an extension of the R-tree. Based on STR-tree, we propose a query processing algorithm that utilizes both spatial and tag similarity constraints to prune search space and identify desired objects quickly. Moreover, a differential impact factor is adopted to fine-tune the returned results in order to maximize the users' overall satisfaction. Extensive experiments on synthetic and real datatsets validate the efficiency and the scalability of the proposed algorithm.
KW - Geo-social network
KW - Shadow prefix-tree
KW - Spatial collaborative search
KW - Tag
UR - https://www.scopus.com/pages/publications/84860666240
U2 - 10.1007/978-3-642-29038-1_40
DO - 10.1007/978-3-642-29038-1_40
M3 - 会议稿件
AN - SCOPUS:84860666240
SN - 9783642290374
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 560
EP - 575
BT - Database Systems for Advanced Applications - 17th International Conference, DASFAA 2012, Proceedings
Y2 - 15 April 2012 through 18 April 2012
ER -