计算机科学
空间查询
查询优化
情报检索
Web查询分类
Web搜索查询
约束(计算机辅助设计)
查询语言
查询扩展
空间数据库
匹配(统计)
数据挖掘
对象(语法)
萨尔盖博
RDF查询语言
偏爱
空间分析
人工智能
搜索引擎
数学
几何学
统计
标识
DOI:10.1007/978-3-031-25158-0_30
摘要
Spatial Pattern Matching (SPM) is the pattern-based spatial keyword query. It can fit user’s intention on text keywords, distances and exclusion relationships of spatial objects at the same time. However, SPM still suffer from the following issues. Firstly, in some application scenario, SPM cannot meet the user’s preference query requirements for different attributes (such as price, service, etc.) of spatial objects. In addition, SPM only follows strict text keyword matching and ignores category during the query process, which may make the object categories in the query results incorrect, compromising query effectiveness. In view of these drawbacks, this paper formulates a novel query, i.e., category constraint spatial keyword preference query, or CSKPQ in short. The query integrates attributes of spatial objects and categories into SPM, finding one most suitable collection of spatial objects for user. Further, we propose an efficient query processing algorithm which use a new hybrid index structure. Extensive empirical experiments on real datasets demonstrate the effectiveness of our proposed algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI