Efficient top K temporal spatial keyword search

Chengyuan Zhang, Lei Zhu, Weiren Yu, Jun Long*, Fang Huang, Hongbo Zhao

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Massive amount of data that are geo-tagged and associated with text information are being generated at an unprecedented scale in many emerging applications such as location based services and social networks. Due to their importance, a large body of work has focused on efficiently computing various spatial keyword queries. In this paper, we study the top-k temporal spatial keyword query which considers three important constraints during the search including time, spatial proximity and textual relevance. A novel index structure, namely SSG-tree, to efficiently insert/delete spatio-temporal web objects with high rates. Base on SSG-tree an efficient algorithm is developed to support top-k temporal spatial keyword query. We show via extensive experimentation with real spatial databases that our method has increased performance over alternate techniques.

Original languageEnglish
Title of host publicationTrends and Applications in Knowledge Discovery and Data Mining - PAKDD 2018 Workshops, BDASC, BDM, ML4Cyber, PAISI, DaMEMO, Revised Selected Papers
PublisherSpringer
Pages80-92
Number of pages13
ISBN (Print)9783030045029
DOIs
Publication statusPublished - 2018
Event22nd Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2018 - Melbourne, Australia
Duration: 3 Jun 20183 Jun 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11154 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference22nd Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2018
CountryAustralia
CityMelbourne
Period3/06/183/06/18

Fingerprint

Keyword Search
Location based services
Query
Spatial Database
Alternate
Experimentation
Social Networks
Proximity
Efficient Algorithms
Computing

Bibliographical note

© Springer Nature Switzerland AG 2018

Cite this

Zhang, C., Zhu, L., Yu, W., Long, J., Huang, F., & Zhao, H. (2018). Efficient top K temporal spatial keyword search. In Trends and Applications in Knowledge Discovery and Data Mining - PAKDD 2018 Workshops, BDASC, BDM, ML4Cyber, PAISI, DaMEMO, Revised Selected Papers (pp. 80-92). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11154 LNAI). Springer. https://doi.org/10.1007/978-3-030-04503-6_7
Zhang, Chengyuan ; Zhu, Lei ; Yu, Weiren ; Long, Jun ; Huang, Fang ; Zhao, Hongbo. / Efficient top K temporal spatial keyword search. Trends and Applications in Knowledge Discovery and Data Mining - PAKDD 2018 Workshops, BDASC, BDM, ML4Cyber, PAISI, DaMEMO, Revised Selected Papers. Springer, 2018. pp. 80-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a752ad86185243aaaab640823d245552,
title = "Efficient top K temporal spatial keyword search",
abstract = "Massive amount of data that are geo-tagged and associated with text information are being generated at an unprecedented scale in many emerging applications such as location based services and social networks. Due to their importance, a large body of work has focused on efficiently computing various spatial keyword queries. In this paper, we study the top-k temporal spatial keyword query which considers three important constraints during the search including time, spatial proximity and textual relevance. A novel index structure, namely SSG-tree, to efficiently insert/delete spatio-temporal web objects with high rates. Base on SSG-tree an efficient algorithm is developed to support top-k temporal spatial keyword query. We show via extensive experimentation with real spatial databases that our method has increased performance over alternate techniques.",
author = "Chengyuan Zhang and Lei Zhu and Weiren Yu and Jun Long and Fang Huang and Hongbo Zhao",
note = "{\circledC} Springer Nature Switzerland AG 2018",
year = "2018",
doi = "10.1007/978-3-030-04503-6_7",
language = "English",
isbn = "9783030045029",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "80--92",
booktitle = "Trends and Applications in Knowledge Discovery and Data Mining - PAKDD 2018 Workshops, BDASC, BDM, ML4Cyber, PAISI, DaMEMO, Revised Selected Papers",
address = "Germany",

}

Zhang, C, Zhu, L, Yu, W, Long, J, Huang, F & Zhao, H 2018, Efficient top K temporal spatial keyword search. in Trends and Applications in Knowledge Discovery and Data Mining - PAKDD 2018 Workshops, BDASC, BDM, ML4Cyber, PAISI, DaMEMO, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11154 LNAI, Springer, pp. 80-92, 22nd Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2018, Melbourne, Australia, 3/06/18. https://doi.org/10.1007/978-3-030-04503-6_7

Efficient top K temporal spatial keyword search. / Zhang, Chengyuan; Zhu, Lei; Yu, Weiren; Long, Jun; Huang, Fang; Zhao, Hongbo.

Trends and Applications in Knowledge Discovery and Data Mining - PAKDD 2018 Workshops, BDASC, BDM, ML4Cyber, PAISI, DaMEMO, Revised Selected Papers. Springer, 2018. p. 80-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11154 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Efficient top K temporal spatial keyword search

AU - Zhang, Chengyuan

AU - Zhu, Lei

AU - Yu, Weiren

AU - Long, Jun

AU - Huang, Fang

AU - Zhao, Hongbo

N1 - © Springer Nature Switzerland AG 2018

PY - 2018

Y1 - 2018

N2 - Massive amount of data that are geo-tagged and associated with text information are being generated at an unprecedented scale in many emerging applications such as location based services and social networks. Due to their importance, a large body of work has focused on efficiently computing various spatial keyword queries. In this paper, we study the top-k temporal spatial keyword query which considers three important constraints during the search including time, spatial proximity and textual relevance. A novel index structure, namely SSG-tree, to efficiently insert/delete spatio-temporal web objects with high rates. Base on SSG-tree an efficient algorithm is developed to support top-k temporal spatial keyword query. We show via extensive experimentation with real spatial databases that our method has increased performance over alternate techniques.

AB - Massive amount of data that are geo-tagged and associated with text information are being generated at an unprecedented scale in many emerging applications such as location based services and social networks. Due to their importance, a large body of work has focused on efficiently computing various spatial keyword queries. In this paper, we study the top-k temporal spatial keyword query which considers three important constraints during the search including time, spatial proximity and textual relevance. A novel index structure, namely SSG-tree, to efficiently insert/delete spatio-temporal web objects with high rates. Base on SSG-tree an efficient algorithm is developed to support top-k temporal spatial keyword query. We show via extensive experimentation with real spatial databases that our method has increased performance over alternate techniques.

UR - http://www.scopus.com/inward/record.url?scp=85059073468&partnerID=8YFLogxK

UR - https://link.springer.com/chapter/10.1007%2F978-3-030-04503-6_7

U2 - 10.1007/978-3-030-04503-6_7

DO - 10.1007/978-3-030-04503-6_7

M3 - Conference contribution

AN - SCOPUS:85059073468

SN - 9783030045029

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 80

EP - 92

BT - Trends and Applications in Knowledge Discovery and Data Mining - PAKDD 2018 Workshops, BDASC, BDM, ML4Cyber, PAISI, DaMEMO, Revised Selected Papers

PB - Springer

ER -

Zhang C, Zhu L, Yu W, Long J, Huang F, Zhao H. Efficient top K temporal spatial keyword search. In Trends and Applications in Knowledge Discovery and Data Mining - PAKDD 2018 Workshops, BDASC, BDM, ML4Cyber, PAISI, DaMEMO, Revised Selected Papers. Springer. 2018. p. 80-92. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-04503-6_7