Skip to main content
SpringerLink
Log in
Book cover

Methods for Handling Imperfect Spatial Information pp 307–340Cite as

Scaling Cautious Selection in Spatial Probabilistic Temporal Databases

  • Chapter

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 256))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P.K., Arge, L., Erickson, J.: Indexing moving points. Journal of Computer and System Sciences 66(1), 207–243 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ball, K.: Ellipsoids of maximal volume in convex bodies. Geometriae Dedicata 41, 241–250 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Barbará, D., Garcia-Molina, H., Porter, D.: The management of probabilistic data. IEEE TKDE 4(5), 487–502 (1992)

    Google Scholar 

  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. Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-tree: An Index Structure for High-Dimensional Data. In: VLBD (1996)

    Google Scholar 

  6. Cao, H., Wolfson, O., Trajcevski, G.: Spatio-temporal data reduction with deterministic error bounds. VLDB Journal 15, 211–228 (2006)

    Article  Google Scholar 

  7. Cavallo, R., Pittarelli, M.: The theory of probabilistic databases. In: VLDB, pp. 71–81 (1987)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  9. Dalvi, N.N., Suciu, D.: Efficient query evaluation on probabilistic databases. VLDB J 16(4), 523–544 (2007)

    Article  Google Scholar 

  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)

    Chapter  Google Scholar 

  11. Dey, D., Sarkar, S.: A probabilistic relational model and algebra. ACM Trans. Database Syst. 21(3), 339–369 (1996)

    Article  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  13. Fagin, R., Halpern, J.Y., Megiddo, N.: A logic for reasoning about probabilities. Inf. Comput. 87(1/2), 78–128 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  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), http://doi.acm.org/10.1145/115790.115815

    Chapter  Google Scholar 

  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. 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. 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)

    Chapter  Google Scholar 

  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. Koch, C., Olteanu, D.: Conditioning probabilistic databases. In: Proceedings of the VLDB Endowment archive, vol. 1(1), pp. 313–325 (2008)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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. 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)

    Article  Google Scholar 

  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), http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.41

    Article  Google Scholar 

  24. Lukasiewicz, T.: Probabilistic logic programming. In: ECAI, pp. 388–392 (1998)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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. Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Information and Computation 101(2), 150–201 (1992), citeseer.csail.mit.edu/ng92probabilistic.html

    Article  MATH  MathSciNet  Google Scholar 

  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. 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. Parker, A., Subrahmanian, V.S., Grant, J.: A logical formulation of probabilistic spatial databases. IEEE TKDE, 1541–1556 (2007)

    Google Scholar 

  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)

    Article  Google Scholar 

  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. Pittarelli, M.: An algebra for probabilistic databases. IEEE TKDE 6(2), 293–303 (1994)

    Google Scholar 

  34. Sellis, T., Roussopoulos, N., Faloutsos, C.: The R+-tree: A Dynamic Index for Multi-Dimensional Objects. In: VLBD (1987)

    Google Scholar 

  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. 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 

Download references

Author information

Authors and Affiliations

  1. Università della Calabria, Rende, CS, Italy

    Francesco Parisi

  2. University of Maryland, College Park, Maryland, USA

    Austin Parker, John Grant & V. S. Subrahmanian

  3. Towson University, Towson, Maryland, USA

    John Grant

Authors
  1. Francesco Parisi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Austin Parker
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. John Grant
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. V. S. Subrahmanian
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IGM Université Paris Est, Champs-sur-Marne, France

    Robert Jeansoulin

  2. LSIS UMR CNRS, Marseille, France

    Odile Papini

  3. Université Paul Sabatier, Toulouse, France

    Henri Prade

  4. Ghent University, Ghent, Belgium

    Steven Schockaert

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Parisi, F., Parker, A., Grant, J., Subrahmanian, V.S. (2010). Scaling Cautious Selection in Spatial Probabilistic Temporal Databases. In: Jeansoulin, R., Papini, O., Prade, H., Schockaert, S. (eds) Methods for Handling Imperfect Spatial Information. Studies in Fuzziness and Soft Computing, vol 256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14755-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14755-5_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14754-8

  • Online ISBN: 978-3-642-14755-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation