FYTG 5101 Presentation Data Management For Spatio-temporal Data Of PM 2.5 Indices Through Mobile Sensing Type of This Project: Survey Yun Wen.

Slides:



Advertisements
Similar presentations
1 DATA STRUCTURES USED IN SPATIAL DATA MINING. 2 What is Spatial data ? broadly be defined as data which covers multidimensional points, lines, rectangles,
Advertisements

Index Dennis Shasha and Philippe Bonnet, 2013.
February 12, 2007 WALCOM '2007 1/22 DiskTrie: An Efficient Data Structure Using Flash Memory for Mobile Devices N. M. Mosharaf Kabir Chowdhury Md. Mostofa.
Spatial Data Structures Hanan Samet Computer Science Department
Indexing and Range Queries in Spatio-Temporal Databases
A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects.
Access Methods for Advanced Database Applications.
Indexing Network Voronoi Diagrams*
2-dimensional indexing structure
Quad-tree University of Winnipeg Quad-tree Prepared By Tariq Alusaifeer Prepared For Professor/ Yangjun Chen March, 2010.
--Presented By Sudheer Chelluboina. Professor: Dr.Maggie Dunham.
Multiple-key indexes Index on one attribute provides pointer to an index on the other. If V is a value of the first attribute, then the index we reach.
Spatio-Temporal Databases
Fall 2000CS 599 – Spatial and Temporal Databases Research Issues in Spatio- temporal Database Systems Timos Sellis Presented by Handy Patriawan.
ACM GIS An Interactive Framework for Raster Data Spatial Joins Wan Bae (Computer Science, University of Denver) Petr Vojtěchovský (Mathematics,
Computer Science Spatio-Temporal Aggregation Using Sketches Yufei Tao, George Kollios, Jeffrey Considine, Feifei Li, Dimitris Papadias Department of Computer.
Spatio-Temporal Databases. Outline Spatial Databases Temporal Databases Spatio-temporal Databases Multimedia Databases …..
Spatial Information Systems (SIS) COMP Spatial access methods: Indexing.
Indexing of Network Constrained Moving Objects Dieter Pfoser Christian S. Jensen Chia-Yu Chang.
©Silberschatz, Korth and Sudarshan23.1Database System Concepts 1 Temporal and Spatial Data Transaction systems  Relational DB  OO DB  OR DB Decision.
A New Point Access Method based on Wavelet Trees Nieves R. Brisaboa, Miguel R. Luaces, Diego Seco Database Laboratory University of A Coruña A Coruña,
Chapter 3: Data Storage and Access Methods
Spatial Indexing I Point Access Methods.
An Incremental Refining Spatial Join Algorithm for Estimating Query Results in GIS Wan D. Bae, Shayma Alkobaisi, Scott T. Leutenegger Department of Computer.
R-Trees 2-dimensional indexing structure. R-trees 2-dimensional version of the B-tree: B-tree of maximum degree 8; degree between 3 and 8 Internal nodes.
Indexing Spatio-Temporal Data Warehouses Dimitris Papadias, Yufei Tao, Panos Kalnis, Jun Zhang Department of Computer Science Hong Kong University of Science.
Trip Planning Queries F. Li, D. Cheng, M. Hadjieleftheriou, G. Kollios, S.-H. Teng Boston University.
Spatio-Temporal Databases. Outline Spatial Databases Temporal Databases Spatio-temporal Databases Multimedia Databases …..
Spatial Information Systems (SIS) COMP Spatial access methods: Indexing (part 2)
Graphics Application Lab Myoung-Ah Kang, Sylvie Servigne,Ki-Joune Li, Robert Laurini CIKM’ 99 Kim Hyong-Jun, Yoon Tai-Jin GA Lab. Indexing Field Values.
Moving Objects Databases Nilanshu Dharma Shalva Singh.
Data Structure and access method Fan Zhang Zhiqi Chen.
R-Trees: A Dynamic Index Structure for Spatial Data Antonin Guttman.
Trees for spatial indexing
Improving Min/Max Aggregation over Spatial Objects Donghui Zhang, Vassilis J. Tsotras University of California, Riverside ACM GIS’01.
AAU A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing Presented by YuQing Zhang  Slobodan Rasetic Jorg Sander James Elding Mario A.
Spatial Data Management Chapter 28. Types of Spatial Data Point Data –Points in a multidimensional space E.g., Raster data such as satellite imagery,
KNR-tree: A novel R-tree-based index for facilitating Spatial Window Queries on any k relations among N spatial relations in Mobile environments ANIRBAN.
Characterizing activity in video shots based on salient points Nicolas Moënne-Loccoz Viper group Computer vision & multimedia laboratory University of.
The X-Tree An Index Structure for High Dimensional Data Stefan Berchtold, Daniel A Keim, Hans Peter Kriegel Institute of Computer Science Munich, Germany.
Indexing for Multidimensional Data An Introduction.
Database System Concepts ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com 1 Indexing Spatial Data.
Universität Stuttgart Institute of Parallel and Distributed Systems (IPVS) Universitätsstraße 38 D Stuttgart Scalable Processing of Trajectory-Based.
Multidimensional Indexes Applications: geographical databases, data cubes. Types of queries: –partial match (give only a subset of the dimensions) –range.
Indexing.
Indexing for Multidimensional Data An Introduction.
DIST: A Distributed Spatio-temporal Index Structure for Sensor Networks Anand Meka and Ambuj Singh UCSB, 2005.
Antonin Guttman In Proceedings of the 1984 ACM SIGMOD international conference on Management of data (SIGMOD '84). ACM, New York, NY, USA.
Jaruloj Chongstitvatana Advanced Data Structures 1 Index Structures for Multimedia Data Feature-based Approach.
Spatial and Geographic Databases ADVANCED DATABASES Khawaja Mohiuddin Assistant Professor Department of Computer Sciences Bahria University (Karachi Campus)
A New Spatial Index Structure for Efficient Query Processing in Location Based Services Speaker: Yihao Jhang Adviser: Yuling Hsueh 2010 IEEE International.
Spatial and Geographic Databases. Spatial databases store information related to spatial locations, and support efficient storage, indexing and querying.
Spatial Indexing Techniques Introduction to Spatial Computing CSE 5ISC Some slides adapted from Spatial Databases: A Tour by Shashi Shekhar Prentice Hall.
The Present. Outline Index structures for in-memory Quad trees kd trees Index structures for databases kdB trees Grid files II. Index Structure.
Efficient OLAP Operations in Spatial Data Warehouses Dimitris Papadias, Panos Kalnis, Jun Zhang and Yufei Tao Department of Computer Science Hong Kong.
1 CSIS 7101: CSIS 7101: Spatial Data (Part 1) The R*-tree : An Efficient and Robust Access Method for Points and Rectangles Rollo Chan Chu Chung Man Mak.
R* Tree By Rohan Sadale Akshay Kulkarni.  Motivation  Optimization criteria for R* Tree  High level Algorithm  Example  Performance Agenda.
A Spatial Index Structure for High Dimensional Point Data Wei Wang, Jiong Yang, and Richard Muntz Data Mining Lab Department of Computer Science University.
Spatio-Temporal Databases. Term Project Groups of 2 students You can take a look on some project ideas from here:
Rethinking Choices for Multi-dimensional Point Indexing You Jung Kim and Jignesh M. Patel University of Michigan.
1 Similarity aware query processing in sensor networks PingXia, PanosK.Chrysanthis, and AlexandrosLabrinidis Proceedings of the 14th International Workshop.
Multidimensional Access Methods Ho Hoang Nguyen Nguyen Thanh Trong Dao Vu Quoc Trung Ngo Phuoc Huong Thien DATABASE.
On the air pollution abatement in Thessaloniki Dr. Kostas Nikolaou Chemist - Environmentalist  Organization for the Master Plan and Environmental Protection.
Jeremy Iverson & Zhang Yun 1.  Chapter 6 Key Concepts ◦ Structures and access methods ◦ R-Tree  R*-Tree  Mobile Object Indexing  Questions 2.
Indexing Goals: Store large files Support multiple search keys
The Quad tree The index is represented as a quaternary tree
15-826: Multimedia Databases and Data Mining
Spatio-Temporal Databases
Outline Ganesan, D., Greenstein, B., Estrin, D., Heidemann, J., and Govindan, R. Multiresolution storage and search in sensor networks. Trans. Storage.
Continuous Motion Pattern Query
Presentation transcript:

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, PM2.5 Smoke, Temp Humidity +Electricity Consumption

Spatiotemporal Data

SpatioTemporal DataBase Management System Temporal DBMS: existance time, valid-time, transaction-time Spatial DBMS: GIS, environmental information system, trajectory and multimedia

ER Temporal

ER Spatial

ER SpatioTemporal

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

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

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

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

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

B+ tree

R tree A B+ tree

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

Conclusion All trees are important Trade-off