W arehousing and Querying Trajectory Data Stream s W ith Error - - PowerPoint PPT Presentation

w arehousing and querying trajectory data stream s w ith
SMART_READER_LITE
LIVE PREVIEW

W arehousing and Querying Trajectory Data Stream s W ith Error - - PowerPoint PPT Presentation

W arehousing and Querying Trajectory Data Stream s W ith Error Estim ation Elio Masciari I CAR-CNR DOLAP MAUI 2 Novem ber 2 0 1 2 Trajectory Data Prime Numbers Encoding for Paths Warehousing Steps Experimental Evaluation


slide-1
SLIDE 1

W arehousing and Querying Trajectory Data Stream s W ith Error Estim ation

Elio Masciari I CAR-CNR

DOLAP MAUI 2 Novem ber 2 0 1 2

slide-2
SLIDE 2

Outline

 Trajectory Data  Prime Numbers Encoding for Paths  Warehousing Steps  Experimental Evaluation  Conclusions

slide-3
SLIDE 3

Trajectory Data

 Data Pertaining to time and position of

moving objects

  • GPS systems
  • Traffic management

 Two dimensional

  • In general partitioning is a well accepted

solution

 Segmentation  Regioning

slide-4
SLIDE 4

Trajectory Data

slide-5
SLIDE 5

Our Solution: Regioning+ Encoding

 Regioning

  • IPCA: Identifies Preferred Directions for Data
  • Differential Regioning

 Prime Number Encoding:

  • Trajectories represented as products of prime

numbers

slide-6
SLIDE 6

Regioning: regions close to principal directions are finer

slide-7
SLIDE 7

Encoding: prim e num bers

 T1 = ABC crossing three regions A,B,C.

Assign to regions A, B and C respectively the prime numbers 3,5,7

 For trajectory T1 the witness W1 is 52

since 52% 3 = 1 = pos(A) and 52% 5 = 2 = pos(B) and 52% 7 = 3 = pos(C)

 Store the encoded trajectories using a

binary tree

slide-8
SLIDE 8

Trajectory W arehousing

 Building Specialized cuboids: TRAC

  • Distinct Count Problem

 Measures

  • the number of distinct trajectories

(Intersections),

  • the average traveled distance (Distance),
  • the average time interval duration (Duration)
slide-9
SLIDE 9

TRACs

 Precomputed cuboids pertaining to most

interesting recent data

 Merging cuboids at different granularity

levels when needed

 Iceberg assumption

slide-10
SLIDE 10

Perform ances

slide-11
SLIDE 11

Perform ances

slide-12
SLIDE 12

Perform ances

slide-13
SLIDE 13

Perform ances

slide-14
SLIDE 14

Conclusions

 Data reduction by regioning  Efficient Queying via Encoding  Warehousing in order to allow trajectory

querying effectively

 Good performances

  • Accuracy
  • Efficiency