Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/98593
Title: | An efficient query indexing mechanism for filtering geo-textual data | Authors: | Chen, Lisi Cong, Gao Cao, Xin |
Keywords: | DRNTU::Engineering::Computer science and engineering | Issue Date: | 2013 | Source: | Chen, L., Cong, G., & Cao, X. (2013). An efficient query indexing mechanism for filtering geo-textual data. The 2013 ACM SIGMOD International Conference on Management of Data, pp749-760. | Conference: | International Conference on Management of Data (2013 : New York, USA) | Abstract: | Massive amount of data that are geo-tagged and associated with text information are being generated at an unprecedented scale. Users may want to be notified of interesting geo-textual objects during a period of time. For example, a user may want to be informed when tweets containing term "garage sale" are posted within 5 km of the user's home in the next 72 hours. In this paper, for the first time we study the problem of matching a stream of incoming Boolean Range Continuous queries over a stream of incoming geo-textual objects in real time. We develop a new system for addressing the problem. In particular, we propose a hybrid index, called IQ-tree, and novel cost models for managing a stream of incoming Boolean Range Continuous queries. We also propose algorithms for matching the queries with incoming geo-textual objects based on the index. Results of empirical studies with implementations of the proposed techniques demonstrate that the paper's proposals offer scalability and are capable of excellent performance. | URI: | https://hdl.handle.net/10356/98593 http://hdl.handle.net/10220/17341 |
DOI: | 10.1145/2463676.2465328 | Schools: | School of Computer Engineering | Fulltext Permission: | none | Fulltext Availability: | No Fulltext |
Appears in Collections: | SCSE Conference Papers |
SCOPUSTM
Citations
5
105
Updated on Mar 24, 2025
Page view(s) 20
829
Updated on Mar 24, 2025
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.