Skip to main content
SpringerLink
Log in

Probabilistic nearest neighbor queries of uncertain data via wireless data broadcast

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Most existing location-dependent query processing methods are based on the client-server model. However, due to the increasing nubmer of smart mobile devices, there can be a large volume of data being processed on the server side and the server can be system performance bottleneck. This paper takes the first step towards processing probabilistic nearest neighbor queries of uncertain data objects via wireless data broadcast (BPNN). Our method leverages the key properties of Voronoi Diagrams for Uncertain Data (UV-Diagram). To preserve the good properties of UV-Diagram, according to the property of Hilbert curve, UV-Hilbert-Partition is proposed to partition the UV-Diagram into several grid cells, called Hilbert-Cells, which have good locality-preserving behavior. Then a special organizing method is proposed. For a certain UV-Diagram, the CellFrame structure, which can be located based on the coordinates of a query client, is used to efficiently minimize the broadcast cycle and keep the probabilistic nearest neighbor results. Based on the sequence of the CellFrames, a distributed index, called UVHilbert-DI, is proposed to support BPNN query processing. Finally, the efficient BPNN algorithms based on UVHilbert-DI is presented and extensive experiments have been conducted to demonstrate the performance of our approaches.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Berchtold S, Keim DA, Kriegel HP, Seidl T (2000) Indexing the solution space: a new technique for nearest neighbor search in high dimensional space. IEEE TKDE 12(1):45–57

    Google Scholar 

  2. Cheng R, Xie X, Yiu ML, Chen J, Sun L (2010) UV-diagram: a Voronoi diagram for uncertain data. In: ICDE

  3. Zheng B, Lee W-C, Lee DL, Lee CK, Shao M (2009) A distributed spatial index for error-prone wireless data broadcast. VLDB J 18:959–986

    Article  Google Scholar 

  4. Gotsman C, Lindenbaum M (1996) On the metric properties of discrete space-filling curves. IEEE Trans Image Process 5(5):794–797

    Article  Google Scholar 

  5. Imielinski T, Viswanathan S, Badrinath BR (1997) Data on air—organization and access. IEEE TKDE 9(3):353–372

    Google Scholar 

  6. Dalvi N, Suciu D (2004) Efficient query evaluation on probabilistic databases. In: VLDB

  7. Sistla P et al (1998) Querying the uncertain position of moving objects. In: Temporal databases: research and practice

  8. Cheng R, Xia Y, Prabhakar S, Shah R, Vitter JS (2004) Efficient indexing methods for probabilistic threshold queries over uncertain data. In: VLDB

  9. Ljosa V, Singh A (2007) APLA: indexing arbitrary probability distributions. In: ICDE

  10. Hua M, Pei J, Zhang W, Lin X (2008) Ranking queries on uncertain data: a probabilistic threshold approach. In: SIGMOD

  11. Cheng R, Kalashnikov DV, Prabhakar S (2004) Querying imprecise data in moving object environments. TKDE vol. 16, no. 9

  12. Cheng R, Chen J, Mokbel M, Chow C-Y (2008) Probabilistic verifiers: evaluating constrained nearest-neighbor queries over uncertain data. In: ICDE

  13. Kriegel H, Kunath P, Renz M (2007) Probabilistic nearest-neighbor query on uncertain objects. In: DASFAA

  14. Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proc SIGMOD pp 47–57

  15. Robinson JT (1981) The KDB tree: a search structure for large multidimentional dynamic indexes. In: Proc SIGMOD pp 10–18

  16. Samet H (1990) The design and analysis of spatial data structures. Addison-Wesley, Reading

    Google Scholar 

  17. Roussopoulos N, Kelley S, Vincent E (1995) Nearest neighbor queries. In: Proc SIGMOD pp 71–79

  18. Chen JK, Chin YH (1999) A concurrency control algorithm for nearest neighbor query. Inf Sci 114(1–4):187–204

    Article  Google Scholar 

  19. Prasad Sistla A, Wolfson O, Chamberlain S, Dao S (1997) Modeling and querying moving objects. In: Proc ICDE pp 422–432

  20. Song Z, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: Proc SSTD pp 79–96

  21. Zhang J, Zhu M, Papadias D, Tao Y, Lee DL (2003) Location-based spatial queries. In: Proc SIGMOD pp 443–454

  22. Zheng B, Lee DL (2001) Semantic caching in location dependent query processing. In: Proc SSTD pp 97–116

  23. Xiong X, Mokbel MF, Aref WG (2005) SEA-CNN: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: Proc ICDE pp 643–654

  24. Gao Y, Zheng B, Chen G, Li Q, Chen C, Chen G (2010) Efficient mutual nearest neighbor query processing for moving object trajectories. Inf Sci 180(11):2176–2195

    Article  Google Scholar 

  25. Zheng B, Lee W-C, Lee DL (2004) Search continuous nearest neighbors on the air. In: Proc MobiQuitous, pp 236–245

  26. Hambrusch SE, Liu E, Aref WG, Prabhakar S (2001) Query processing in broadcasted spatial index trees. In: SSTD, pp 502–521

  27. Park K, Song M, Hwang C-S (2006) Adaptive data dissemination schemes for location-aware mobile services. J Syst Softw 79(5):674–688

    Article  Google Scholar 

  28. Zheng B, Lee W-C, Lee DL (2007) On searching continuous k nearest neighbors in wireless data broadcast systems. IEEE Trans Mobible Comput 6(7):748–761

    Article  Google Scholar 

  29. Liu C-M, Shu-Yu F (2008) Effective protocols for knn search on broadcast multi-dimensional index trees. Inf Syst 33(1):18–35

    Article  Google Scholar 

  30. Park K, Choo H, Valduriez P (2010) A scalable energy-efficient continuous nearest neighbor search in wireless broadcast systems. In: Wireless Netw 1011–1031, 16, pp

  31. Lin S-Y, Chen C-S, Liu L, Huang C-H (2003) Tensor product formulation for Hilbert space-filling curves. icpp pp 99, 2003 International Conference on Parallel Processing (ICPP’03)

  32. Eutenegger STL, Edgington JM, Lopez MA (1997) STR: a simple and efficient algorithm for R-tree packing. In: Proceedings of the 13th International Conference on Data Engineering (ICDE’97), pp 497–506, April

Download references

Acknowledgements

The part of this work is supported by National Science Foundation with the granted project number 61173049.

Author information

Authors and Affiliations

  1. School of Computer Sci. & Tech., Huazhong University of Science and Technology, Wuhan, China

    Zhu Fangzhou, Li Guohui, Li Li & Zhao Xiaosong

  2. Wuhan Polytechnic University, Wuhan, China

    Zhang Cong

Authors
  1. Zhu Fangzhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li Guohui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Li Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhao Xiaosong
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Zhang Cong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhao Xiaosong.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fangzhou, Z., Guohui, L., Li, L. et al. Probabilistic nearest neighbor queries of uncertain data via wireless data broadcast. Peer-to-Peer Netw. Appl. 6, 363–379 (2013). https://doi.org/10.1007/s12083-013-0210-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-013-0210-x

Keywords

Search

Navigation