1 / 24

Yun Wen

FYTG 5101 Presentation Data Management For Spatio -temporal Data Of PM 2.5 Indices Through Mobile Sensing Type of This Project: Survey. Yun Wen. Outlines. Motivation ST Concepts and Models Storage Structure and Indexing. Reliable?. Project: Home Air Quality Sensor Network. CO, O 2 ,

althea
Télécharger la présentation

Yun Wen

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. FYTG 5101 PresentationData Management For Spatio-temporal Data Of PM 2.5 Indices Through Mobile SensingType of This Project: Survey Yun Wen

  2. Outlines • Motivation • ST Concepts and Models • Storage Structure and Indexing

  3. Reliable?

  4. Project: Home Air Quality Sensor Network CO, O2, PM2.5 Smoke, Temp Humidity +Electricity Consumption

  5. Spatiotemporal Data

  6. Spatiotemporal Data

  7. SpatioTemporalDataBase Management System • Temporal DBMS: existance time, valid-time, transaction-time • Spatial DBMS: GIS, environmental information system, trajectory and multimedia

  8. ER Temporal

  9. ER Spatial

  10. ER SpatioTemporal

  11. Storage Structure and Indexing 1D database indexing structures are not appropriate • Quad trees • K-D-B trees • R-tree • …..

  12. Quad tree

  13. Quad tree Type of Data: • region quadtree • point quadtree • Lines/curves quadtree Node Information: • Four pointers (NW,NE,SW,SE) • Point: key(x,y);value

  14. Quad tree Do not take paging of secondary memory into account Temporal: Linear Quadtree Improved: Overlapping Linear Quadtree

  15. K-D-B tree

  16. K-D-B tree Region pages (region,child) + point pages(point,location) • Same path length • Disjoint page • Union of all region in the child is region

  17. K-D-B tree Designed for paged memory, but are useful only for point data

  18. B+ tree

  19. R tree • A B+ tree

  20. R tree

  21. R tree Balanced-search tree Organize data in page Overlapped region n entries M maximum Variants: Hilbert R-tree X-tree R* tree, R+ tree

  22. Conclusion • All trees are important • Trade-off

More Related