DOCSLIB.ORG

Lecture 12 Splay Trees

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lecture 12 Splay Trees Lecture 12 Splay Trees A splay tree is a data structure invented by Sleator and Tarjan [94, 100] for maintaining a set of elements drawn from a totally ordered set and allowing memb ership testing, insertions, and deletions among other op erations at an amortized cost of O log n per op eration. The most interesting asp ect of the structure is that, unlike balanced tree schemes such as 2-3 trees or AVL trees, it is not necessary to rebalance the tree explicitly after every op eration|it happ ens automatically. Splay trees are binary trees, but they need not b e balanced. The heightof a splay tree of n elements can b e greater than log n; indeed, it can b e as great as n 1. Thus individual op erations can takeasmuch as linear time. However, as op erations are p erformed on the tree, it tends to rebalance itself, and in the long run the amortized complexityworks out to O log nper op eration. Data is represented at all no des of a splay tree. The data values are distinct and drawn from a totally ordered set. The data items will always be maintained in inorder; that is, for anynodex, the elements o ccupying the left subtree of x are all less than x, and those o ccupying the right subtree of x are all greater than x. Splay trees supp ort the following op erations: memberi; S : determine whether element i is in splay tree S inserti; S : insert i into S if it is not already there deletei; S : delete i from S if it is there 58 Lecture 12 Splay Trees 59 0 0 joinS; S : join S and S into a single splay tree, assuming that x<y 0 for all x 2 S and y 2 S 0 00 spliti; S : split the splay tree S into two new splay trees S and S 0 00 such that x i y for all x 2 S and y 2 S . All these op erations are implemented in terms of a single basic op eration, called a splay: splay i; S : reorganize the splay tree S so that element i is at the ro ot if i 2 S , and otherwise the new ro ot is either maxfk 2 S j k<ig or minfk 2 S j k>ig : All of the op erations mentioned ab ove can be p erformed with a constant number of splays in addition to a constant number of other low-level op er- ations such as p ointer manipulations and comparisons. For example, to do 0 joinS; S , rst call splay +1;S to reorganize S so that its largest element is at the ro ot and all other elements are contained in the left subtree of the 0 ro ot; then make S the right subtree. To do deletei; S , call splay i; S to bring i to the ro ot if it is there; then remove i and call join to merge the left and right subtrees. 12.1 Implementation of Splay The splay op eration can b e implemented in terms of the even more elementary rotate op eration. Given a binary tree S and a no de x with parent y , the op eration rotatex moves x up and y down and changes a few p ointers, according to the following picture: s x y s @ @ @ @ @ @ x s s y A A @ @ rotatex A A - @ @ C A A A @ @ A A A A A A rotatey A A A A A B B C A A A A A A A A Avery simple but imp ortant observation to make at this p oint is that the rotate op eration preserves inorder numb ering. To implement splay x; S , we might rotate x up until it b ecomes the ro ot. However, in order to achieve the desired amortized complexity b ounds, we need to be a little more careful. Dep ending on the relationship of x to its parent and grandparent, we distinguish three di erent cases: 60 Lecture 12 Splay Trees i if x has a parent but no grandparent, we just rotatex; ii if x has a parent y and a grandparent, and if x and y are either b oth left children or b oth rightchildren, we rst rotatey , then rotatex; iii if x has a parent y and a grandparent, and if one of x, y is a left child and the other is a right child, we rst rotatex and then rotatex again. Example 12.1 Apply splay 1;Sto the following tree S : 10 10 s s 9 9 s s 8 8 s s 7 7 s s 6 6 s s case ii case ii - - 5 5 s s 4 4 s s 3 1 s s @ 2 2 s @ s @ 1 3 s @ s 10 s 10 s 9 s 9 s 8 s 8 s 7 s 1 s case ii case ii 6 s @ - - 6 s @ 1 s @ 4 7 @ s s @ 4 @s @ 2 5 @ s s @ 2 5 s @s @ 3 @ s @ 3 s @ 10 1 s s @ 1 10 s @ s @ 8 8 @ s s @ @ case i 6 9 6 9 @ s s s s - @ @ @ 4 7 4 7 s s @ s s @ @ @ 2 5 2 5 s s @ s s @ @ @ 3 3 s @ s @ Lecture 12 Splay Trees 61 Applying splay to no de 2 of the resulting tree yields: 1 s @ 10 2 @ s s @ 8 1 8 @ s s s @ @ 6 9 10 @ - @ s s s @ 4 7 4 9 @ s s s s @ @ 2 5 3 6 @ @ s s s s @ @ 3 5 7 @ @ s s s Note that the tree app ears to b ecome more balanced with each splay. 2 12.2 Analysis We will now show that the time required to p erform m op erations on a set of n elements is O m log n. To do this, we use a credit accounting scheme similar to the one used in our analysis of Fib onacci heaps. Eachnodex of the splay tree has a savings account containing a certain number of credits. When x is created, some numb er of credits are charged to the insert op eration that created x, and these credits are dep osited to x's account. These credits can be used later to pay for restructuring op erations. For x a no de of a splay tree, let S x denote the subtree ro oted at x. Let jS j denote the number of no des in tree S . De ne S = blog j S jc x = S x : We maintain the following credit invariant: No de x always has at least x credits on dep osit. Lemma 12.2 Each operation splay x; S requires no more than 3S x+1 credits to perform the operation and maintain the credit invariant. Proof. Let y b e the parentofx and z b e the parentofy , if it exists. Let 0 and be the values of b efore and after the splay op eration, resp ectively. We consider three cases: 62 Lecture 12 Splay Trees i Node z does not exist. This is the last rotation in the splay;we p erform a single rotatex. We are willing to pay no more than 0 3 x x+1 credits for this rotation. Note that 0 x = y 0 0 y x : In order to maintain the invariant, we need to sp end 0 0 0 x+ y x y = y x 0 x x 0 3 x x credits. We are left with at least one credit left over to pay for the constant number of low-level op erations such as p ointer manipulations and comparisons. ii Node x is the left child of y and y is the left child of z or both x and y are right children. In this case we p erform a rotatey followed by 0 a rotatex. We will show that it costs no more than 3 x x credits to p erform these two rotate op erations and maintain the credit invariant. Thus if a sequence of these are done to move x up the tree as in the example ab ove, we will get a telescoping sum, so that the total amount sp ent will be no more than 3S x + 1 the +1 comes from the last rotation as discussed in case i. In order to maintain the invariant, we need 0 0 0 x+ y + z x y z 20 0 extra credits. Since x=z , we have 0 0 0 x+ y + z x y z 0 0 = y + z x y 0 0 = y x+ z y 0 0 x x+ x x 0 = 2 x x : 0 We can a ord to pay for this and have x x credits left over to pay for the constant number of low-level op erations needed to p erform 0 these two rotations. Unfortunately, it may turn out that x = x, in which case we have nothing left over. We show that in this case the quantity 20 is in fact strictly negative, thus the invariant is maintained Lecture 12 Splay Trees 63 for free and we can even a ord to sp end one of our saved credits to pay for the low-level op erations. All we need to do is to show that the two assumptions 0 x = x 0 0 0 x+ y + z x+y + z 0 lead to a contradiction.
Load more

Recommended publications
  • Amortized Analysis Worst-Case Analysis
    Beyond Worst Case Analysis Amortized Analysis Worst-case analysis. ■ Analyze running time as function of worst input of a given size. Average case analysis. ■ Analyze average running time over some distribution of inputs. ■ Ex: quicksort. Amortized analysis. ■ Worst-case bound on sequence of operations. ■ Ex: splay trees, union-find. Competitive analysis. ■ Make quantitative statements about online algorithms. ■ Ex: paging, load balancing. Princeton University • COS 423 • Theory of Algorithms • Spring 2001 • Kevin Wayne 2 Amortized Analysis Dynamic Table Amortized analysis. Dynamic tables. ■ Worst-case bound on sequence of operations. ■ Store items in a table (e.g., for open-address hash table, heap). – no probability involved ■ Items are inserted and deleted. ■ Ex: union-find. – too many items inserted ⇒ copy all items to larger table – sequence of m union and find operations starting with n – too many items deleted ⇒ copy all items to smaller table singleton sets takes O((m+n) α(n)) time. – single union or find operation might be expensive, but only α(n) Amortized analysis. on average ■ Any sequence of n insert / delete operations take O(n) time. ■ Space used is proportional to space required. ■ Note: actual cost of a single insert / delete can be proportional to n if it triggers a table expansion or contraction. Bottleneck operation. ■ We count insertions (or re-insertions) and deletions. ■ Overhead of memory management is dominated by (or proportional to) cost of transferring items. 3 4 Dynamic Table: Insert Dynamic Table: Insert Dynamic Table Insert Accounting method. Initialize table size m = 1. ■ Charge each insert operation $3 (amortized cost). – use $1 to perform immediate insert INSERT(x) – store $2 in with new item IF (number of elements in table = m) ■ When table doubles: Generate new table of size 2m.
    [Show full text]
  • Search Trees
    Lecture III Page 1 “Trees are the earth’s endless effort to speak to the listening heaven.” – Rabindranath Tagore, Fireflies, 1928 Alice was walking beside the White Knight in Looking Glass Land. ”You are sad.” the Knight said in an anxious tone: ”let me sing you a song to comfort you.” ”Is it very long?” Alice asked, for she had heard a good deal of poetry that day. ”It’s long.” said the Knight, ”but it’s very, very beautiful. Everybody that hears me sing it - either it brings tears to their eyes, or else -” ”Or else what?” said Alice, for the Knight had made a sudden pause. ”Or else it doesn’t, you know. The name of the song is called ’Haddocks’ Eyes.’” ”Oh, that’s the name of the song, is it?” Alice said, trying to feel interested. ”No, you don’t understand,” the Knight said, looking a little vexed. ”That’s what the name is called. The name really is ’The Aged, Aged Man.’” ”Then I ought to have said ’That’s what the song is called’?” Alice corrected herself. ”No you oughtn’t: that’s another thing. The song is called ’Ways and Means’ but that’s only what it’s called, you know!” ”Well, what is the song then?” said Alice, who was by this time completely bewildered. ”I was coming to that,” the Knight said. ”The song really is ’A-sitting On a Gate’: and the tune’s my own invention.” So saying, he stopped his horse and let the reins fall on its neck: then slowly beating time with one hand, and with a faint smile lighting up his gentle, foolish face, he began..
    [Show full text]
  • Splay Trees Last Changed: January 28, 2017
    15-451/651: Design & Analysis of Algorithms January 26, 2017 Lecture #4: Splay Trees last changed: January 28, 2017 In today's lecture, we will discuss: • binary search trees in general • definition of splay trees • analysis of splay trees The analysis of splay trees uses the potential function approach we discussed in the previous lecture. It seems to be required. 1 Binary Search Trees These lecture notes assume that you have seen binary search trees (BSTs) before. They do not contain much expository or backtround material on the basics of BSTs. Binary search trees is a class of data structures where: 1. Each node stores a piece of data 2. Each node has two pointers to two other binary search trees 3. The overall structure of the pointers is a tree (there's a root, it's acyclic, and every node is reachable from the root.) Binary search trees are a way to store and update a set of items, where there is an ordering on the items. I know this is rather vague. But there is not a precise way to define the gamut of applications of search trees. In general, there are two classes of applications. Those where each item has a key value from a totally ordered universe, and those where the tree is used as an efficient way to represent an ordered list of items. Some applications of binary search trees: • Storing a set of names, and being able to lookup based on a prefix of the name. (Used in internet routers.) • Storing a path in a graph, and being able to reverse any subsection of the path in O(log n) time.
    [Show full text]
  • Leftist Heap: Is a Binary Tree with the Normal Heap Ordering Property, but the Tree Is Not Balanced. in Fact It Attempts to Be Very Unbalanced!
    Leftist heap: is a binary tree with the normal heap ordering property, but the tree is not balanced. In fact it attempts to be very unbalanced! Definition: the null path length npl(x) of node x is the length of the shortest path from x to a node without two children. The null path lengh of any node is 1 more than the minimum of the null path lengths of its children. (let npl(nil)=-1). Only the tree on the left is leftist. Null path lengths are shown in the nodes. Definition: the leftist heap property is that for every node x in the heap, the null path length of the left child is at least as large as that of the right child. This property biases the tree to get deep towards the left. It may generate very unbalanced trees, which facilitates merging! It also also means that the right path down a leftist heap is as short as any path in the heap. In fact, the right path in a leftist tree of N nodes contains at most lg(N+1) nodes. We perform all the work on this right path, which is guaranteed to be short. Merging on a leftist heap. (Notice that an insert can be considered as a merge of a one-node heap with a larger heap.) 1. (Magically and recursively) merge the heap with the larger root (6) with the right subheap (rooted at 8) of the heap with the smaller root, creating a leftist heap. Make this new heap the right child of the root (3) of h1.
    [Show full text]
  • SPLAY Trees • Splay Trees Were Invented by Daniel Sleator and Robert Tarjan
    Red-Black, Splay and Huffman Trees Kuan-Yu Chen (陳冠宇) 2018/10/22 @ TR-212, NTUST Review • AVL Trees – Self-balancing binary search tree – Balance Factor • Every node has a balance factor of –1, 0, or 1 2 Red-Black Trees. • A red-black tree is a self-balancing binary search tree that was invented in 1972 by Rudolf Bayer – A special point to note about the red-black tree is that in this tree, no data is stored in the leaf nodes • A red-black tree is a binary search tree in which every node has a color which is either red or black 1. The color of a node is either red or black 2. The color of the root node is always black 3. All leaf nodes are black 4. Every red node has both the children colored in black 5. Every simple path from a given node to any of its leaf nodes has an equal number of black nodes 3 Red-Black Trees.. 4 Red-Black Trees... • Root is red 5 Red-Black Trees…. • A leaf node is red 6 Red-Black Trees….. • Every red node does not have both the children colored in black • Every simple path from a given node to any of its leaf nodes does not have equal number of black nodes 7 Searching in a Red-Black Tree • Since red-black tree is a binary search tree, it can be searched using exactly the same algorithm as used to search an ordinary binary search tree! 8 Insertion in a Red-Black Tree • In a binary search tree, we always add the new node as a leaf, while in a red-black tree, leaf nodes contain no data – For a given data 1.
    [Show full text]
  • Amortized Complexity Analysis for Red-Black Trees and Splay Trees
    International Journal of Innovative Research in Computer Science & Technology (IJIRCST) ISSN: 2347-5552, Volume-6, Issue-6, November2018 DOI: 10.21276/ijircst.2018.6.6.2 Amortized Complexity Analysis for Red-Black Trees and Splay Trees Isha Ashish Bahendwar, RuchitPurshottam Bhardwaj, Prof. S.G. Mundada Abstract—The basic conception behind the given problem It stores data in more efficient and practical way than basic definition is to discuss the working, operations and complexity data structures. Advanced data structures include data analyses of some advanced data structures. The Data structures like, Red Black Trees, B trees, B+ Trees, Splay structures that we have discussed further are Red-Black trees Trees, K-d Trees, Priority Search Trees, etc. Each of them and Splay trees.Red-Black trees are self-balancing trees has its own special feature which makes it unique and better having the properties of conventional tree data structures along with an added property of color of the node which can than the others.A Red-Black tree is a binary search tree with be either red or black. This inclusion of the property of color a feature of balancing itself after any operation is performed as a single bit property ensured maintenance of balance in the on it. Its nodes have an extra feature of color. As the name tree during operations such as insertion or deletion of nodes in suggests, they can be either red or black in color. These Red-Black trees. Splay trees, on the other hand, reduce the color bits are used to count the tree’s height and confirm complexity of operations such as insertion and deletion in trees that the tree possess all the basic properties of Red-Black by splayingor making the node as the root node thereby tree structure, The Red-Black tree data structure is a binary reducing the time complexity of insertion and deletions of a search tree, which means that any node of that tree can have node.
    [Show full text]
  • Performance Analysis of Bsts in System Software∗
    Performance Analysis of BSTs in System Software∗ Ben Pfaff Stanford University Department of Computer Science [email protected] Abstract agement and networking, and the third analyzes a part of a source code cross-referencing tool. In each Binary search tree (BST) based data structures, such case, some test workloads are drawn from real-world as AVL trees, red-black trees, and splay trees, are of- situations, and some reflect worst- and best-case in- ten used in system software, such as operating system put order for BSTs. kernels. Choosing the right kind of tree can impact performance significantly, but the literature offers few empirical studies for guidance. We compare 20 BST We compare four variants on the BST data struc- variants using three experiments in real-world scenar- ture: unbalanced BSTs, AVL trees, red-black trees, ios with real and artificial workloads. The results in- and splay trees. The results show that each should be dicate that when input is expected to be randomly or- preferred in a different situation. Unbalanced BSTs dered with occasional runs of sorted order, red-black are best when randomly ordered input can be relied trees are preferred; when insertions often occur in upon; if random ordering is the norm but occasional sorted order, AVL trees excel for later random access, runs of sorted order are expected, then red-black trees whereas splay trees perform best for later sequential should be chosen. On the other hand, if insertions or clustered access. For node representations, use of often occur in a sorted order, AVL trees excel when parent pointers is shown to be the fastest choice, with later accesses tend to be random, and splay trees per- threaded nodes a close second choice that saves mem- form best when later accesses are sequential or clus- ory; nodes without parent pointers or threads suffer tered.
    [Show full text]
  • Lecture 4 1 Overview 2 Splay Tree Properties
    ICS 691: Advanced Data Structures Spring 2016 Lecture 4 Prof. Nodari Sitchinava Scribe: Ben Karsin 1 Overview In the last lecture we discussed splay trees, as detailed in [ST85]. We saw that splay trees are c-competitive with the optimal binary search tree in the static case by analyzing the 3 operations used by splay trees. In this lecture we continue our analysis of splay trees with the introduction and proof of several properties that splay trees exhibit and introduce the geometric view of BSTs. In Section 2 we define several properties of splay trees and BSTs in general. In Section 3 we introduce the geometric view of BSTs by defining arborally satisfied sets of points and proving that they are equivalent to BSTs. 2 Splay Tree Properties Property 1. (Static Finger Bound): The amortized cost c^f (x) of searching for x in a splay tree, given a fixed node f is: c^f (x) = O(log (1 + jx − fj)) where jx − fj is the distance from node x to f in the total order. The Static Finger Bound says that accessing any element x can be bounded by the logarithm of the distance from some designated node f. Informally, it can be viewed as placing a finger on node f, starting each search from f in a tree balanced around f. 1 Proof. To prove this property for splay trees, let the weight function be w(x) = (1+x−f)2 . Then sroot, the value of the root node, can be bounded by: X 1 s = root (1 + x − f)2 x2tree 1 X 1 ≤ (1 + k − f)2 k=−∞ 1 X 1 π2 ≤ = k2 3 −∞ = O(1) 1 This tells us that the size function of the root node is bounded by a constant.
    [Show full text]
  • Data Structures Lecture 11
    Fall 2021 Fang Yu Software Security Lab. Data Structures Dept. Management Information Systems, National Chengchi University Lecture 11 Search Trees Binary Search Trees, AVL trees, and Splay Trees 3 Binary Search Trees ¡ A binary search tree is a binary tree storing keys (or key-value ¡ An inorder traversal of a binary entries) at its internal nodes and search trees visits the keys in an satisfying the following increasing order property: ¡ Let u, v, and w be three nodes such that u is in the left subtree of v and w is in the right subtree of v. 6 We have key(u) ≤ key(v) ≤ key(w) 2 9 ¡ External nodes do not store items 1 4 8 4 Search Algorithm TreeSearch(k, v) ¡ To search for a key k, we trace if T.isExternal (v) a downward path starting at the return v root if k < key(v) return TreeSearch(k, T.left(v)) ¡ The next node visited depends else if k key(v) on the comparison of k with the = return v key of the current node else { k > key(v) } ¡ If we reach a leaf, the key is return TreeSearch(k, T.right(v)) not found < 6 ¡ Example: get(4): 2 9 > ¡ Call TreeSearch(4,root) 1 4 = 8 ¡ The algorithms for floorEntry and ceilingEntry are similar 5 Insertion 6 ¡ To perform operation put(k, o), < we search for key k (using 2 9 > TreeSearch) 1 4 8 > ¡ Assume k is not already in the tree, and let w be the leaf w reached by the search 6 ¡ We insert k at node w and expand w into an internal node 2 9 ¡ Example: insert 5 1 4 8 w 5 6 Deletion 6 ¡ To perform operation remove(k), < we search for key k 2 9 > ¡ Assume key k is in the tree, and 1 4 v 8 let v be
    [Show full text]
  • Lecture 5: Splay Trees 1 Introduction 2 Splay(X)
    15-750: Graduate Algorithms February 3, 2016 Lecture 5: Splay Trees Lecturer: Gary Miller Scribe: Jiayi Li, Tianyi Yang 1 Introduction Recall from previous lecture that balanced binary search trees (BST) are those whose max depths are O(log n). While this property guarantees balanced BST to have O(log n) worst-case perfor- mance, sometimes the worst-case performance may not be of the most interest. Indeed, suppose a worst-case query is searched multiple times, ideally we would want the data structure to adjust itself to accommodate the observed empirical frequency so that when the same query is searched again, a faster time can be achieved. The splay tree is a variant of BST that does exactly that. Every time Search(x) is called on a splay tree, (assume x is indeed in the tree), in addition to the searching, the splay tree also rotates x to the root using a specialized function Splay(x). Although splay trees are not balanced according to the worst-case standard, they are \self- balancing" thanks to Splay(x) in that no information is stored to maintain the balance. In the long run, the amortized complexity works out to O(log n) per operation. 2 Splay(x) As mentioned above, the distinguished feature of splay trees is the function Splay(x). Splay(x) rotates a node x to the root using a series of three rules, which are described below. We give to definitions of these rules. The first is an imperative description using rotations, while the second describes the new BST as a change to an insertion order or priority order that determines the original tree.
    [Show full text]
  • AVL/Splay Trees
    AVL/Splay Trees S. Thiel Self-Organizing Lists Balanced Trees AVL Trees AVL/Splay Trees Splay Trees References S. Thiel1 1Department of Computer Science & Software Engineering Concordia University July 17, 2019 1/43 Outline AVL/Splay Trees S. Thiel Self-Organizing Lists Balanced Trees AVL Trees Self-Organizing Lists Splay Trees References Balanced Trees AVL Trees Splay Trees References 2/43 Self-Organizing Lists [1, p.307] AVL/Splay Trees S. Thiel Self-Organizing Lists Balanced Trees AVL Trees Splay Trees References I We have looked at organizing list by value I That's not the only option I If we want to find something quickly, are there faster options? 3/43 Organizing by Frequency 1 [1, p.307] AVL/Splay Trees S. Thiel Self-Organizing Lists If we just want a fast access to what we're looking for Balanced Trees I AVL Trees Splay Trees I We can organize by frequency, as this is often cheap References I This applies when we know about the frequency: I e.g.: for ki elements where each value has probability pi I When sorting linearly, assuming the above frequencies were ordered for convenience: I Total comparisons to find each value once is: Cn = 1p0 + 2p1 + ::: + npn−1 2 I In general, Cn is a function of n , and thus each find is Θ(n) in the average case 1 1being the case where the probabilities are followed 4/43 Organizing by Frequency 2 [1, p.307-308] AVL/Splay Trees S. Thiel Self-Organizing Lists Balanced Trees AVL Trees Splay Trees I What if pn are geometric series? References 1 I What if pi = 2i+1 ? I Cn = 1p0 + 2p1 + ::: + npn−1 I which is just: n−1 X i n + 1 = 2 − 2i 2n−1 i=1 I and as n approaches 1 it is 2 5/43 Access Patterns [1, p.309] AVL/Splay Trees S.
    [Show full text]
  • Sc0 SEARCHING TECHNIQUES Hanan Samet Computer Science Department and Center for Automation Research and Institute for Advanced C
    sc0 SEARCHING TECHNIQUES Hanan Samet Computer Science Department and Center for Automation Research and Institute for Advanced Computer Studies University of Maryland College Park, Maryland 20742 e-mail: [email protected] Copyright © 1997 Hanan Samet These notes may not be reproduced by any means (mechanical or elec- tronic or any other) without the express written permission of Hanan Samet sc1 SEARCHING • Simplest technique is to look at every record until finding the one we are looking for (known as sequential search) • Speeding up sequential search: 1. table-lookup • assumes existence of 1-1 mapping from dataset (i.e., one of the key values) to a memory address • frequently 1-1 mapping does not exist and use hashing to calculate a good starting point for the search 2. preprocess data by sorting it • search is implemented by the repeated application of a partitioning process to the set of key values until locating the desired record a. tree-based • partitions the set of key values • e.g., binary search trees, AVL trees, B-trees, … b. trie-based • partitions based on the digits or characters that comprise the domain of the key values • e.g., digital searching, radix-trees, most quadtree methods sc2 SEQUENTIAL SEARCHING • Simplest way to search • Two tests: 1. has every record in the file been examined? 2. is the current record the one we want? • Expected cost of success is 2·n/2 = n tests • Expected cost of failure is 2n tests • Speed up sequential search by inserting the record with the desired key value k at the end of the file • eliminates need to test if all records have been examined • n/2 tests for success and n+1 tests for failure • halve the execution time at the cost of one additional location • assumes we know location of the end of the file for insertion • For greater speedups, records need to be sorted 1.
    [Show full text]