全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

面向组近邻的Top-k空间偏好查询

DOI: 10.3969/j.issn.1005-3026.2015.10.010, PP. 1412-1416

Keywords: 空间偏好,位置服务,组近邻,剪枝,查询

Full-Text   Cite this paper   Add to My Lib

Abstract:

空间偏好查询是当前空间查询研究中的一类热点问题,而现有的空间偏好查询不能有效支持面向组用户的位置服务应用.为此,提出一类新型空间偏好查询——面向组近邻的Top-k空间偏好查询(Top-kspatialpreferencequeryforgroupnearestneighbor).该查询通过查找特征对象的λ子集组近邻最终为用户返回评分值最高的前k个λ子集.为了高效执行这一查询,给出了两种查询算法:TSPQ-G及TSPQ-G*.其中TSPQ-G*在TSPQ-G的基础上,通过空间剪枝及高效的特征对象索引树遍历策略大幅减少I/O代价,进而有效提高了该查询的执行效率.实验采用多个数据集验证了所提算法在不同参数设置下的有效性.

References

[1]  Yan X,Chen R,Cheng C,et al.Spatial query processing engine in spatially enabled database[C]//Geoinformatics.Beijing:IEEE,2010:1-6.
[2]  Xia T,Zhang E,Kanoulas E,et al.On computing top-t most influential spatial sites[C]//Very Large Data Bases.Trondheim:ACM,2005:946-957.
[3]  Du Y,Zhang D,Xia T.The optimal-location query[C]//Symposium on Spatial and Temporal Databases.Angra Dos Reis:Springer,2005:163-180.
[4]  Yiu M,Dai X,Mamoulis N,et al.Top-k spatial preference queries[C]//International Conference on Data Engineering.Istanbul:IEEE,2007:1076-1085.
[5]  Yiu M,Lu H,Mamoulis N,et al.Ranking spatial data by quality preferences[J].Transactions on Knowledge and Data Engineering,2011,23(3):433-446.
[6]  Guttman A.R-Trees:a dynamic index structure for spatial searching[C]//International Conference on Management of Data.Boston:ACM,1984:47-57.
[7]  Joao B,Vlachou A,Doulkeridis C,et al.Efficient processing of top-k spatial preference queries[C]//Very Large Data Bases.Seattle:ACM,2011:93-104.
[8]  Papadias D,Shen Q,Tao Y,et al.Group nearest neighbor queries[C]//International Conference on Data Engineering .Boston:IEEE,2004:301-312.
[9]  Li H,Lu H,Huang B,et al.Two ellipse-based pruning methods for group nearest neighbor queries[C]// Advances in Geographic Information Systems.Bremen:ACM,2005:192-199.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133