Efficient Computation of Reverse Skyline Queries VLDB 2007.

Slides:



Advertisements
Similar presentations
Identifying the Most Influential Data Objects with Reverse Top-k Queries By Akrivi Vlachou 1, Christos Doulkeridis 1, Kjetil Nørvag 1 and Yannis Kotidis.
Advertisements

M. Belkin and P. Niyogi, Neural Computation, pp. 1373–1396, 2003.
VLDB 2011 Pohang University of Science and Technology (POSTECH) Republic of Korea Jongwuk Lee, Seung-won Hwang VLDB 2011.
Probabilistic Skyline Operator over Sliding Windows Wenjie Zhang University of New South Wales & NICTA, Australia Joint work: Xuemin Lin, Ying Zhang, Wei.
The Palm-tree Index Indexing with the crowd Ahmed R Mahmood*Walid G. Aref* Eduard Dragut*Saleh Basalamah** *Purdue University**Umm AlQura University.
Fast Algorithms For Hierarchical Range Histogram Constructions
Danzhou Liu Ee-Peng Lim Wee-Keong Ng
School of Computer Science and Engineering Finding Top k Most Influential Spatial Facilities over Uncertain Objects Liming Zhan Ying Zhang Wenjie Zhang.
Continuous Intersection Joins Over Moving Objects Rui Zhang University of Melbourne Dan Lin Purdue University Kotagiri Ramamohanarao University of Melbourne.
Indexing the imprecise positions of moving objects Xiaofeng Ding and Yansheng Lu Department of Computer Science Huazhong University of Science & Technology.
Efficiency concerns in Privacy Preserving methods Optimization of MASK Shipra Agrawal.
July 29HDMS'08 Caching Dynamic Skyline Queries D. Sacharidis 1, P. Bouros 1, T. Sellis 1,2 1 National Technical University of Athens 2 Institute for Management.
Answering Metric Skyline Queries by PM-tree Tomáš Skopal, Jakub Lokoč Department of Software Engineering, FMP, Charles University in Prague.
A Novel Scheme for Video Similarity Detection Chu-Hong Hoi, Steven March 5, 2003.
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows COMP9314 Lecture Notes.
 Motivation  Reverse Queries  From Reverse to Inverse  Inverse Queries  Formal Definition  Applications  Framework  Experiments  Future Extensions.
Coherency Sensitive Hashing (CSH) Simon Korman and Shai Avidan Dept. of Electrical Engineering Tel Aviv University ICCV2011 | 13th International Conference.
--Presented By Sudheer Chelluboina. Professor: Dr.Maggie Dunham.
Subscription Subsumption Evaluation for Content-Based Publish/Subscribe Systems Hojjat Jafarpour, Bijit Hore, Sharad Mehrotra, and Nalini Venkatasubramanian.
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.
Spatio-Temporal Databases. Outline Spatial Databases Temporal Databases Spatio-temporal Databases Multimedia Databases …..
An Incremental Refining Spatial Join Algorithm for Estimating Query Results in GIS Wan D. Bae, Shayma Alkobaisi, Scott T. Leutenegger Department of Computer.
Spatial Queries Nearest Neighbor Queries.
On Testing Convexity and Submodularity Michal Parnas Dana Ron Ronitt Rubinfeld.
Efficient Computation of the Skyline Cube Yidong Yuan School of Computer Science & Engineering The University of New South Wales & NICTA Sydney, Australia.
Spatial and Temporal Databases Efficiently Time Series Matching by Wavelets (ICDE 98) Kin-pong Chan and Ada Wai-chee Fu.
Introduction Using time property and location property from lost items’ pictures, we construct the Lost and Found System which combined with image search.
WEMAREC: Accurate and Scalable Recommendation through Weighted and Ensemble Matrix Approximation Chao Chen ⨳ , Dongsheng Li
Maximal Vector Computation in Large Data Sets The 31st International Conference on Very Large Data Bases VLDB 2005 / VLDB Journal 2006, August Parke Godfrey,
1 Progressive Computation of Constrained Subspace Skyline Queries Evangelos Dellis 1 Akrivi Vlachou 1 Ilya Vladimirskiy 1 Bernhard Seeger 1 Yannis Theodoridis.
The X-Tree An Index Structure for High Dimensional Data Stefan Berchtold, Daniel A Keim, Hans Peter Kriegel Institute of Computer Science Munich, Germany.
Towards Robust Indexing for Ranked Queries Dong Xin, Chen Chen, Jiawei Han Department of Computer Science University of Illinois at Urbana-Champaign VLDB.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 The k-means range algorithm for personalized data clustering.
PMLAB Finding Similar Image Quickly Using Object Shapes Heng Tao Shen Dept. of Computer Science National University of Singapore Presented by Chin-Yi Tsai.
Reverse Top-k Queries Akrivi Vlachou *, Christos Doulkeridis *, Yannis Kotidis #, Kjetil Nørvåg * *Norwegian University of Science and Technology (NTNU),
Research and Practice at University of Queensland Wei Lu ( 卢卫 ) 2/19/2009.
Antonin Guttman In Proceedings of the 1984 ACM SIGMOD international conference on Management of data (SIGMOD '84). ACM, New York, NY, USA.
Data Management+ Laboratory Dynamic Skylines Considering Range Queries Speaker: Adam Adviser: Yuling Hsueh 16th International Conference, DASFAA 2011 Wen-Chi.
Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!
Efficient Processing of Top-k Spatial Preference Queries
Efficient EMD-based Similarity Search in Multimedia Databases via Flexible Dimensionality Reduction / 16 I9 CHAIR OF COMPUTER SCIENCE 9 DATA MANAGEMENT.
Query Sensitive Embeddings Vassilis Athitsos, Marios Hadjieleftheriou, George Kollios, Stan Sclaroff.
Answering Top-k Queries Using Views Gautam Das (Univ. of Texas), Dimitrios Gunopulos (Univ. of California Riverside), Nick Koudas (Univ. of Toronto), Dimitris.
August 30, 2004STDBM 2004 at Toronto Extracting Mobility Statistics from Indexed Spatio-Temporal Datasets Yoshiharu Ishikawa Yuichi Tsukamoto Hiroyuki.
CS848 Similarity Search in Multimedia Databases Dr. Gisli Hjaltason Content-based Retrieval Using Local Descriptors: Problems and Issues from Databases.
The σ-neighborhood skyline queries Chen, Yi-Chung; LEE, Chiang. The σ-neighborhood skyline queries. Information Sciences, 2015, 322: 張天彥 2015/12/05.
A FAIR ASSIGNMENT FOR MULTIPLE PREFERENCE QUERIES
On Top-n Reverse Top-k Queries: Variants, Algorithms, and Applications 陳良弼 Arbee L.P. Chen National Chengchi University 9/21/2012 at NCHU.
1 Finding Competitive Price Yu Peng (Hong Kong University of Science and Technology) Raymond Chi-Wing Wong (Hong Kong University of Science and Technology)
Finding skyline on the fly HKU CS DB Seminar 21 July 2004 Speaker: Eric Lo.
Bin Jiang, Jian Pei ICDE 2009 Online Interval Skyline Queries on Time Series 1.
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.
Efficient Skyline Computation on Vertically Partitioned Datasets Dimitris Papadias, David Yang, Georgios Trimponias CSE Department, HKUST, Hong Kong.
Spatial Range Querying for Gaussian-Based Imprecise Query Objects Yoshiharu Ishikawa, Yuichi Iijima Nagoya University Jeffrey Xu Yu The Chinese University.
Similarity Measurement and Detection of Video Sequences Chu-Hong HOI Supervisor: Prof. Michael R. LYU Marker: Prof. Yiu Sang MOON 25 April, 2003 Dept.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Advisor : Dr. Hsu Graduate : Chun Kai Chen Author : Andrew.
Parallel Computation of Skyline Queries COSC6490A Fall 2007 Slawomir Kmiec.
A Collapsed Variational Bayesian Inference Algorithm for Latent Dirichlet Allocation Yee W. Teh, David Newman and Max Welling Published on NIPS 2006 Discussion.
Xifeng Yan Philip S. Yu Jiawei Han SIGMOD 2005 Substructure Similarity Search in Graph Databases.
1 Spatial Query Processing using the R-tree Donghui Zhang CCIS, Northeastern University Feb 8, 2005.
1 Introduction to Spatial Databases Donghui Zhang CCIS Northeastern University.
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.
Spatio-Temporal Databases
Abolfazl Asudeh Azade Nazi Nan Zhang Gautam DaS
RE-Tree: An Efficient Index Structure for Regular Expressions
Probabilistic Data Management
Skyline query with R*-Tree: Branch and Bound Skyline (BBS) Algorithm
Relaxing Join and Selection Queries
Efficient Processing of Top-k Spatial Preference Queries
Presentation transcript:

Efficient Computation of Reverse Skyline Queries VLDB 2007

Outline Introduction Dynamic Skyline Query Branch-and-Bound for Reversed Skylines Reversed Skylines with Approximations Experimental Results Conclusion

Skyline Important new class of queries  Given: a set of d-dimensional points  Result:points that are not dominated by others  x dominates y x is as good as y in all dimensions and better in at least on dimension Exanple(collection of used cars)

Dynamic Skyline Query Motivation(customer perspective)  Ideal used car:120 hp, km, build 2005, …  Find all cars that are close to customer’s specification Skyline query relative to a reference point ref  x dominates y iff x is not farer from ref than y in all dimensions and in at least one dimension closer to ref Example(Used Car Database)

Dynamic Skyline Query Without loss of generality Example(Used Car Database)

Reverse Skyline Query Motivation (dealer perspective )  Given: the preferences of customer, the collection of used cars  Does it make sense to offer a car X to one of my customers? Car X is interesting, if it is in the skyline of a preference

Reverse Skyline Query Reverse Skyline query of q  RSL(q) = points whose dynamic skyline contains q Two Algorithms  Assumption: R-tree on set P  Branch-and-bound algorithm (BBRS)  Reversed Skyline Search with Approximation(RSSA)

BBRS: Branch-and-Bound algorithm Assumption  Multidimensional index (e.g.R-tree) on point set P Goal  Processing reversed skyline of point q without transformation Global Skyline GSL(q)  Points that are not globally dominated

Important Properties RSL(q) GSL(q)

Reverse Skyline with Approximations Important property  If any from DSL(p) dominates q p is not in RSL(q)

Approximations For each p we keep a subset DSL(p) of constant size  Parameter k Filter Step  If q dominates one of the samples p is in RSL(q)  If a sample dominates q p is not in RSL(q)  Otherwise, call the refinement step

Cont.

Comparsion RSSA vs BBRS Performance as a function of dimensionality

Conclusion Reverse Skyline are important for finding interesting points  Dealer perspective: What kind of items are interesting to my customers? Two Algorithms  BBRS  RSSA Future Work  Accurate Approximation of skylines for d >2