--Presented By Sudheer Chelluboina. Professor: Dr.Maggie Dunham.

Slides:



Advertisements
Similar presentations
Indexing DNA Sequences Using q-Grams
Advertisements

CpSc 3220 File and Database Processing Lecture 17 Indexed Files.
Evaluating “find a path” reachability queries P. Bouros 1, T. Dalamagas 2, S.Skiadopoulos 3, T. Sellis 1,2 1 National Technical University of Athens 2.
External Memory Hashing. Model of Computation Data stored on disk(s) Minimum transfer unit: a page = b bytes or B records (or block) N records -> N/B.
Indexing and Range Queries in Spatio-Temporal Databases
Yoshiharu Ishikawa (Nagoya University) Yoji Machida (University of Tsukuba) Hiroyuki Kitagawa (University of Tsukuba) A Dynamic Mobility Histogram Construction.
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
Spatial Mining.
Spatio-Temporal Databases
Themis Palpanas1 VLDB - Aug 2004 Fair Use Agreement This agreement covers the use of all slides on this CD-Rom, please read carefully. You may freely use.
Temporal Databases. Outline Spatial Databases Indexing, Query processing Temporal Databases Spatio-temporal ….
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 …..
Spatio-Temporal Databases. Introduction Spatiotemporal Databases: manage spatial data whose geometry changes over time Geometry: position and/or extent.
Temporal Databases. Outline Spatial Databases Indexing, Query processing Temporal Databases Spatio-temporal ….
Spatial Information Systems (SIS) COMP Spatial access methods: Indexing.
Indexing of Network Constrained Moving Objects Dieter Pfoser Christian S. Jensen Chia-Yu Chang.
Dieter Pfoser, LBS Workshop1 Issues in the Management of Moving Point Objects Dieter Pfoser Nykredit Center for Database Research Aalborg University, Denmark.
Chapter 3: Data Storage and Access Methods
1. 2 General problem Retrieval of time-series similar to a given pattern.
Spatio-Temporal Databases. Introduction Spatiotemporal Databases: manage spatial data whose geometry changes over time Geometry: position and/or extent.
Efficient Join Processing over Uncertain Data - By Reynold Cheng, et all. Presented By Lydia & Usha.
The Tornado Model: Uncertainty Model for Continuously Changing Data Byunggu Yu 1, Seon Ho Kim 2, Shayma Alkobaisi 2, Wan Bae 2, Thomas Bailey 3 Department.
Spatio-Temporal Databases. Outline Spatial Databases Temporal Databases Spatio-temporal Databases Multimedia Databases …..
Spatial Database Systems. Spatial Database Applications GIS applications (maps): Urban planning, route optimization, fire or pollution monitoring, utility.
1 Indexing Large Trajectory Data Sets With SETI V.Prasad Chakka Adam C.Everspaugh Jignesh M.Patel University of Michigan Presented by Guangyue Jia.
Moving Objects Databases Nilanshu Dharma Shalva Singh.
Sensor Networks Storage Sanket Totala Sudarshan Jagannathan.
Database and Data-Intensive Systems. Data-Intensive Systems From monolithic architectures to diverse systems Dedicated/specialized systems, column stores.
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.
The X-Tree An Index Structure for High Dimensional Data Stefan Berchtold, Daniel A Keim, Hans Peter Kriegel Institute of Computer Science Munich, Germany.
AAU Novel Approaches to the Indexing of Moving Object Trajectories Presented by YuQing Zhang  Dieter Pfoser Christian S. Jensen Yannis Theodoridis.
Universität Stuttgart Institute of Parallel and Distributed Systems (IPVS) Universitätsstraße 38 D Stuttgart Scalable Processing of Trajectory-Based.
Handling Spatial Data In P2P Systems Verena Kantere, Timos Sellis, Yannis Kouvaras.
A Query Adaptive Data Structure for Efficient Indexing of Time Series Databases Presented by Stavros Papadopoulos.
Shape-based Similarity Query for Trajectory of Mobile Object NTT Communication Science Laboratories, NTT Corporation, JAPAN. Yutaka Yanagisawa Jun-ichi.
CSIS7101 – Advanced Database Technologies Spatio-Temporal Data (Part 1) On Indexing Mobile Objects Kwong Chi Ho Leo Wong Chi Kwong Simon Lui, Tak Sing.
R-Tree. 2 Spatial Database (Ia) Consider: Given a city map, ‘index’ all university buildings in an efficient structure for quick topological search.
Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!
Spatio-temporal Pattern Queries M. Hadjieleftheriou G. Kollios P. Bakalov V. J. Tsotras.
August 30, 2004STDBM 2004 at Toronto Extracting Mobility Statistics from Indexed Spatio-Temporal Datasets Yoshiharu Ishikawa Yuichi Tsukamoto Hiroyuki.
Trajectory Data Mining Dr. Yu Zheng Lead Researcher, Microsoft Research Chair Professor at Shanghai Jiao Tong University Editor-in-Chief of ACM Trans.
15 th ACM GIS: Seattle, WA: Nov 7—9, 2007 TS2-Tree: An Efficient Similarity Based Organization for Trajectory Data Petko Bakalov Eamonn Keogh Vassilis.
Efficient OLAP Operations in Spatial Data Warehouses Dimitris Papadias, Panos Kalnis, Jun Zhang and Yufei Tao Department of Computer Science Hong Kong.
1 Complex Spatio-Temporal Pattern Queries Cahide Sen University of Minnesota.
Temporal Databases. Outline Spatial Databases Indexing, Query processing Temporal Databases Spatio-temporal ….
Spatio-Temporal Databases
1 Review of report "LSDX: A New Labeling Scheme for Dynamically Updating XML Data"
Spatio-Temporal Databases. Term Project Groups of 2 students You can take a look on some project ideas from here:
A Flexible Spatio-temporal indexing Scheme for Large Scale GPS Tracks Retrieval Yu Zheng, Longhao Wang, Xing Xie Microsoft Research.
Spatial Approximate String Search. Abstract This work deals with the approximate string search in large spatial databases. Specifically, we investigate.
Indexing the Past, Present, and Anticipated Future Positions of Moving Objects Mindaugas Pelanis, Simonas Saltenis, and Christian S. Jensen
Spatio-Temporal Databases
CS522 Advanced database Systems
Indexing and hashing.
Spatio-temporal Pattern Queries
External Memory Hashing
Chapter 11: Indexing and Hashing
Chapter Two Trajectory Indexing and Retrieval
Spatio-Temporal Databases
Joining Interval Data in Relational Databases
External Memory Hashing
Indexing and Hashing Basic Concepts Ordered Indices
Time Relaxed Spatiotemporal Trajectory Joins
Continuous Motion Pattern Query
Continuous Density Queries for Moving Objects
Chapter Two Trajectory Indexing and Retrieval
Chapter 11: Indexing and Hashing
Efficient Aggregation over Objects with Extent
Presentation transcript:

--Presented By Sudheer Chelluboina. Professor: Dr.Maggie Dunham

Outline of Paper Introduction Index Structures

 Due to rapid increase in the use of location based services applications, large amount of location data of moving object is recorded. Because of that efficient indexing techniques are required to manage these large amounts of trajectory data. All index structures are focused on either indexing past, current and future locations. Every indexing structure or techniques discussed in this paper will make simpler indexing or it will increase the overall query processing performance.

 Trajectory: ◦ It is the path of a moving object or body through space. ◦ In general the position of the moving object is sampled at discrete times, and the series of straight lines connecting successive positions represents the movement of the object. These connected segments is called a Trajectory.  Trajectory Data: ◦ When the moving object or body is continuously moving, and the update or change in location is recorded and that recorded data can be called as Trajectory Data.  Purpose of Indexing: ◦ As the object moves its location constantly changes and there will large number of update operations. ◦ Requires more space to consider this changing data. ◦ Searching becomes the worst due to enormous data.

 Querying in trajectory databases is expensive and complex because of vast amount of data.  Two types of Queries: ◦ Query about future positions for moving objects. ◦ Query about historical positions for moving objects.  Trajectory based queries: ◦ Topological queries ◦ Navigational queries  Applications: ◦ Fleet Management ◦ Traffic Management ◦ Mobile Communication ◦ Environmental Monitoring System

 R-Tree: ◦ MBR’s are used as the data objects. ◦ Index records in leaf node and points to the actual data.  Advantages: ◦ It can handle any kind of data as trajectory. ◦ Each line segment as one MBR.  Problems: ◦ Line segments of each trajectory is not preserved so its take much time to retrieve the information about one trajectory.

 STR-Tree: ◦ It is an extension of R-Trees. ◦ It has a insert/split algorithm. ◦ The main idea is to keep the spatial closeness by preserving the trajectories line segments with single trajectory ID.  Advantages: ◦ It can handle any kind of data as trajectory. ◦ Each line segment as one MBR with an additional parameter as trajectory id.  Problems: ◦ Even though the line segments of each trajectory is preserved, its take much time to retrieve the information about one trajectory.

 TB-Tree: ◦ It is an extension of STR-Trees, proposed to handle only the trajectory data. ◦ Here leaf node can only contain the segments belonging to the same trajectory. ◦ Left most node is the first segment of trajectory and last right node will be the last segment of trajectory.  Advantages: ◦ It index size is low as compared to previous index structures.  Problems: ◦ The main problem is the segment which is connected can be in the same leaf node or it may be in another leaf node, by which the information retrieved will be abnormal.

 SETI-Tree: ◦ It is a new indexing method build on R* trees. ◦ Uses spatial partitions and sparse temporal indices. ◦ First the input query is filtered spatially than produce candidate cells, on these cells spatial time index is built and outputs the data pages with trajectory ids.  Advantages: ◦ It provides the efficient index structure scheme.  Problems: ◦ In the algorithm, there is a limitation that in the refinement step there is a overhead in checking the temporal condition met by all the line segments from that data page.

 TS2-Tree: ◦ It is a novel indexing method for time specific queries called time specific similarity tree. ◦ It is similar to the R-tree. Each leaf node in a tree stores a trajectory symbolic representation and also a pointer to the raw trajectory where the actual trajectory is stored. ◦ The proposed structure is dynamic, that is the insert and delete operations are intermixed.  Advantages: ◦ It provides the efficient organization for time specific queries on trajectory.  Problems: ◦ Spatial threshold is the main thing to consider if it increases the query evaluation is expensive.

 Different types of metrics used to analyze the indexes.  Given knowledge about the types of queries used.  It given me idea about how the trajectories will be and how it is stored and retrieved.  Main thing, it is used in my research for simulating the abnormal trajectories into normal data.

 D. Pfoser, C. S. Jensen, and Y. Theodoridis, "Novel Approaches to the Indexing of Moving Object Trajectories," in Proc. 26th VLDB conf., 2000, pp  Petko Bakalov, Eamonn J. Keogh, Vassilis J. Tsotras: TS2- tree - an efficient similarity based organization for trajectory data. GIS 2007: 58  Chakka, V. P.; Everspaugh, A. & Patel, J. M. Indexing Large Trajectory Data Sets With SETI CIDR,  M. Hadjieleftheriou, G. Kollios, V. J. Tsotras, and D. Gunopulos. Efficient Indexing of Spatiotemporal Objects. In  Proc. of the Intl. Conf. on Extending Database Technology, EDBT, pages 251–268, Czech Republic, Mar

Thank You….