File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.is.2005.06.002
- Scopus: eid_2-s2.0-33749548584
- WOS: WOS:000242064900005
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Evaluation of probabilistic queries over imprecise data in constantly-evolving environments
Title | Evaluation of probabilistic queries over imprecise data in constantly-evolving environments |
---|---|
Authors | |
Keywords | Constantly-evolving environments Data caching Data uncertainty Entropy Probabilistic queries Query quality |
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. 1, p. 104-130 How to Cite? |
Abstract | Sensors are often employed to monitor continuously changing entities like locations of moving objects and temperature. The sensor readings are reported to a database system, and are subsequently used to answer queries. Due to continuous changes in these values and limited resources (e.g., network bandwidth and battery power), the database may not be able to keep track of the actual values of the entities. Queries that use these old values may produce incorrect answers. However, if the degree of uncertainty between the actual data value and the database value is limited, one can place more confidence in the answers to the queries. More generally, query answers can be augmented with probabilistic guarantees of the validity of the answers. In this paper, we study probabilistic query evaluation based on uncertain data. A classification of queries is made based upon the nature of the result set. For each class, we develop algorithms for computing probabilistic answers, and provide efficient indexing and numeric solutions. We address the important issue of measuring the quality of the answers to these queries, and provide algorithms for efficiently pulling data from relevant sensors or moving objects in order to improve the quality of the executing queries. Extensive experiments are performed to examine the effectiveness of several data update policies. © 2005 Elsevier B.V. All rights reserved. |
Persistent Identifier | http://hdl.handle.net/10722/129988 |
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 | Kalashnikov, DV | en_HK |
dc.contributor.author | Prabhakar, S | en_HK |
dc.date.accessioned | 2010-12-23T08:45:10Z | - |
dc.date.available | 2010-12-23T08:45:10Z | - |
dc.date.issued | 2007 | en_HK |
dc.identifier.citation | Information Systems, 2007, v. 32 n. 1, p. 104-130 | en_HK |
dc.identifier.issn | 0306-4379 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/129988 | - |
dc.description.abstract | Sensors are often employed to monitor continuously changing entities like locations of moving objects and temperature. The sensor readings are reported to a database system, and are subsequently used to answer queries. Due to continuous changes in these values and limited resources (e.g., network bandwidth and battery power), the database may not be able to keep track of the actual values of the entities. Queries that use these old values may produce incorrect answers. However, if the degree of uncertainty between the actual data value and the database value is limited, one can place more confidence in the answers to the queries. More generally, query answers can be augmented with probabilistic guarantees of the validity of the answers. In this paper, we study probabilistic query evaluation based on uncertain data. A classification of queries is made based upon the nature of the result set. For each class, we develop algorithms for computing probabilistic answers, and provide efficient indexing and numeric solutions. We address the important issue of measuring the quality of the answers to these queries, and provide algorithms for efficiently pulling data from relevant sensors or moving objects in order to improve the quality of the executing queries. Extensive experiments are performed to examine the effectiveness of several data update policies. © 2005 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.subject | Constantly-evolving environments | en_HK |
dc.subject | Data caching | en_HK |
dc.subject | Data uncertainty | en_HK |
dc.subject | Entropy | en_HK |
dc.subject | Probabilistic queries | en_HK |
dc.subject | Query quality | en_HK |
dc.title | Evaluation of probabilistic queries over imprecise data in constantly-evolving environments | 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=1&spage=104&epage=130&date=2007&atitle=Evaluation+of+probabilistic+queries+over+imprecise+data+in+constantly-evolving+environments | - |
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.2005.06.002 | en_HK |
dc.identifier.scopus | eid_2-s2.0-33749548584 | en_HK |
dc.identifier.hkuros | 176454 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-33749548584&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 32 | en_HK |
dc.identifier.issue | 1 | en_HK |
dc.identifier.spage | 104 | en_HK |
dc.identifier.epage | 130 | en_HK |
dc.identifier.isi | WOS:000242064900005 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Cheng, R=7201955416 | en_HK |
dc.identifier.scopusauthorid | Kalashnikov, DV=6602598174 | en_HK |
dc.identifier.scopusauthorid | Prabhakar, S=7101672592 | en_HK |
dc.identifier.issnl | 0306-4379 | - |