Bin Jiang, Jian Pei ICDE 2009 Online Interval Skyline Queries on Time Series 1.

Slides:



Advertisements
Similar presentations
A Minimum Cost Path Search Algorithm Through Tile Obstacles Zhaoyun Xing and Russell Kao Sun Microsystems Laboratories.
Advertisements

Computer Science and Engineering Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search Chengyuan Zhang 1,Ying Zhang 1,Wenjie Zhang 1, Xuemin.
Counting Distinct Objects over Sliding Windows Presented by: Muhammad Aamir Cheema Joint work with Wenjie Zhang, Ying Zhang and Xuemin Lin University of.
Probabilistic Skyline Operator over Sliding Windows Wenjie Zhang University of New South Wales & NICTA, Australia Joint work: Xuemin Lin, Ying Zhang, Wei.
A Framework for Clustering Evolving Data Streams Charu C. Aggarwal, Jiawei Han, Jianyong Wang, Philip S. Yu Presented by: Di Yang Charudatta Wad.
Fast Algorithms For Hierarchical Range Histogram Constructions
Maintaining Sliding Widow Skylines on Data Streams.
VLDB’2007 review Denis Mindolin. VLDB’07 program.
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows COMP9314 Lecture Notes.
1 Continuous k-dominant Skyline Query Processing Presented by Prasad Sriram Nilu Thakur.
1. 2 General problem Retrieval of time-series similar to a given pattern.
Probabilistic Skyline Operator over sliding Windows Wan Qian HKUST DB Group.
Abstract Shortest distance query is a fundamental operation in large-scale networks. Many existing methods in the literature take a landmark embedding.
Bin Jiang, Jian Pei.  Problem Definition  An On-the-fly Method ◦ Interval Skyline Query Answering Algorithm ◦ Online Interval Skyline Query Algorithm.
The Fundamentals: Algorithms, the Integers & Matrices.
Continuous Processing of Preference Queries in Data Streams : a Survey
Load Balancing Tasks with Overlapping Requirements Milan Vojnovic Microsoft Research Joint work with Dan Alistarh, Christos Gkantsidis, Jennifer Iglesias,
Graph Indexing: A Frequent Structure­ based Approach Authors:Xifeng Yan†, Philip S‡. Yu, Jiawei Han†
Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces Jian Pei # Wen Jin # Martin Ester # Yufei Tao + # Simon Fraser University,
Intelligent Database Systems Lab Presenter: MIN-CHIEH HSIU Authors: NHAT-QUANG DOAN ∗, HANANE AZZAG, MUSTAPHA LEBBAH 2013 NN Growing self-organizing trees.
Dept. of Electrical Engineering and Computer Science, Northwestern University Context-Aware Optimization of Continuous Query Maintenance for Trajectories.
A Polynomial Time Approximation Scheme For Timing Constrained Minimum Cost Layer Assignment Shiyan Hu*, Zhuo Li**, Charles J. Alpert** *Dept of Electrical.
Towards Robust Indexing for Ranked Queries Dong Xin, Chen Chen, Jiawei Han Department of Computer Science University of Illinois at Urbana-Champaign VLDB.
Standard Algorithms –search for an item in an array –count items in an array –find the largest (or smallest) item in an array.
Graph Indexing: A Frequent Structure- based Approach Alicia Cosenza November 26 th, 2007.
Efficient Computation of Reverse Skyline Queries VLDB 2007.
Clustering Moving Objects in Spatial Networks Jidong Chen, Caifeng Lai, Xiaofeng Meng, Renmin University of China Jianliang Xu, and Haibo Hu Hong Kong.
Lars Arge Presented by Or Ozery. I/O Model Previously defined: N = # of elements in input M = # of elements that fit into memory B = # of elements per.
Computer Science and Engineering Efficiently Monitoring Top-k Pairs over Sliding Windows Presented By: Zhitao Shen 1 Joint work with Muhammad Aamir Cheema.
Optimal XOR Hashing for a Linearly Distributed Address Lookup in Computer Networks Christopher Martinez, Wei-Ming Lin, Parimal Patel The University of.
CSCI 3160 Design and Analysis of Algorithms Chengyu Lin.
K-Hit Query: Top-k Query Processing with Probabilistic Utility Function SIGMOD2015 Peng Peng, Raymond C.-W. Wong CSE, HKUST 1.
A Study of Balanced Search Trees: Brainstorming a New Balanced Search Tree Anthony Kim, 2005 Computer Systems Research.
The Haar + Tree: A Refined Synopsis Data Structure Panagiotis Karras HKU, September 7 th, 2006.
Detecting Group Differences: Mining Contrast Sets Author: Stephen D. Bay Advisor: Dr. Hsu Graduate: Yan-Cheng Lin.
Efficient Processing of Top-k Spatial Preference Queries
1 BIM304: Algorithm Design Time: Friday 9-12am Location: B4 Instructor: Cuneyt Akinlar Grading –2 Midterms – 20% and 30% respectively –Final – 30% –Projects.
Chapter 9 Efficiency of Algorithms. 9.3 Efficiency of Algorithms.
Synthetic Sequence Design for Signal Location Yaw-Ling Lin ( 林 耀 鈴 ) Dept Computer Sci and Info Engineering College of Computing and Informatics Providence.
Online Interval Skyline Queries on Time Series ICDE 2009.
Online Interval Skyline Queries on Time Series. I. Introduction.
Finding skyline on the fly HKU CS DB Seminar 21 July 2004 Speaker: Eric Lo.
Graph Data Management Lab, School of Computer Science Branch Code: A Labeling Scheme for Efficient Query Answering on Tree
Indexing Time Series. Outline Spatial Databases Temporal Databases Spatio-temporal Databases Multimedia Databases Time Series databases Text databases.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology ACM SIGMOD1 Subsequence Matching on Structured Time Series.
Rate-Based Query Optimization for Streaming Information Sources Stratis D. Viglas Jeffrey F. Naughton.
Structural Bioinformatics Seminar Prof. Haim J. Wolfson1 How to present a lecture in Bioinformatics (an informal guide) Haim J. Wolfson School of Computer.
A Binary Linear Programming Formulation of the Graph Edit Distance Presented by Shihao Ji Duke University Machine Learning Group July 17, 2006 Authors:
1 Context-Aware Ranking in Web Search (SIGIR 10’) Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, Enhong Chen, Hang Li 2010/10/26.
GC 211:Data Structures Week 2: Algorithm Analysis Tools Slides are borrowed from Mr. Mohammad Alqahtani.
MAT 1235 Calculus II 4.2 Part II The Definite Integral
On the R ange M aximum-Sum S egment Q uery Problem Kuan-Yu Chen and Kun-Mao Chao Department of Computer Science and Information Engineering, National Taiwan.
Intelligent Database Systems Lab Presenter : BEI-YI JIANG Authors : JAMAL A. NASIR, IRAKLIS VARLAMIS, ASIM KARIM, GEORGE TSATSARONIS KNOWLEDGE-BASED.
Xifeng Yan Philip S. Yu Jiawei Han SIGMOD 2005 Substructure Similarity Search in Graph Databases.
Computer Science and Engineering Jianye Yang 1, Ying Zhang 2, Wenjie Zhang 1, Xuemin Lin 1 Influence based Cost Optimization on User Preference 1 The University.
Tian Xia and Donghui Zhang Northeastern University
GC 211:Data Structures Algorithm Analysis Tools
Data-Streams and Histograms
Fast Approximate Query Answering over Sensor Data with Deterministic Error Guarantees Chunbin Lin Joint with Etienne Boursier, Jacque Brito, Yannis Katsis,
DS595/CS525 Team#2 - Mi Tian, Deepan Sanghavi, Dhaval Dholakia
Finding Fastest Paths on A Road Network with Speed Patterns
GC 211:Data Structures Algorithm Analysis Tools
Junqi Zhang+ Xiangdong Zhou+ Wei Wang+ Baile Shi+ Jian Pei*
Xu Zhou Kenli Li Yantao Zhou Keqin Li
Probabilistic n-of-N Skyline Computation over Uncertain Data Streams
Skyline query with R*-Tree: Branch and Bound Skyline (BBS) Algorithm
Uncertain Data Mobile Group 报告人:郝兴.
Continuous Density Queries for Moving Objects
Efficient Processing of Top-k Spatial Preference Queries
Password Policies to prevent reuse for online accounts
Presentation transcript:

Bin Jiang, Jian Pei ICDE 2009 Online Interval Skyline Queries on Time Series 1

2 Outlines Motivation Problem Definition Methodology On-the-fly algorithm The view-materialization query algorithm Experiment Conclusion

Motivation 3 In many applications we need to analyze a large number of time series. (telecommunication,market analysis) More often than not, segments of time series demonstrating dominating advantages over others are of particular interest.

4 A time series s is interesting if, in the query interval, there does not exist another time series s’ such that s’ is better than s on at least one timestamp and s’ is not worse than s on every timestamp. In order words, s is a skyline point.

Problem Definition 5

Methodology 6 On-the-fly method The on-the-fly method keeps the minimum and the maximum values for each time series and computes the interval skyline at query time.

7 Max=4,Min=2 Max=5,Min=1 Max=5,Min=2 Max=3,Min=1 Max=4,Min=4 W= [1:3] Sky[2:3] Sky[2:3] = {s2,s3,s5}

8 Radix Priority Search Tree Left-subtrees Right-subtrees

Methodology 9 A View-Materialization method A time series s is called a non-redundant skyline time series in interval [i : j] if (1) s is in the skyline in interval [i : j]; and (2) s is not in the skyline in any subinterval [i' : j '] ⊃ [i : j ]. In this case, we also call [i : j] a minimal skyline interval of s.

10 s2 is a false positive since it is dominated by s1 in [3 : 4]. s1 and s2 are both in NRSky[4 : 4] Compute the interval skyline in [3 : 4], [3 : 3], [4 : 4] and [3 : 4] to get the result {s1; s3; s4}.

Methodology 11 A View-Materialization method

12 2, 1, 5, 3, 4 5,4 2,1, , SDC(shared-divide-and-conquer) algorithm compute the skylines in intervals [3 : 3], [2 : 3], and [1 : 3]

Sky[1 : 3] = {s1; s2; s3; s5},Sky[2 : 3] = {s2; s3; s5} and Sky[3 : 3] = {s3}. 5 3

Experiment 14

15

Conclusion 16 Both methods use linear space. An extensive experimental study shows that both methods are efficient for query answering and increment maintenance. As future work, it is interesting and challenging to tackle the problem of interval skyline queries on streaming time series.