Synonyms
Probability treshold indexing; Spatial data indexing with uncertainty
Definition
The Probabilistic Threshold Indexing (PTI) method enables efficient query evaluation of a vast amount of spatial data that are inherently uncertain. Spatial data uncertainty is common in Location-Based Services (LBS), where the positions of users are acquired and queried for providing services. These location data are often imprecise due to measurement error, sampling error, or message delay. A user may also want to protect his/her privacy by providing a less precise location. These sources of data uncertainty have to be considered in order to avoid drawing erroneous conclusions about the data being queried.
Recently, a probabilistic query has been proposed to evaluate data uncertainty. This query returns probabilistic guarantees that specify the likeliness that an object satisfies the query. The PTI supports a variant of probabilistic queries, called probability threshold queries, which return...
Notes
- 1.
If \( U_0 \) and R are m-sided and n-sided polygons, the Minkowski Sum is a convex polygon with at most \( m+e \) edges, which requires \( O(m+e) \) time to compute [3].
Recommended Reading
Almeida, V., Güüting, R.: Supporting uncertainty in moving objects in network databases. In: Proc. GIS, 2005
Beresford, A.R., Stajano, F.: Location Privacy in Pervasive Computing. IEEE Pervasive Computing, 2(1) (2003)
Berg, M., Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry – Algorithms and Applications, 2nd edn. Springer Verlag (2000)
Chen J., Cheng, R.: Efficient evaluation of imprecise location‐dependent queries. In: Proc. IEEE ICDE, 2007
Cheng, R., Kalashnikov, D., Prabhakar, S.: Evaluating probabilistic queries over imprecise data. In: Proc. ACM SIGMOD, 2003
Cheng, R., Kalashnikov, D.V., Prabhakar, S.: Querying imprecise data in moving object environments. IEEE TKDE, 16(9), September 2004
Cheng, R., Singh, S., Prabhakar, S.: U-DBMS: An uncertainty database management system. In: Proc. VLDB, 2004
Cheng, R., Singh, S., Prabhakar, S., Shah, R., Vitter, J., Xia, Y.: Efficient join processing over uncertain data. In: Proc. ACM CIKM, 2006
Cheng, R., Xia, Y., Prabhakar, S., Shah, R., Vitter, J.S.: Efficient indexing methods for probabilistic threshold queries over uncertain data. In: Proc. VLDB, 2004
Cheng, R., Zhang, Y., Bertino, E., Prabhakar, S.: Preserving user location privacy in mobile data management infrastructures. In: Proc. of the 6th Workshop on Privacy Enhancing Technologies, June 2006
Pfoser D., Jensen, C.: Capturing the uncertainty of moving‐objects representations. In: Proc. SSDBM, 1999
Gedik B., Liu, L.: Mobieyes: Distributed processing of continuously moving queries on moving objects in a mobile system. In: EDBT, 2004
Gedik B., Liu, L.: A customizable k-anonymity model for protecting location privacy. In: ICDCS, 2005
Guttman, A.: R‑trees: A dynamic index structure for spatial searching. Proc. of the ACM SIGMOD Int'l. Conf., 1984
Hu H., Lee, D.: Range nearest‐neighbor query. IEEE TKDE, 18(1), 2006
Ilarri, S., Mena, E., Illarramendi, A.: Location‐dependent queries in mobile contexts: Distributed processing using mobile agents. ACM TMC, 5(8), August 2006
Kriegel, H., Potke, M., Seidl, T.: Managing intervals efficiently in object‐relational databases. In: VLDB, 2000
Lee, D., Xu, J., Zheng, B.: Data management in location‐dependent information services. IEEE Pervasive Computing, 1(3), 2002
Manolopoulos, Y., Theodoridis, Y., Tsotras, V.: Chapter 4: Access methods for intervals. In: Advanced Database Indexing. Kluwer, 2000
Matousek, J.: Geometric range searching. ACM Computing Survey, 26(4), 1994
Mokbel, M.F., Chow, C.-Y., Aref, W.G.: The new casper: Query processing for location services without compromising privacy. In: VLDB, 2006
Singh, S., Mayfield, C., Cheng, R., Prabhakar, S.: The ORION database (http://www.orion.cs.purdue.edu)
Sistla, P.A., Wolfson, O., Chamberlain, S., Dao, S.: Querying the uncertain position of moving objects. In: Temporal Databases: Research and Practice. (1998)
Song Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Proc. SSTD, 2001
Tao, Y., Cheng, R., Xiao, X., Ngai, W.K., Kao, B., Prabhakar, S.: Indexing multi‐dimensional uncertain data with arbitrary probability density functions. In: Proc. VLDB, 2005
Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: Proc. VLDB, 2002
Warrior, J., McHenry, E., McGee, K.: They know where you are. Spectrum, 40(7):20–25, July 2003
Widom, J.: Trio: A system for integrated management of data, accuracy, and lineage. In: Proc. CIDR, 2005
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Cheng, R. (2008). Spatial Data, Indexing Techniques. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_1255
Download citation
DOI: https://doi.org/10.1007/978-0-387-35973-1_1255
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30858-6
Online ISBN: 978-0-387-35973-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering