Replication Sprint F99 alien invasion. Local Alien Invasion Tests a transferred tree that is invaded by the local repo. An “invaded” node is “pruned”

Slides:

Advertisements

Similar presentations

- 1 - Dominator Tree BB0 BB1 BB2BB3 BB4 BB6 BB7 BB5 BB0 BB1 BB2BB3 BB4 BB6 BB5 BB7 BBDOM0 10,1 20,1,2 30,1,3 BBDOM 40,1,3,4 50,1,3,5 60,1,3,6 70,1,7 Dom.

Advertisements

AVL Trees1 Part-F2 AVL Trees v z. AVL Trees2 AVL Tree Definition (§ 9.2) AVL trees are balanced. An AVL Tree is a binary search tree such that.

Fundamentals of Computer Networks ECE 478/578 Lecture #13: Packet Switching (2) Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.

Properties of Multiplication & Addition. Commutative Property Numbers can be added or multiplied in any order and still yield the same result a + b =

AVL Tree Smt Genap Outline AVL Tree ◦ Definition ◦ Properties ◦ Operations Smt Genap

Binary Tries (continued) split(k). Similar to split algorithm for unbalanced binary search trees. Construct S and B on way down the trie. Follow with a.

AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.

Insert A tree starts with the dummy node D D 200 D 7 Insert D

1 /26 Red-black tree properties Every node in a red-black tree is either black or red Every null leaf is black No path from a leaf to a root can have two.

Binomial Heaps. Min Binomial Heap Collection of min trees

R-Trees Used to store rectangular regions of an image or a map such as those shown below. R-trees are particularly useful in storing very large amounts.

1 /26 Red-black tree properties Every node in a red-black tree is either black or red Every null leaf is black No path from a leaf to a root can have two.

Multi-Way search Trees Trees: a. Nodes may contain 1 or 2 items. b. A node with k items has k + 1 children c. All leaves are on same level.

Balanced Trees. Binary Search tree with a balance condition Why? For every node in the tree, the height of its left and right subtrees must differ by.

CISC220 Fall 2009 James Atlas Nov 13: Graphs, Line Intersections.

Indexing (cont.). Insertion in a B+ Tree Another B+ Tree

Advanced Trees Part III Briana B. Morrison Adapted from Alan Eugenio & William J. Collins.

Chapter 9: Graphs Basic Concepts

VLSI Digital System Design Datapath Operations and Ripple-Carry Add.

BASIC ALGEBRAIC OPERATIONS

Degree A F H G B E D C. Adjacent A F H G B E D C.

Properties of Real Numbers. 2 PROPERTIES OF REAL NUMBERS COMMUTATIVE PROPERTY: Addition:a + b = b + a = = =

Special Products Section 6.4. Find the product. (x + 2)(x + 2) (x + 3)(x + 3)

CuMPE : CLUSTER-MANAGEMENT AND POWER EFFICIENT PROTOCOL FOR WIRELESS SENSOR NETWORKS ITRE’05 Information Technology: Research and Education Shen Ben Ho.

Stack Data Structure By : Imam M Shofi. What is stack? A stack is a limited version of an array. A stack is a limited version of an array. New elements,

Lecture # 9 Chap 4: Ambiguous Grammar. 2 Chomsky Hierarchy: Language Classification A grammar G is said to be – Regular if it is right linear where each.

Announcements Exam Friday. More Physical Storage Lecture 10.

Balanced Search Trees Problem: Efficiency of BST is related to tree’s height.  search, insert and remove follow a path from root to desired location 

Data Structures: Advanced Damian Gordon. Advanced Data Structure We’ll look at: – Linked Lists – Trees – Stacks – Queues.

CSC 213 – Large Scale Programming Lecture 18: Zen & the Art of O (log n ) Search.

Graphs. Graphs Similar to the graphs you’ve known since the 5 th grade: line graphs, bar graphs, etc., but more general. Those mathematical graphs are.

BST Numbers, Memory, Removal & Tree Maps. BST Numbers n = number values contained h = height.

Installing 9.6 BDE binaries on hadoop data nodes Snapshots captured from Cloudera sandbox.

Introduction Finite Automata accept all regular languages and only regular languages Even very simple languages are non regular (  = {a,b}): - {a n b.

CS4445/B12 Provided by: Kenneth J. Loomis. genrecritics-reviewsratingIMAXlikes comedythumbs-upRFALSEno comedythumbs-upRTRUEno comedyneutralRFALSEno actionthumbs-downPG-13TRUEno.

Question 4 Tutorial 8. Part A Insert 20, 10, 15, 5,7, 30, 25, 18, 37, 12 and 40 in sequence into an empty binary tree

SCIENCE. The routes… CORE SCIENCE (AQA or OCR) -GCSE SCIENCE -GCSE ADDITIONAL SCIENCE TRIPLE SCIENCE (OCR) -GCSE BIOLOGY -GCSE CHEMISTRY -GCSE PHYSICS.

B Tree Insertion (ID)‏ Suppose we want to insert 60 into this order 3 B-Tree Starting at the root: 10 < 60 < 88, so we look to the middle child. Since.

Fibonacci Heaps. Fibonacci Binary insert O(1) O(log(n)) find O(1) N/A union O(1) N/A minimum O(1) O(1) decrease key O(1) O(log(n)) delete O(log(n) O(log(n))

ES2501: Introduction to Static Systems (2004E) Quiz #5

COMP261 Lecture 23 B Trees.

G64ADS Advanced Data Structures

Red-Black Trees v z Red-Black Trees Red-Black Trees

Red-Black Trees 5/17/2018 Presentation for use with the textbook Data Structures and Algorithms in Java, 6th edition, by M. T. Goodrich, R. Tamassia, and.

Articulation Points 1 of 2 (Ideas)

Do-more Technical Training

Binary search tree. Removing a node

The Distributive Property

Red-Black Trees v z Red-Black Trees 1 Red-Black Trees

Discrete Math 2 Weighted Graph Search Tree

Hire Toyota Innova in Delhi for Outstation Tour

By Norton Setup CA TollFree (US/CA/AU/UK)

Red-Black Trees v z Red-Black Trees 1 Red-Black Trees

Red-Black Trees v z /20/2018 7:59 AM Red-Black Trees

Red-Black Trees v z Red-Black Trees Red-Black Trees

Multi-Way Search Trees

Tree Rotations & Splay Trees

Random inserting into a B+ Tree

Red-Black Trees v z /17/2019 4:20 PM Red-Black Trees

Representing binary trees with lists

Heaps By JJ Shepherd.

Warm up: Name the sets of numbers to which each number belongs: -2/9

A Series of Slides in 5 Parts Movement 4. Best-First

Bellwork Simplify 1.) (2 + 3x) ) 9(2x)

A Series of Slides in 5 Parts Movement 3. IDFS

Red-Black Trees v z /6/ :10 PM Red-Black Trees

Advanced Computer Networks

Presentation transcript:

Replication Sprint F99 alien invasion

Local Alien Invasion Tests a transferred tree that is invaded by the local repo. An “invaded” node is “pruned” rather than deleted. Unit test uses transfer with a mocked repo Id (REPO_ID_A), path mapping and nodeId mapping.

Local Alien Invasion 1 Set up A1 A2 A4 A7 A8 A6 A3 A5

Local Alien Invasion 2 B9 Invades A1 A2 A4 A7 B9 A8 A6 A3 A5 Invaded by B (local repo)

Local Alien Invasion 3 B9 Deleted A1 A2 A4 A7 A8 A6 A3 A5 Invaded by B (local repo)

Local Alien Invasion 4 Add B10 A1 A2 A4 A7 A8 A6 A3 A5B10 Invaded by B (local repo)

Local Alien Invasion 5 Delete B10 A1 A2 A4 A7 A8 A6 A3 A5 Invaded by B (local repo)

Local Alien Invasion 6 Add B13,B14 A1 A2 A4 A7 A8 A6 A3 A5 B14 B12 Invaded by B (local repo)

Local Alien Invasion 7 Remove B14 A1 A2 A4 A7 A8 A6 A3 A5 B12 Invaded by B (local repo)

Local Alien Invasion 8 Add B13 A1 A2 A4 A7 A8 A6 A3 A5 B13B12 Invaded by B (local repo)

Local Alien Invasion 9 Remove B13 A1 A2 A4 A7 A8 A6 A3 A5 B12 Invaded by B (local repo)

Local Alien Invasion 10 Remove B12 A1 A2 A4 A7 A8 A6 A3 A5 Invaded by B (local repo)

Local Alien Invasion 11 Add B9, B10 A1 A2 A4 A7 B9 A8 A6 A3 A5B10 Invaded by B (local repo)

Local Alien Invasion 12 Remove B10 A1 A2 A4 A7 B9 A8 A6 A3 A5 Invaded by B (local repo)

Local Alien Invasion 13 Add B11 A1 A2 A4 A7 B9 A8 A6 A3 A5 B11 Invaded by B (local repo)

Local Alien Invasion 14 A2 delete (sync) A1 A2 A4 B9A3 B11 Invaded by B (local repo)

Local Alien Restore Tests restore of local alien nodes

Local Alien Restore 1 Set up A1B1 Invaded by B (local repo)

Local Alien Restore 2 Add B2 A1B1 B2 Invaded by B (local repo)

Local Alien Restore 3 Delete B2 A1B1 Invaded by B (local repo)

Local Alien Restore 4 Restore B2 A1B1 B2 Invaded by B (local repo)

Local Alien Restore 5 Add B3 A1B1 B3 B2 Invaded by B (local repo)

Local Alien Restore 5 Remove B2 A1B1 Invaded by B (local repo)

Local Alien Restore 6 Restore B2 to B1 A1B1 B3 B2 Invaded by B (local repo)

Multi Repo Move Tests move via transfer

Multi Repo Move 1 Transfer C2, C3 C3 B1 Invaded by B (local repo) C2 Invaded by A

Multi Repo Move 2 Transfer A4, A5 A5 C3A4 B1 Invaded by B (local repo) C2 Invaded by A

Multi Repo Move 3 Move A5 to C3 (transfer sync) C3A4 B1 Invaded by B (local repo) C2 A5 Invaded by A

Multi Repo Move 4 Add B6 C3A4 B1 Invaded by B (local repo) C2 A5 Invaded by A B6

Multi Repo Move 5 Move A5 to C2 A5 C3A4 B1 B6 Invaded by B (local repo) C2 Invaded by A

Multi Repo Move 6 Move A5 to A4 C3A4 B1 Invaded by B (local repo) C2 A5 Invaded by A B6

Multi Repo Transfer Tests multi-repo transfer Mocks Descriptor service

Source trees not shown B1 Invaded by B (local repo) {Root} Multi Repo Transfer Setup Invaded by C

Transfer A2, A3 A2 B1 A3 Invaded by B (local repo) {Root}/images {Root} Multi Repo Transfer 1 Invaded by C

Transfer C3 A2 B1 A3 Invaded by B (local repo) C3 {Root}/images {Root} Multi Repo Transfer 2 Invaded by C

Transfer C3 A2 B1 C4 A3 Invaded by B (local repo) C3 {Root}/images {Root} Multi Repo Transfer 3 Invaded by C

Sync C4 delete A2 B1 A3 Invaded by B (local repo) C3 {Root}/images {Root} Multi Repo Transfer 4 Invaded by C

Remove C3 transfer Archive Node Ref A2 B1 A3 Invaded by B (local repo) {Root}/images {Root} Multi Repo Transfer 1 Invaded by C

That’s all folks!