File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Scalable Evaluation of Trajectory Queries Over Imprecise Location Data

TitleScalable Evaluation of Trajectory Queries Over Imprecise Location Data
Authors
Issue Date17-Sep-2013
PublisherIEEE.
Citation
IEEE Transactions on Knowledge and Data Engineering, v. PP n. 99, p. 1 How to Cite?
AbstractTrajectory queries, which retrieve nearby objects for every point of a given route, can be used to identify alerts of potential threats along a vessel route, or monitor the adjacent rescuers to a travel path. However, the locations of these objects (e.g., threats, succours) may not be precisely obtained due to hardware limitations of measuring devices, as well as complex natures of the surroundings. For such data, we consider a common model, where the possible locations of an object are bounded by a closed region, called "imprecise region". Ignoring or coarsely wrapping imprecision can render low query qualities, and cause undesirable consequences such as missing alerts of threats and poor response rescue time. Also, the query is quite time-consuming, since all points on the trajectory are considered. In this paper, we study how to efficiently evaluate trajectory queries over imprecise objects, by proposing a novel concept, u-bisector, which is an extension of bisector specified for imprecise data. Based on the u-bisector, we provide an efficient and versatile solution which supports different shapes of commonly-used imprecise regions (e.g., rectangles, circles, and line segments). Extensive experiments on real datasets show that our proposal achieves better efficiency, quality, and scalability than its competitors.
Persistent Identifierhttp://hdl.handle.net/10722/190320
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorXie, Xen_US
dc.contributor.authorYiu, Men_US
dc.contributor.authorCheng, Ren_US
dc.contributor.authorLu, Hen_US
dc.date.accessioned2013-09-17T15:18:34Z-
dc.date.available2013-09-17T15:18:34Z-
dc.date.issued2013-09-17-
dc.identifier.citationIEEE Transactions on Knowledge and Data Engineering, v. PP n. 99, p. 1en_US
dc.identifier.urihttp://hdl.handle.net/10722/190320-
dc.description.abstractTrajectory queries, which retrieve nearby objects for every point of a given route, can be used to identify alerts of potential threats along a vessel route, or monitor the adjacent rescuers to a travel path. However, the locations of these objects (e.g., threats, succours) may not be precisely obtained due to hardware limitations of measuring devices, as well as complex natures of the surroundings. For such data, we consider a common model, where the possible locations of an object are bounded by a closed region, called "imprecise region". Ignoring or coarsely wrapping imprecision can render low query qualities, and cause undesirable consequences such as missing alerts of threats and poor response rescue time. Also, the query is quite time-consuming, since all points on the trajectory are considered. In this paper, we study how to efficiently evaluate trajectory queries over imprecise objects, by proposing a novel concept, u-bisector, which is an extension of bisector specified for imprecise data. Based on the u-bisector, we provide an efficient and versatile solution which supports different shapes of commonly-used imprecise regions (e.g., rectangles, circles, and line segments). Extensive experiments on real datasets show that our proposal achieves better efficiency, quality, and scalability than its competitors.-
dc.languageengen_US
dc.publisherIEEE.en_US
dc.relation.ispartofIEEE Transactions on Knowledge and Data Engineeringen_US
dc.rightsIEEE Transactions on Knowledge and Data Engineering. Copyright © IEEE.en_US
dc.rights©20xx IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_US
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleScalable Evaluation of Trajectory Queries Over Imprecise Location Dataen_US
dc.typeArticleen_US
dc.identifier.emailCheng, CK: ckcheng@cs.hku.hken_US
dc.identifier.authorityCheng, CK=rp00074en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/TKDE.2013.77-
dc.identifier.hkuros224493en_US
dc.identifier.volumePPen_US
dc.identifier.issue99-
dc.identifier.spage1en_US
dc.identifier.epage1en_US
dc.identifier.isiWOS:000341570800016-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats