CSE 326 Data StructuresPart 10Advanced Data Structures.ppt

CSE 326: Data StructuresPart 10Advanced Data Structures Henry Kautz Autumn Quarter 2002 Outline Multidimensional search trees Range Queries k-D Trees Quad Trees Randomized Data Structures Algorithms Treaps Primality testing Local search for NP-complete problems Multi-D Search ADT Dictionary operations create destroy find insert delete range queries Each item has k keys for a k-dimensional search tree Searches can be performed on one, some, or all the keys or on ranges of the keys Applications of Multi-D Search Astronomy (simulation of galaxies) - 3 dimensions Protein folding in molecular biology - 3 dimensions Lossy data compression - 4 to 64 dimensions Image processing - 2 dimensions Graphics - 2 or 3 dimensions Animation - 3 to 4 dimensions Geographical databases - 2 or 3 dimensions Web searching - 200 or more dimensions Range Query A range query is a search in a dictionary in which the exact key may not be entirely specified. Range queries are the primary interface with multi-D data structures. Range Query Examples:Two Dimensions Search for items based on just one key Search for items based on ranges for all keys Search for items based on a function of several keys: e.g., a circular range query Range Querying in 1-D Range Querying in 1-D with a BST 1-D Range Querying in 2-D 2-D Range Querying in 2-D k-D Trees Split on the next dimension at each succeeding level If building in batch, choose the median along the current dimension at each level guarantees logarithmic height and balanced tree In general, add as in a BST Find in a k-D Tree find(x1,x2, …, xk, root) finds the node which has the given set of keys in it or returns null if there is no such node Find Example Building a 2-D Tree (1/4) Building a 2-D Tree (2/4) Building a 2-D Tree (3/4) Building a 2-D Tree (4/4) k-D Tree 2-D Range Querying in 2-D Trees Range Query in a 2-D Tree print_range(int xlow, xhigh, ylow, yhigh, Node root) { if (root == NULL) return; if ( xlow = root.x root.x = xhigh ylo