2021
DOI: 10.2298/csis200131034c
|View full text |Cite
|
Sign up to set email alerts
|

Time-aware collective spatial keyword query

Abstract: The collective spatial keyword query is a hot research topic in the database community in recent years, which considers both the positional relevance to the query location and textual relevance to the query keywords. However, in real life, the temporal information of object is not always valid. Based on this, we define a new query, namely time-aware collective spatial keyword query (TCoSKQ), which considers the positional relevance, textual relevance, and temporal relevance between objects an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…The index can effectively prune the search space and take into account both keyword information and temporal information. Chen et al [30] proposed two evaluation functions for time-aware aggregate keyword queries to meet different types of query requirements and both proposed corresponding processing algorithms. Chan et al [31] studied the model of indoor keyword routing with time constraints, i.e., the TIKRQ problem (time-constrained indoor keyword-aware routing query), and proposed a series of pruning rules and corresponding solution algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…The index can effectively prune the search space and take into account both keyword information and temporal information. Chen et al [30] proposed two evaluation functions for time-aware aggregate keyword queries to meet different types of query requirements and both proposed corresponding processing algorithms. Chan et al [31] studied the model of indoor keyword routing with time constraints, i.e., the TIKRQ problem (time-constrained indoor keyword-aware routing query), and proposed a series of pruning rules and corresponding solution algorithms.…”
Section: Related Workmentioning
confidence: 99%