Scaling Cautious Selection in Spatial Probabilistic Temporal Databases

  • Francesco Parisi
  • Austin Parker
  • John Grant
  • V. S. Subrahmanian
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 256)


SPOT databases have been proposed as a paradigm for efficiently reasoning about probabilistic spatio-temporal data. A selection query asks for all pairs of objects and times such that the object is within a query region with a probability within a stated probability interval. Two alternative semantics have been introduced for selection queries: optimistic and cautious selection.

It has been shown in past work that selection is characterized by a linear program whose solutions correspond to certain kinds of probability density functions (pdfs). In this chapter, we define a space called the SPOT PDF Space (SPS for short) and show that the space of solutions to a cautious selection query is a convex polytope in this space. This convex polytope can be approximated both by an interior region and a containing region. We show that both notions can be jointly used to prune the search space when answering a query. We report on experiments showing that cautious selection can be executed in about 4 seconds on databases containing 3 million SPOT atoms.


Convex Polytope Convex Region Convex Envelope Pruning Technique Deductive Database 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agarwal, P.K., Arge, L., Erickson, J.: Indexing moving points. Journal of Computer and System Sciences 66(1), 207–243 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Ball, K.: Ellipsoids of maximal volume in convex bodies. Geometriae Dedicata 41, 241–250 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Barbará, D., Garcia-Molina, H., Porter, D.: The management of probabilistic data. IEEE TKDE 4(5), 487–502 (1992)Google Scholar
  4. 4.
    Benjelloun, O., Sarma, A.D., Halevy, A.Y., Widom, J.: Uldbs: Databases with uncertainty and lineage. In: VLDB, pp. 953–964 (2006)Google Scholar
  5. 5.
    Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-tree: An Index Structure for High-Dimensional Data. In: VLBD (1996)Google Scholar
  6. 6.
    Cao, H., Wolfson, O., Trajcevski, G.: Spatio-temporal data reduction with deterministic error bounds. VLDB Journal 15, 211–228 (2006)CrossRefGoogle Scholar
  7. 7.
    Cavallo, R., Pittarelli, M.: The theory of probabilistic databases. In: VLDB, pp. 71–81 (1987)Google Scholar
  8. 8.
    Dai, X., Yiu, M.L., Mamoulis, N., Tao, Y., Vaitis, M.: Probabilistic spatial queries on existentially uncertain data. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 400–417. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Dalvi, N.N., Suciu, D.: Efficient query evaluation on probabilistic databases. VLDB J 16(4), 523–544 (2007)CrossRefGoogle Scholar
  10. 10.
    Dekhtyar, A., Dekhtyar, M.I.: Possible worlds semantics for probabilistic logic programs. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 137–148. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  11. 11.
    Dey, D., Sarkar, S.: A probabilistic relational model and algebra. ACM Trans. Database Syst. 21(3), 339–369 (1996)CrossRefGoogle Scholar
  12. 12.
    Eiter, T., Lukasiewicz, T., Walter, M.: A data model and algebra for probabilistic complex values. Ann. Math. Artif. Intell. 33(2-4), 205–252 (2001)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Fagin, R., Halpern, J.Y., Megiddo, N.: A logic for reasoning about probabilities. Inf. Comput. 87(1/2), 78–128 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Güntzer, U., Kiessling, W., Thöne, H.: New direction for uncertainty reasoning in deductive databases. In: SIGMOD 1991: Proceedings of the 1991 ACM SIGMOD international conference on Management of data, pp. 178–187. ACM, New York (1991), CrossRefGoogle Scholar
  15. 15.
    Hadjieleftheriou, M., Kollios, G., Tsotras, V.J., Gunopulos, D.: Efficient indexing of spatiotemporal objects. LNCS, pp. 251–268. Springer, Heidelberg (2002)Google Scholar
  16. 16.
    Hammel, T., Rogers, T.J., Yetso, B.: Fusing live sensor data into situational multimedia views. In: Multimedia Information Systems, pp. 145–156 (2003)Google Scholar
  17. 17.
    Jampani, R., Xu, F., Wu, M., Perez, L.L., Jermaine, C., Haas, P.J.: MCDB: a monte carlo approach to managing uncertain data. In: Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pp. 687–700. ACM, New York (2008)CrossRefGoogle Scholar
  18. 18.
    Kifer, M., Li, A.: On the semantics of rule-based expert systems with uncertainty. In: Gyssens, M., Van Gucht, D., Paredaens, J. (eds.) ICDT 1988. LNCS, vol. 326, pp. 102–117. Springer, Heidelberg (1988)Google Scholar
  19. 19.
    Koch, C., Olteanu, D.: Conditioning probabilistic databases. In: Proceedings of the VLDB Endowment archive, vol. 1(1), pp. 313–325 (2008)Google Scholar
  20. 20.
    Kollios, G., Gunopulos, D., Tsotras, V.J.: On indexing mobile objects. In: Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 261–272. ACM, New York (1999)CrossRefGoogle Scholar
  21. 21.
    Lakshmanan, L.V., Sadri, F.: Modeling uncertainty in deductive databases. In: Karagiannis, D. (ed.) DEXA 1994. LNCS, vol. 856, pp. 724–733. Springer, Heidelberg (1994)Google Scholar
  22. 22.
    Lakshmanan, L.V.S., Shiri, N.: A parametric approach to deductive databases with uncertainty. IEEE Trans. on Knowl. and Data Eng. 13(4), 554–570 (2001)CrossRefGoogle Scholar
  23. 23.
    Lian, X., Chen, L.: Probabilistic group nearest neighbor queries in uncertain databases. IEEE Transactions on Knowledge and Data Engineering 20(6), 809–824 (2008), CrossRefGoogle Scholar
  24. 24.
    Lukasiewicz, T.: Probabilistic logic programming. In: ECAI, pp. 388–392 (1998)Google Scholar
  25. 25.
    Lukasiewicz, T., Kern-Isberner, G.: Probabilistic logic programming under maximum entropy. In: Hunter, A., Parsons, S. (eds.) ECSQARU 1999. LNCS (LNAI), vol. 1638, p. 279. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  26. 26.
    Mittu, R., Ross, R.: Building upon the coalitions agent experiment (coax) - integration of multimedia information in gccs-m using impact. In: Multimedia Information Systems, pp. 35–44 (2003)Google Scholar
  27. 27.
    Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Information and Computation 101(2), 150–201 (1992), zbMATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    Ni, J., Ravishankar, C.V., Bhanu, B.: Probabilistic spatial database operations. In: Advances in Spatial and Temporal Databases: 8th International Symposium, Santorini Island, Greece (2003)Google Scholar
  29. 29.
    Parker, A., Infantes, G., Grant, J., Subrahmanian, V.S.: Spot databases: Efficient consistency checking and optimistic selection in probabilistic spatial databases. IEEE TKDE 21(1), 92–107 (2009)Google Scholar
  30. 30.
    Parker, A., Subrahmanian, V.S., Grant, J.: A logical formulation of probabilistic spatial databases. IEEE TKDE, 1541–1556 (2007)Google Scholar
  31. 31.
    Pelanis, M., Saltenis, S., Jensen, C.S.: Indexing the past, present, and anticipated future positions of moving objects. ACM Trans. Database Syst. 31(1), 255–298 (2006)CrossRefGoogle Scholar
  32. 32.
    Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel approaches to the indexing of moving object trajectories. In: Proceedings of VLDB (2000)Google Scholar
  33. 33.
    Pittarelli, M.: An algebra for probabilistic databases. IEEE TKDE 6(2), 293–303 (1994)Google Scholar
  34. 34.
    Sellis, T., Roussopoulos, N., Faloutsos, C.: The R+-tree: A Dynamic Index for Multi-Dimensional Objects. In: VLBD (1987)Google Scholar
  35. 35.
    Tao, Y., Cheng, R., Xiao, X., Ngai, W.K., Kao, B., Prabhakar, S.: Indexing multi-dimensional uncertain data with arbitrary probability density functions. In: VLDB, pp. 922–933 (2005)Google Scholar
  36. 36.
    Tao, Y., Papadias, D., Sun, J.: The TPR*-tree: an optimized spatio-temporal access method for predictive queries. In: Proceedings of the 29th international conference on Very large data bases-VLDB Endowment, vol. 29, pp. 790–801 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Francesco Parisi
    • 1
  • Austin Parker
    • 2
  • John Grant
    • 2
    • 3
  • V. S. Subrahmanian
    • 2
  1. 1.Università della CalabriaRendeItaly
  2. 2.University of MarylandCollege ParkUSA
  3. 3.Towson UniversityTowsonUSA

Personalised recommendations