Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/112298
DC Field | Value | Language |
---|---|---|
dc.contributor | 資管系 | zh_TW |
dc.creator | 陳良弼 | zh_TW |
dc.creator | Chung, Bruce S.E. | en_US |
dc.creator | Lee, Wang-Chien | en_US |
dc.creator | Chen, Arbee L.P. | en_US |
dc.date | 2008-10 | en_US |
dc.date.accessioned | 2017-08-29T05:43:55Z | - |
dc.date.available | 2017-08-29T05:43:55Z | - |
dc.date.issued | 2017-08-29T05:43:55Z | - |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/112298 | - |
dc.description.abstract | Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that an object only moves along an anticipated path. In this paper, we study the problem of answering probabilistic range queries on moving objects based on an uncertainty model, which captures the possible movements of objects with probabilities. We conduct a performance study, which shows our proposal significantly reduces the number of object examinations and the overall cost of the query evaluation. | en_US |
dc.format.extent | 208384 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.relation | CIKM `08 Proceedings of the 17th ACM conference on Information and knowledge management , Pages 1399-1400 | en_US |
dc.subject | moving objects; probabilistic range query | en_US |
dc.title | Efficient Processing of Probabilistic Spatio-temporal Range Queries over Moving Objects | en_US |
dc.type | conference | |
dc.identifier.doi | 10.1145/1458082.1458300 | |
dc.doi.uri | http://dx.doi.org/10.1145/1458082.1458300 | |
item.openairetype | conference | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | With Fulltext | - |
item.grantfulltext | open | - |
Appears in Collections: | 會議論文 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.