1 / 1

Amnesic Online Synopses for Moving Objects Michalis Potamias, Kostas Patroumpas, and Timos Sellis

Amnesic Online Synopses for Moving Objects Michalis Potamias, Kostas Patroumpas, and Timos Sellis. 4 . Applications on Moving Objects. 1 . Overview

orea
Download Presentation

Amnesic Online Synopses for Moving Objects Michalis Potamias, Kostas Patroumpas, and Timos Sellis

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. Amnesic Online Synopses for Moving ObjectsMichalis Potamias, Kostas Patroumpas, and Timos Sellis 4. Applications on Moving Objects 1. Overview We present an amnesictree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an behavior over streams of locations taken from numerous moving objects in order to obtain trajectory approximations as well as affordable estimates regarding distinct count spatiotemporal queries. • Compressing Single Trajectory • Store displacements between consecutive locations • multiple resolutions of a trajectory • tuple: < id, x, y, t > • Spatiotemporal Distinct Count • 3-tier Compression • x-y plane: Spatial Grid • time: AmTree • query: FMsketch • Updating • merge sketches (OR) • Answering Queries (α, ΔΤ): • Bounding β • Bounding ΔΤ’ • Example: • Query: ( α , [135..220] ) • Estim.: ( β , [128..223] ) • 2. AmTree • Each item contributes to the structure according to its age. • Older items only in coarser granularity levels. • Recent items in fine granularity levels. • Complexity: • Update per tuple: O(1) • Space: O(logN) 3. Updating example • 5. Future work • what about other amnesic patterns? • can we define similar structures? 6. Extension more information: log2 N, same update complexity: O(1) 7. References A. Bulut and A.K. Singh. SWAT: Hierarchical Stream Summarization inLarge Networks.ICDE, 2003. T. Palpanas, M. Vlachos, E. Keogh, D. Gunopulos, and W. Truppel. Online Amnesic Approximation of Streaming Time Series.ICDE, 2004. M. Potamias, K. Patroumpas, and T. Sellis. Online Amnesic Summarization of Streaming Locations. T.R., NTUA,2006. Y. Tao, G. Kollios, J. Considine, F. Li, and D.Papadias. Spatio-TemporalAggregation Using Sketches.ICDE, 2004.

More Related