Topological Reasoning between Complex Regions in Databases with Frequent Updates Arif Khan & Markus Schneider Department of Computer and Information Science.

Slides:



Advertisements
Similar presentations
EE384y: Packet Switch Architectures
Advertisements

The Optimal-Location Query
Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Differential Forms for Target Tracking and Aggregate Queries in Distributed Networks Rik Sarkar Jie Gao Stony Brook University 1.
1 Using Bayesian Network for combining classifiers Leonardo Nogueira Matos Departamento de Computação Universidade Federal de Sergipe.
CPSC 322, Lecture 5Slide 1 Uninformed Search Computer Science cpsc322, Lecture 5 (Textbook Chpt 3.5) Sept, 14, 2012.
Motion Planning for Point Robots CS 659 Kris Hauser.
The Greedy Approach Chapter 8. The Greedy Approach It’s a design technique for solving optimization problems Based on finding optimal local solutions.
CPSC 322, Lecture 5Slide 1 Uninformed Search Computer Science cpsc322, Lecture 5 (Textbook Chpt 3.4) January, 14, 2009.
CS 599 – Spatial and Temporal Databases Realm based Spatial data types: The Rose Algebra Ralf Hartmut Guting Markus Schneider.
Optimal Design Laboratory | University of Michigan, Ann Arbor 2011 Design Preference Elicitation Using Efficient Global Optimization Yi Ren Panos Y. Papalambros.
Constructing Popular Routes from Uncertain Trajectories Ling-Yin Wei 1, Yu Zheng 2, Wen-Chih Peng 1 1 National Chiao Tung University, Taiwan 2 Microsoft.
An Approach to Evaluate Data Trustworthiness Based on Data Provenance Department of Computer Science Purdue University.
Algorithm Strategies Nelson Padua-Perez Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.
Atomic Volumes for Mesh Completion Joshua Podolak Szymon Rusinkiewicz Princeton University.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
Chapter 3 The Greedy Method 3.
Geometric reasoning about mechanical assembly By Randall H. Wilson and Jean-Claude Latombe Henrik Tidefelt.
Geometric Reasoning About Mechanical Assembly By Randall H. Wilson and Jean-Claude Latombe Presented by Salik Syed and Denise Jones.
Department of Engineering, Control & Instrumentation Research Group 22 – Mar – 2006 Optimisation Based Clearance of Nonlinear Flight Control Laws Prathyush.
Bogdan Tanasa, Unmesh D. Bordoloi, Petru Eles, Zebo Peng Department of Computer and Information Science, Linkoping University, Sweden December 3, 2010.
Cache Placement in Sensor Networks Under Update Cost Constraint Bin Tang, Samir Das and Himanshu Gupta Department of Computer Science Stony Brook University.
Hierarchical Constraint Satisfaction in Spatial Database Dimitris Papadias, Panos Kalnis And Nikos Mamoulis.
Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.
Chapter 10: Algorithm Design Techniques
Topological Relationships Between Complex Spatial Objects Daniel Hess and Yun Zhang.
Scalable Network Distance Browsing in Spatial Database Samet, H., Sankaranarayanan, J., and Alborzi H. Proceedings of the 2008 ACM SIGMOD international.
A Topology-based ECO Routing Methodology for Mask Cost Minimization Po-Hsun Wu, Shang-Ya Bai, and Tsung-Yi Ho Department of Computer Science and Information.
Georgios Christodoulou, Euripides G.M. Petrakis, and Sotirios Batsakis Department of Electronic and Computer Engineering, Technical University of Crete.
VOLTAGE SCHEDULING HEURISTIC for REAL-TIME TASK GRAPHS D. Roychowdhury, I. Koren, C. M. Krishna University of Massachusetts, Amherst Y.-H. Lee Arizona.
Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.
QoS-Aware In-Network Processing for Mission-Critical Wireless Cyber-Physical Systems Qiao Xiang Advisor: Hongwei Zhang Department of Computer Science Wayne.
Limits of Local Algorithms in Random Graphs
Presentation on Neural Networks.. Basics Of Neural Networks Neural networks refers to a connectionist model that simulates the biophysical information.
1 State Space of a Problem Lecture 03 ITS033 – Programming & Algorithms Asst. Prof.
CSCE350 Algorithms and Data Structure Lecture 17 Jianjun Hu Department of Computer Science and Engineering University of South Carolina
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Télécom 2A – Algo Complexity (1) Time Complexity and the divide and conquer strategy Or : how to measure algorithm run-time And : design efficient algorithms.
Extending Traditional Algorithms for Cyber-Physical Systems Sumeet Gujrati and Gurdip Singh Kansas State University.
Discrete Structures Lecture 12: Trees Ji Yanyan United International College Thanks to Professor Michael Hvidsten.
Efficient Route Computation on Road Networks Based on Hierarchical Communities Qing Song, Xiaofan Wang Department of Automation, Shanghai Jiao Tong University,
1 Spatio-Temporal Predicates Martin Erwig and Markus Schneider IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING Presented by Mamadou Hassimiou Diallo.
Group 8: Denial Hess, Yun Zhang Project presentation.
Presented by: Daniel Hess, Yun Zhang. Motivation Problem statement Major contributions Key concepts Validation methodology Assumptions Recommended changes.
L1-Spatial Concepts NGEN06 & TEK230: Algorithms in Geographical Information Systems by: Irene Rangel, updated by Sadegh Jamali 1.
Types of Algorithms. 2 Algorithm classification Algorithms that use a similar problem-solving approach can be grouped together We’ll talk about a classification.
Trajectory Data Mining Dr. Yu Zheng Lead Researcher, Microsoft Research Chair Professor at Shanghai Jiao Tong University Editor-in-Chief of ACM Trans.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
CSE 340: Review (at last!) Measuring The Complexity Complexity is a function of the size of the input O() Ω() Θ() Complexity Analysis “same order” Order.
CSE 326 Course Review David Kaplan Dept of Computer Science & Engineering Autumn 2001.
1Computer Sciences Department. 2 Advanced Design and Analysis Techniques TUTORIAL 7.
An Energy-Efficient Approach for Real-Time Tracking of Moving Objects in Multi-Level Sensor Networks Vincent S. Tseng, Eric H. C. Lu, & Kawuu W. Lin Institute.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
CPSC 322, Lecture 5Slide 1 Uninformed Search Computer Science cpsc322, Lecture 5 (Textbook Chpt 3.5) Sept, 13, 2013.
Of 17 Limits of Local Algorithms in Random Graphs Madhu Sudan MSR Joint work with David Gamarnik (MIT) 7/11/2013Local Algorithms on Random Graphs1.
Topological relations from metric refinements Egenhofer, M. J. and Dube, M. P ACM SIGSPATIAL GIS '09 Presenter : Murat Demiray Narrative : Mustafa Karamavus.
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications * CS587x Lecture Department of Computer Science Iowa State University *I. Stoica,
Topics  Direct Predicate Characterization as an evaluation method.  Implementation and Testing of the Approach.  Conclusions and Future Work.
Surviving Holes and Barriers in Geographic Data Reporting for
COSC160: Data Structures Linked Lists
CSCI 2670 Introduction to Theory of Computing
Finding Fastest Paths on A Road Network with Speed Patterns
Department of Computer Science University of York
Algorithms for Budget-Constrained Survivable Topology Design
On the Designing of Popular Packages
All pairs shortest path problem
A Dynamic System Analysis of Simultaneous Recurrent Neural Network
Dynamic Graph Algorithms
Donghui Zhang, Tian Xia Northeastern University
Time Complexity and the divide and conquer strategy
Presentation transcript:

Topological Reasoning between Complex Regions in Databases with Frequent Updates Arif Khan & Markus Schneider Department of Computer and Information Science and Engineering University of Florida Presented by: Hechen Liu

Motivation Topological relationships are important in many applications, e.g., AI, cognitive science, and spatial databases It is impossible to find all topological facts It is impractical to keep all topological facts Simple regions are not enough to represent real life scenarios

Complex Objects Complex regions: Multiple Components: faces Each face may have single or multiple holes Interior: A Exterior: A - Boundary: A

9-Intersection Model

33 Relationships of Complex Regions [1] M. Schneider and T. Behr. Topological Relationships between Complex Spatial Objects. ACM Transactions on Database Systems, 31(1):39-81, 2006.

Inference Composition Rx(A,B), Ry(B,C) Rz(A, C) Rx o Ry Rz inside(A, B) o inside(B, C) inside(A,C) Determined by the inference rules

Overview of the Reasoning Process Local Inference Apply inference rules Interpret reasoning result and identify relationship(s) Global Inference Extend the inference to N complex regions Binary Spatial Constraint Network (BSCN)

Local Inference Interior can characterize a complex region 8 possible interior-interior set relations exist between two complex regions. A B: A B A - B B - A 8*8=64 combinations possible between A and C.

Inference Rules Consider, (A B ¬AB) (B C ¬BC) A B B C A C A C = 1 (interior-interior intersection) with the same input, A C = 0 (interior-exterior intersection) A B C C

Inference Rules Consider, A B and B C A o C o = unknown (interior-interior intersection)

Inference Rules

Relationship Identifying Process If all 9 predicates are deterministic, then inferred relationship is a single relationship. If there is any unknown value, then the inferred relationship is a disjunction. For example:

Decision Tree of the Relation Space Brute force method: 33*8=264 comparisons Recursively divide the relationship space based on a predicate value at each level, until we reach a single relationship e.g.,18 relationships have false in the interior-boundary (P2) value. 33 relationships form a tree of height 6 Deterministic values have 6 comparisons instead of 264: 97% improvement Indeterminate values have at most 32 comparisons: 88% improvement

Global Inference Extend the reasoning process to N objects. Binary Spatial Constraint Network (BSCN)

Reasoning in Dynamic Databases Find BSCN paths Each time a change occurs in the database, the algorithm should run Intermediate objects are thrown out when the query is committed

Most Specific Relationship The relationship which has the least number of disjunctions Shortest path does not guarantee most specific relationship A C B D E E A D B C

Most Specific Relationship The relationship which has the least number of disjunctions. Shortest path does not guarantee most specific relationship. overlap o overlap unknown A C B E A D B C

Most Specific Relationship The relationship which has the least number of disjunctions Shortest path does not guarantee most specific relationship inside o inside inside A C D E E A D B C

Most Specific Relationship The relationship which has the least number of disjunctions Shortest path does not guarantee most specific relationship inside o disjoint disjoint A C E E A D B C

Most Specific Relationship The relationship which has the least number of disjunctions Shortest path does not guarantee most specific relationship In fact, there is no relation between the length of the path and the most specific relationship

Most Specific Relationship Solution: consider all paths and take the intersection Problem: number of paths is O(n!) Interesting Facts: Worst case scenario when the graph is complete (then, we even do not need reasoning) Consider sparse graphs

K-Shortest Paths Let us not consider all the paths. Instead, we consider k-paths K-shortest path algorithm: O(m+nlogn+k) [2] Reasoning between complex regions: – Total complexity: O(n 2 log n) [2] D. Eppstein. Finding the k shortest paths. SIAM Journal on Computing, 28(2):652–673, 1999.

Simulation and Result Random graph Edges are Power Law distributed All edges have unit weight Number of paths considered: k = cn

Simulation and Results

Conclusions and Future Work Derived a complete set of inference rules Proposed BSCN and a dynamic reasoning approach Will introduce more robust heuristics Weighted BSCN. Will extend to other data types line-line line-region

Questions and Comments? Please contact Mr. Arif Khan:

Thank you!