Querying imprecise data in moving object environment
Download
1 / 30

QUERYING IMPRECISE DATA IN MOVING OBJECT ENVIRONMENT - PowerPoint PPT Presentation


  • 316 Views
  • Uploaded on

REYNOLD CHENG. DMITRI V.KALASHNIKOV. SUNIL PRABHAKAR. PRESENTED BY: ... Example: If there is a time delay between capture of location and its script at ...

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'QUERYING IMPRECISE DATA IN MOVING OBJECT ENVIRONMENT' - Kelvin_Ajay


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Querying imprecise data in moving object environment l.jpg

QUERYING IMPRECISE DATA IN MOVING OBJECT ENVIRONMENT

REYNOLD CHENG

DMITRI V.KALASHNIKOV

SUNIL PRABHAKAR

PRESENTED BY:

VISHNU VANDANA.DANDU


Abstract l.jpg
ABSTRACT

  • Data uncertainty

  • Probabilistic Queries

  • Range Queries

  • Nearest Neighbor Queries


Introduction l.jpg
INTRODUCTION

  • Systems for continues monitoring or tracking of mobile objects receive updated locations of objects as they move in space.

  • Due to limitations of the bandwidth and battery power of mobile devices, it is infeasible for database tracking the movement of object.

    Example: If there is a time delay between capture of location and its script at database, location values received by object may be different from actual locations.


Slide4 l.jpg

This can be explained using

  • Nearest Neighbor Query.(1a)

  • Range Queries.(1b)


Slide5 l.jpg

Fig. 1. (a) A nearest-neighbor query for a point q can yield false results

by using the data values stored in the database. (b) Imprecision can be

used to provide answers with guaranteed certainty.


Contributions of this paper l.jpg
Contributions of this paper: false results

  • Formal notation of probabilistic nearest neighbor queries,

  • Algorithm for answering probabilistic nearest neighbor queries under a general model of uncertainty,

  • Solutions to probabilistic nearest neighbor queries for two of the most important moving –object models,

  • Methods for efficient execution of algorithms


Uncertainity model and probabilistic queries l.jpg
UNCERTAINITY MODEL AND PROBABILISTIC QUERIES false results

Uncertainity of an object can be characterized as:

  • Definition 1. An uncertainty region of an object Oi at time t, denoted by Ui(t), is a closed region such that Oi can be found only inside this region.

  • Definition 2. The uncertainty probability density function of an object Oi, denoted by fi(x; y; t), is a probability density function of Oi’s location (x; y) at time t, that has a value of 0 outside Ui(t).


Definition 3 probabilistic range query prq l.jpg
Definition 3: Probabilistic Range Query (PRQ). false results

Given a closed region R and a set of n objects O1;O2; . . .;On with uncertainty regions and probability density functions at time t0, a PRQ returns a set of tuples in the form of (Oi; pi), where pi is the nonzero probability that Oi is located inside R at time t0.


Definition 4 probabilistic nearest neighbor query pnnq l.jpg
Definition 4: Probabilistic Nearest-Neighbor Query (PNNQ). false results

For a set of n objects O1;O2; . . .;On with uncertainty regions and probability density functions given at time t0, a PNNQ for a point q is a query that returns a set of tuples of the form (Oi; pi), where pi is the nonzero probability that Oi is the nearest neighbor of q at time t0.


Example l.jpg
EXAMPLE: false results


Evaluating queries for imprecise data l.jpg
EVALUATING QUERIES FOR IMPRECISE DATA false results

EVALUATION OF PRQ:

A PRQ returns a set of tuples (Oi; pi), where pi is the nonzero probability that object Oi is located in the query region R at time t0.

Let S=(O1; . . O|S|) be the set of all moving objects that have to be considered by the PRQ and let X be the set of tuples returned by the PRQ.

The algorithm for evaluating the PRQ at time t0 is described in Fig. 3, which basically integrates the probability distribution function in the overlapping

area of Ui(t0) and R to compute pi.


Prq algorithm l.jpg
PRQ ALGORITHM false results


Evaluation of pnnq l.jpg
EVALUATION OF PNNQ: false results

The solution consists of 4 four steps:

  • Projection phase

  • Pruning phase

  • Bounding phase

  • Evaluation phase


Example14 l.jpg
EXAMPLE: false results

Fig. 4. An example of a PNNQ processing: (a) Locations of objects, (b) uncertainty regions and distances from q, (c) bounding circle, and (d) bounded

regions.




Querying with line segment and free moving uncertainity l.jpg
QUERYING WITH LINE SEGMENT AND FREE MOVING UNCERTAINITY false results

Two important types of uncertainty are:

  • Line-Segment Uncertainity

  • Free-Moving Uncertainity


Examples l.jpg
Examples: false results

Example of uncertainty model under the assumption that objects specify a maximum speed with each update. (a) Line-moving objects. (b) The uncertainty regions of objects a, b. (c) Free-moving objects. (d) The uncertainty regions of objects a, b, and c.


Prq for line segment and free moving uncertainty l.jpg
PRQ FOR LINE SEGMENT AND FREE-MOVING UNCERTAINTY false results

  • Line moving uncertainty:

    Pi= length of Ui(t0) that overlaps R

    length of Ui(t0)

  • Free Moving uncertainty:

    Pi=area of Ui(t0) that overlaps R

    area of Ui(t0)


Pnnq for line segment and free moving uncertainty l.jpg
PNNQ FOR LINE SEGMENT AND FREE MOVING UNCERTAINTY : false results

  • The parameters that need to be found to adapt the generic PNNQ solution to a particular uncertainty model for every object Oi are:

  • Ui(t0) and fi(x,y,t0),

  • Ni and fi, the shortest and longest distance of Ui(t0) from q, respectively and

  • Pi(r) and pri(r)


Parameterizing generic pnnq solution for line segment uncertainty l.jpg
Parameterizing Generic PNNQ Solution for Line segment Uncertainty:

  • Obtaining ni and fi

  • Obtaining Pi(r) and pri(r)

    which is given by

    Pi(r)= length of Ui(t0) inside Cq(r)

    Length of Ui(t0)


Parametizing generic pnnq solution for free moving uncertainty l.jpg
Parametizing Generic PNNQ Solution for free-Moving Uncertainty

  • In this case we can obtain Pi(r)

    as

    Pi(r)=Overlapping area of Cq(r) andUi(t0)

    Area of Ui(t0)


Efficient query processing l.jpg
Efficient Query Processing: Uncertainty

  • Efficient execution of the Pruning Phase Using VCI

  • Efficient Execution of the Evaluation Phase.


Performance studies l.jpg
PERFORMANCE STUDIES: Uncertainty

  • Simulation Model(Parameters used)



Performance results l.jpg
PERFORMANCE RESULTS: Uncertainty

  • Effect of €

  • PNNQ versus NNQ_old

Quality of PNNQ versus uncertainty.

Execution time versus uncertainty.



Related work l.jpg
RELATED WORK: Uncertainty

  • Future Temporal Logic (FTL)

    Spatio-temporal Query language

  • Pfoser and Jensen’s Uncertainty model

    (I) possible semantics

    (II) surely semantics

    (III) probably semantics

  • Dynamic Query


Conclusion l.jpg
CONCLUSION: Uncertainty

  • Defined Generic Model of uncertainty

  • Presented algorithms

  • Evaluation of Queries

  • Uncertainty Models


Slide30 l.jpg

THANK YOU Uncertainty