Evaluation of probabilistic queries over imprecise data in constantly-evolving environments

被引:9
作者
Cheng, Reynold [1 ]
Kalashnikov, Dmitri V.
Prabhakar, Sunil
机构
[1] Hong Kong Polytech Univ, Kowloon, Hong Kong, Peoples R China
[2] Purdue Univ, W Lafayette, IN 47907 USA
基金
美国国家科学基金会;
关键词
data uncertainty; constantly-evolving environments; probabilistic queries; query quality; entropy; data caching;
D O I
10.1016/j.is.2005.06.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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. (C) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:104 / 130
页数:27
相关论文
共 30 条
[21]   Fast approximate query answering using precomputed statistics [J].
Poosala, V ;
Ganti, V .
15TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 1999, :252-252
[22]   Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects [J].
Prabhakar, S ;
Xia, YN ;
Kalashnikov, DV ;
Aref, WG ;
Hambrusch, SE .
IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (10) :1124-1140
[23]  
ROUSSOPOULOS N, 1995, P ACM SIGMOD INT C M, P71, DOI DOI 10.1145/223784.223794
[24]  
Shannon Claude, 1998, The Mathematical Theory of Communication
[25]  
SHOSHANI A, 1997, P ACM PODS
[26]  
TAO Y, 2005, P 31 INT C VER LARG
[27]  
Theodoridis Y., 1996, Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. PODS 1996, P161, DOI 10.1145/237661.237705
[28]   PRODUCING APPROXIMATE ANSWERS TO SET-VALUED AND SINGLE-VALUED QUERIES [J].
VRBSKY, SV ;
LIU, JWS .
JOURNAL OF SYSTEMS AND SOFTWARE, 1994, 27 (03) :243-251
[29]  
WOLFSON O, DISTRIB PARALLEL DAT, V7
[30]   Uncertainty in a nested relational database model [J].
Yazici, A ;
Soysal, A ;
Buckles, BP ;
Petry, FE .
DATA & KNOWLEDGE ENGINEERING, 1999, 30 (03) :275-301