File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.is.2006.03.002
- Scopus: eid_2-s2.0-33846908144
- WOS: WOS:000244992600005
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: An efficient location update mechanism for continuous queries over moving objects
Title | An efficient location update mechanism for continuous queries over moving objects |
---|---|
Authors | |
Keywords | Continuous queries Moving objects Temporal correctness Update generation schemes |
Issue Date | 2007 |
Publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/is |
Citation | Information Systems, 2007, v. 32 n. 4, p. 593-620 How to Cite? |
Abstract | In a moving-object database system that supports continuous queries (CQ), an important problem is to keep the location data consistent with the actual locations of the entities being monitored, in order to produce correct query results. This goal is often difficult to achieve due to limited network resources. However, if an object is not required by any query, its value need not be refreshed. Based on this observation, we redefine the notion of temporal consistency of data items with respect to the query result, where only data items that are relevant to the CQs need to be fresh. To exploit this correctness definition, we develop an adaptive time-based update technique called query-result update (QRU). The advantage of this technique is that it identifies objects with different levels of significance to the correctness of query results. Locations of objects that have more impact to the query result are acquired more frequently than the ones that do not. To achieve this objective, queries are classified into rank-based (i.e., ranks of objects are critical to query results) and non-rank-based. For each query class, QRU decides the time instant that an object should send a location update based on the predicted impact of the object to the query result. Moreover, the location update frequency of each object is continuously adjusted in order to adapt to the accuracy of the prediction model used. We evaluate the effectiveness of QRU by simulating execution of CQs over synthetic and real data sets. We also compare QRU experimentally with existing location update policies, namely the distance-based method, the time-based method, the speed dead-reckoning method, as well as the safe region strategy. © 2006 Elsevier B.V. All rights reserved. |
Persistent Identifier | http://hdl.handle.net/10722/129990 |
ISSN | 2023 Impact Factor: 3.0 2023 SCImago Journal Rankings: 1.201 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cheng, R | en_HK |
dc.contributor.author | Lam, KY | en_HK |
dc.contributor.author | Prabhakar, S | en_HK |
dc.contributor.author | Liang, B | en_HK |
dc.date.accessioned | 2010-12-23T08:45:11Z | - |
dc.date.available | 2010-12-23T08:45:11Z | - |
dc.date.issued | 2007 | en_HK |
dc.identifier.citation | Information Systems, 2007, v. 32 n. 4, p. 593-620 | en_HK |
dc.identifier.issn | 0306-4379 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/129990 | - |
dc.description.abstract | In a moving-object database system that supports continuous queries (CQ), an important problem is to keep the location data consistent with the actual locations of the entities being monitored, in order to produce correct query results. This goal is often difficult to achieve due to limited network resources. However, if an object is not required by any query, its value need not be refreshed. Based on this observation, we redefine the notion of temporal consistency of data items with respect to the query result, where only data items that are relevant to the CQs need to be fresh. To exploit this correctness definition, we develop an adaptive time-based update technique called query-result update (QRU). The advantage of this technique is that it identifies objects with different levels of significance to the correctness of query results. Locations of objects that have more impact to the query result are acquired more frequently than the ones that do not. To achieve this objective, queries are classified into rank-based (i.e., ranks of objects are critical to query results) and non-rank-based. For each query class, QRU decides the time instant that an object should send a location update based on the predicted impact of the object to the query result. Moreover, the location update frequency of each object is continuously adjusted in order to adapt to the accuracy of the prediction model used. We evaluate the effectiveness of QRU by simulating execution of CQs over synthetic and real data sets. We also compare QRU experimentally with existing location update policies, namely the distance-based method, the time-based method, the speed dead-reckoning method, as well as the safe region strategy. © 2006 Elsevier B.V. All rights reserved. | en_HK |
dc.language | eng | en_US |
dc.publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/is | en_HK |
dc.relation.ispartof | Information Systems | en_HK |
dc.rights | Appropriate Bibliographic Citation:Authors posting Accepted Author Manuscript online should later add a citation for the Published Journal Article indicating that the Article was subsequently published, and may mention the journal title provided that they add the following text at the beginning of the document: “NOTICE: this is the author’s version of a work that was accepted for publication in <Journal title>. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in PUBLICATION, [VOL#, ISSUE#, (DATE)] DOI#” | - |
dc.subject | Continuous queries | en_HK |
dc.subject | Moving objects | en_HK |
dc.subject | Temporal correctness | en_HK |
dc.subject | Update generation schemes | en_HK |
dc.title | An efficient location update mechanism for continuous queries over moving objects | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0306-4379&volume=32&issue=4&spage=593&epage=620&date=2007&atitle=An+Efficient+Location+Update+Mechanism+for+Continuous+Queries+over+Moving+Objects | - |
dc.identifier.email | Cheng, R:ckcheng@cs.hku.hk | en_HK |
dc.identifier.authority | Cheng, R=rp00074 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.is.2006.03.002 | en_HK |
dc.identifier.scopus | eid_2-s2.0-33846908144 | en_HK |
dc.identifier.hkuros | 176452 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-33846908144&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 32 | en_HK |
dc.identifier.issue | 4 | en_HK |
dc.identifier.spage | 593 | en_HK |
dc.identifier.epage | 620 | en_HK |
dc.identifier.isi | WOS:000244992600005 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Cheng, R=7201955416 | en_HK |
dc.identifier.scopusauthorid | Lam, KY=7403656886 | en_HK |
dc.identifier.scopusauthorid | Prabhakar, S=7101672592 | en_HK |
dc.identifier.scopusauthorid | Liang, B=8641604300 | en_HK |
dc.identifier.issnl | 0306-4379 | - |