The Community for Technology Leaders
RSS Icon
Issue No.01 - January (2009 vol.21)
pp: 92-107
Austin Parker , University of Maryland, College Park
Guillaume Infantes , University of Maryland, College Park
John Grant , Towson University, Towson
V. S. Subrahmanian , University of Maryland, College Park
Spatial PrObabilistic Temporal (SPOT) databases are a paradigm for reasoning with probabilistic statements about where objects are now or in the future. They express statements of the form "Object O is in spatial region R at time t with some probability in the interval [L,U]." Past work on SPOT databases uses selection operators returning SPOT atoms entailed by the SPOT database - we call this "cautious" selection. In this paper, we study several problems. First, we introduce the notion of "optimistic" selection queries that return sets of SPOT atoms consistent with, rather than entailed by, the SPOT database. We then develop an approach to scaling SPOT databases that has three main contributions: (i) We substantially reduce the size of past work's linear programs via variable elimination. (ii) We rigorously prove how one can prune the space searched in optimistic selection. (iii) We build an efficient index to execute optimistic selection queries over SPOT databases. Our approach is superior to past work in two major respects: first, it makes fewer assumptions than all past works on this topic except [30]. Second, the experiments - some using real world ship movement data - show substantially better performance than achieved in [30].
Probabilistic database, uncertainty management, spatial database
Austin Parker, Guillaume Infantes, John Grant, V. S. Subrahmanian, "SPOT Databases: Efficient Consistency Checking and Optimistic Selection in Probabilistic Spatial Databases", IEEE Transactions on Knowledge & Data Engineering, vol.21, no. 1, pp. 92-107, January 2009, doi:10.1109/TKDE.2008.93
[1] D. Applegate, W. Cook, S. Dash, and M. Mevenkamp, “QSopt Library,” index. html, 2007.
[2] D. Barbara, H. Garcia-Molina, and D. Porter, “The Management of Probabilistic Data,” IEEE Trans. Knowledge and Data Eng., vol. 4, 1992.
[3] G. Boole, “The Laws of Thought,” Prometheus Books (2003), 1854.
[4] V. Brusoni, L. Console, P. Terenziani, and B. Pernici, “Extending Temporal Relational Databases to Deal with Imprecise and Qualitative Temporal Information,” Proc. Int'l Workshop Recent Advances in Temporal Databases, 1995.
[5] H. Cao, O. Wolfson, and G. Trajcevski, “Spatio-Temporal Data Reduction with Deterministic Error Bound,” Very Large Data BasesJ., vol. 15, no. 3, 2006.
[6] R. Cavallo and M. Pittarelli, “The Theory of Probabilistic Databases,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 1987.
[7] X. Dai, M.L. Yiu, N. Mamoulis, Y. Tao, and Mi. Vaitis, “Probabilistic Spatial Queries on Existentially Uncertain Data,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD), 2005.
[8] N. Dalvi and D. Suciu, “Efficient Query Evaluation on Probabilistic Databases,” VLDB J., vol. 16, no. 4, 2007.
[9] A. Dekhtyar, R. Ross, and V.S. Subrahmanian, “Probabilistic Temporal Databases,” ACM Trans. Database Systems, vol. 26, no. 1, 2001.
[10] D. Dey and S. Sarkar, “A Probabilistic Relational Model and Algebra,” ACM Trans. Database Systems, vol. 21, no. 3, 1996.
[11] D. Dubois and H. Prade, “Processing Fuzzy Temporal Knowledge,” IEEE Trans. Systems, Man, and Cybernetics, vol. 19, no. 4, 1989.
[12] S. Dutta, “Generalized Events in Temporal Databases,” Proc. Fifth Int'l Conf. Data Eng. (ICDE), 1989.
[13] C. Dyreson and R. Snodgrass, “Supporting Valid-Time Indeterminacy,” ACM Trans. Database Systems, vol. 23, no. 1, 1998.
[14] T. Eiter, T. Lukasiewicz, and M. Walter, “A Data Model and Algebra for Probabilistic Complex Values,” Ann. Math. Artificial Intelligence, vol. 33, nos. 2-4, 2001.
[15] W. Faber, G. Greco, and N. Leone, “Magic Sets and Their Application to Data Integration,” J. Computer and System Sciences, vol. 73, no. 4, 2007.
[16] R. Fagin, J.Y. Halpern, and N. Megiddo, “A Logic for Reasoning About Probabilities, Information and Computation,” Information and Computation, vol. 87, no. 1/2, 1990.
[17] S. Gadia, S. Nair, and Y.C. Poon, “Incomplete Information in Relational Temporal Databases,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 1992.
[18] U. Guntzer, W. Kiessling, and H. Thone, “New Directions for Uncertainty Reasoning in Deductive Databases,” Proc. ACM SIGMOD, 1991.
[19] T. Hailperin, “Boole's Logic and Probability,” Studies in Logic and the Foundations of Math., vol. 85, 1976.
[20] T. Hammel, T.J. Rogers, and B. Yetso, “Fusing Live Sensor Data into Situational Multimedia Views,” Proc. Multimedia Information Systems (MIS), 2003.
[21] L.G. Khachiyan, A Polynomial Algorithm in Linear Programming. Doklady Akademia Nauk SSSR, 1979.
[22] M. Koubarakis, “Database Models for Infinite and Indefinite Temporal Information,” Information Systems, vol. 19, no. 2, 1994.
[23] V.S. Lakshmanan and F. Sadri, “Modeling Uncertainty in Deductive Databases,” Proc. Int'l Conf. Database and Expert Systems Applications (DEXA), 1994.
[24] V.S. Lakshmanan and N. Shiri, “A Parametric Approach with Deductive Databases with Uncertainty,” IEEE Trans. Knowledge and Data Eng., vol. 13, no. 4, July/Aug. 2001.
[25] T. Lukasiewicz, “Probabilistic Logic Programming with Conditional Constraints,” ACM Trans. Computational Logic, vol. 2, no. 3, 2001.
[26] T. Lukasiewicz, “Probabilistic Default Reasoning with Conditional Constraints,” Ann. Math. Artificial Intelligence, vol. 34, no. 1-3, 2002.
[27] O. Mar, A. Sarma, A. Halevy, and J. Widom, “ULDBs: Databases with Uncertainty and Lineage,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2006.
[28] R. Mittu and R. Ross, “Building upon the Coalitions Agent Experiment (COAX)—Integration of Multimedia Information in GCCS-M Using IMPACT,” Proc. Multimedia Information Systems (MIS), 2003.
[29] R. Ng and V.S. Subrahmanian, “Probabilistic Logic Programming,” Information and Computation, vol. 101, no. 2, 1993.
[30] A.J. Parker, V.S. Subrahmanian, and J. Grant, “A Logical Formulation of Probabilistic Spatial Databases,” IEEE Trans. Knowledge and Data Eng., vol. 19, no. 11, Nov. 2007.
[31] H. Samet, Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, 2006.
[32] Y. Tao, R. Cheng, X. Xiao, W.K. Ngai, B. Kao, and S. Prabhakar, “Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2005.
[33] W. Zhao, A. Dekhtyar, and J. Goldsmith, “Databases for Interval Probabilities,” Int'l J. Intelligent Systems, vol. 19, no. 9, 2004.
[34] Y. Tao, X. Xiao, and R. Cheng, “Range Search on Multidimensional Uncertain Data,” ACM Trans. Database Systems, vol. 32, no. 3, 2007.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool