Name
Abstract | ||
|---|---|---|
With recent advances in information technologies such as global position system and mobile internet, a huge volume of spatio-textual objects have been generated from location-based services, which enable a wide range of spatial keyword queries. Recently, researchers have proposed a novel query, called Spatial Pattern Matching (SPM), which uses a pattern to capture the user's intention. It has been demonstrated to be fundamental and useful for many real applications. Despite its usefulness, the SPM problem is computationally intractable. Existing algorithms suffer from the low efficiency issue, especially on large scale datasets. To enhance the performance of SPM, in this paper we propose a novel Efficient Spatial Pattern Matching (ESPM) algorithm, which exploits the inverted linear quadtree index and computes matched node pairs and object pairs level by level in a top-down manner. In particular, it focuses on pruning unpromising nodes and node pairs at the high levels, resulting in a large number of unpromising objects and object pairs to be pruned before accessing them from disk. We experimentally evaluate the performance of ESPM on real large datasets. Our results show that ESPM is over one order of magnitude faster than the state-of-the-art algorithm, and also uses much less I/O cost. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TKDE.2019.2947505 | IEEE Transactions on Knowledge and Data Engineering |
Keywords | DocType | Volume |
Pattern matching,Indexes,Planning,Information technology,Business,Australia,Marine vehicles | Journal | 32 |
Issue | ISSN | Citations |
6 | 1041-4347 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongmei Chen | 1 | 34 | 5.17 |
| Yixiang Fang | 2 | 227 | 23.06 |
| Ying Zhang | 3 | 1288 | 90.39 |
| Wenjie Zhang | 4 | 1616 | 105.67 |
| Lizhen Wang | 5 | 153 | 26.16 |