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

Information Systems

Volumn 32, Issue 1, 2007, Pages 104-130

  Cheng, Reynold ^a,b   Kalashnikov, Dmitri V ^b   Prabhakar, Sunil ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Constantly evolving environments; Data caching; Data uncertainty; Entropy; Probabilistic queries; Query quality

Indexed keywords

DATA CACHING; DATA UNCERTAINTY; PROBABILISTIC QUERIES; QUERY QUALITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA REDUCTION; NUMERICAL ANALYSIS; PROBABILITY; SENSORS;

DATABASE SYSTEMS;

EID: 33749548584     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2005.06.002     Document Type: Article

References (30)

1. P.A. Sistla, O. Wolfson, S. Chamberlain, S. Dao, Querying the uncertain position of moving objects, in: Temporal Databases: Research and Practice, 1998.
2. O. Wolfson, P. Sistla, S. Chamberlain, Y. Yesha, Updating and querying databases that track mobile units, Distrib. Parallel Dat. 7(3).
3. R. Cheng, S. Prabhakar, D.V. Kalashnikov, Querying imprecise data in moving object environments, in: Proceedings of the 19th IEEE International Conference on Data Engineering, India, 2003.
4. D. Pfoser, C. Jensen, Querying the trajectories of on-line mobile objects, in: ACM International Workshop on Data Engineering for Wireless and Mobile Access (MobiDE), 2001.
5. S. Prabhakar, Y. Xia, D. Kalashnikov, W. Aref, S. Hambrusch, Query indexing and velocity constrained indexing: scalable techniques for continuous queries on moving objects, IEEE Trans. Comput., Special section on data management and mobile computing 51(10) (2002) 1124-1140.
6. A. Deshpande, C. Guestrin, S. Madden, J. Hellerstein, W. Hong, Model-driven data acquisition in sensor networks, in: Proceedings of the 30th International Conference on Very Large Data Bases, 2004.
7. N. Roussopoulos, S. Kelley, F. Vincent, Nearest neighbor queries, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1995, San Jose, CA, 1995, pp. 71-79.
8. Y. Theodoridis, T. Sellis, A model for the prediction of R-tree performance, in: Proceedings of the ACM PODS, 1996, pp. 161-171.
9. Shannon C. The Mathematical Theory of Communication (1949), University of Illinois Press, Champaign
10. C. Olston, J. Widom, Best-effort cache synchronization with source cooperation, in: Proceedings of the ACM SIGMOD 2002 International Conference on Management of Data, 2002, pp. 73-84.
11. R. Cheng, D. Kalashnikov, S. Prabhakar, Evaluating probabilistic queries over imprecise data, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 2003.
12. S. Vrbsky, J. Liu, Producing approximate answers to set- and single-valued queries, J. Systems Software 17 (1994) 243-251.
13. V. Poosala, V. Ganti, Fast approximate query answering using precomputed statistics, in: Proceedings of the 15th International Conference on Data Engineering, 1999, pp. 252.
14. P. Gibbons, Y. Matias, New sampling-based summary statistics for improving approximate query answers, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1998.
15. S. Acharya, P. Gibbons, V. Poosala, S. Ramaswamy, Join synopses for approximate query answering, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1999.
16. C. Olston, J. Widom, Offering a precision-performance tradeoff for aggregation queries over replicated data, in: Proceedings of the 26th International Conference on Very Large Data Bases, 2000.
17. C. Olston, B.T. Loo, J. Widom, Adaptive precision setting for cached approximate values, in: Proceedings of the ACM SIGMOD 2001 International Conference on Management of Data, 2001.
18. S. Khanna, W. Tan, On computing functions with uncertainty, in: 20th ACM Symposium on Principles of Database Systems, 2001.
19. R. Cheng, Y. Xia, S. Prabhakar, R. Shah, J. Vitter, Efficient indexing methods for probabilistic threshold queries over uncertain data, in: Proceedings of the 30th International Conference on Very Large Data Bases, 2004.
20. Y. Tao, R. Cheng, X. Xiao, W. Ngai, B. Kao, S. Prabhakar, Indexing multi-dimensional uncertain data with arbitrary probability density functions, in: Proceedings of the 31st International Conference on Very Large Data Bases, 2005.
21. Yazici A., Soysal A., Buckles B., and Petry F. Uncertainty in a nested relational database model. Elsevier Data Knowledge Eng. 30 (1999) 275-301
22. D. Barbará, H. Garcia-Molina, D. Porter, The management of probabilistic data, IEEE Trans. Knowledge Data Eng. 4(5).
23. L. Lakshmanan, N. Leone, R. Ross, V. Subrahmanian, Probview: a flexible probabilistic database system, ACM Trans. Database Syst. 22(3) (1997) 419-469.
24. N. Dalvi, D. Suciu, Efficient query evaluation on probabilistic databases, in: Proceedings of the 30th VLDB Conference, 2004.
25. A. Shoshani, OLAP and statistical databases: similarities and differences, in: Proceedings ACM PODS, 1997.
26. E. Grädel, Y. Gurevich, C. Hirsch, The complexity of query reliability, in: Proceedings ACM PODS, 1998.
27. Chatfield C. The Analysis of Time Series an Introduction (1989), Chapman & Hall, London
28. Kantz H., and Schreiber T. Nonlinear Time Series Analysis (1999), Cambridge University Press, Cambridge
29. Chatfield C. Time-Series Forecasting (2000), Chapman & Hall, CRC, Cambridge
30. Brockwell P., and Davis R. Introduction to Time Series and Forecasting (2002), Springer, Berlin