DOCSLIB.ORG

The R*-Tree: an Efficient and Robust Access Method for Points And

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The R*-Tree: an Efficient and Robust Access Method for Points And The R*-tree: An Efficient and Robust Access Method for Points and Rectangles+ Norbert Beckmann, Hans-Peterbegel Ralf Schneider,Bernhard Seeger Praktuche Informatlk, Umversltaet Bremen, D-2800 Bremen 33, West Germany Abstract The most important property of this simple approxlmatlon The R-tree, one of the most popular access methods for 1s that a complex object 1s represented by a limited number rectangles, IS based on the heurlstlc optlmlzatlon of the area of bytes Although a lot of mformatlon 1s lost, mnumum of the enclosmg rectangle m each mner node By running bounding rectangles of spatial oblects preserve the most numerous experiments m a standardized testbed under highly essential geometric properties of the object, 1 e the varying data, queries and operations, we were able to design location of the oblect and the extension of the object in the R*-tree which mcorporates a combined optlmlzatlon of each axis area, margin and overlap of each enclosmg rectangle m the In [SK 881 we showed that known SAMs organlzmg directory Using our standardized testbed m an exhaustive (mmlmum bounding) rectangles are based on an underlymg performance comparison, It turned out that the R*-tree point access method (PAM) using one of the followmg three clearly outperforms the exlstmg R-tree varmnts Guttman’s techniques cllpplng, transformation and overlapping linear and quadratic R-tree and Greene’s variant of the R-tree regions This superlorlty of the R*-tree holds for different types of The most popular SAM for storing rectangles 1s the R- queries and operations, such as map overlay. for both tree [Gut 841 Followmg our classlflcatlon, the R-tree 1s rectangles and multldlmenslonal points m all experiments based on the PAM B+-tree [Knu 731 usmg the technique From a practical pomt of view the R*-tree 1s very attractive over-lapping regions Thus the R-tree can be easily because of the followmg two reasons 1 It effrclently implemented which considerably contributes to Its supports pomt and spattal data at the same time and 2 Its popularity lmplementatlon cost 1s only slightly higher than that of other R-trees The R-tree 1s based on a heurlstlc optlmlzatlon The optlmlzatton crlterlon which It persues, 1s to mmlmlze the l.Introduction area of each enclosing rectangle m the mner nodes This In this paper we will consider spatial access methods crlterlon IS taken for granted and not shown to be the best (SAMs) which are based on the approxlmatlon of a complex possible Questions arise such as Why not mnumlze the spatial object by the mmlmum boundmg rectangle with the margin or the overlap of such mlnlmum bounding sides of the rectangle parallel to the axes of the data space rectangles Why not optimize storage utlllzatlon? Why not optunlze all of these criteria at the same hme? Could these criteria mteract in a negative way? Only an engineering approach will help to find the best possible combmatlon of yIp--- + This work was supported by grant no Kr 670/4-3 from the optimization criteria Deutsche Forschun&iememschaft (German Research Necessary condltlon for such an engmeermg approach 1s Society) and by the Mmlstry of Environmental and Urban the avallablhty of a standardized testbed which allows us to Planning of Bremen run large volumes of experiments with highly varying data, queries and operations We have implemented such a standardized testbed and used It for performance comparisons parucularly of pomt access methods [KSSS 891 Pemxss~on to copy wthout fee all or part of this maternal IS granted prowded As the result of our research we designed a new R-tree that the copses are not made or dlstnbuted for dwzct commeraal advantage, the varmnt, the R*-tree, which outperforms the known R-tree ACM copy&t notice and the title of the pubbcatlon and its date appear, and notw IS gwn that cqymg II by pemuwon of the Assoaatlon for Computmg variants under all experiments For many reallstlc profiles Machmq To copy othemw, or to repubbsh requ,res a fee and/or speoflc of data and operations the gam m performance 1s quite pemllsslon 0 1990 ACM 089791365 5/!90/0@35/0322$150 considerable Additionally to the usual point query, 322 rectangle mtersectton and rectangle enclosure query, we have parameters of good retrieval performance affect each other m analyzed our new R*-tree for the map overlay operation. a very complex way, such that rt 1s rmposstble to optrmlze also called spatial lout. which 1s one of the most rmportant one of them without influencing other parameters whtch operatrons m geographic and envrronmental database may cause a deterroratron of the overall performance systems Moreover, smce the data rectangles may have very different This paper is organized as follows In sectron 2, we size and shape and the drrectory rectangles grow and shrmk tntroduce the prrncrples of R-trees rncludrng their dynamically, the success of methods which wrll opttmrze optimizatron criteria In section 3 we present the existing one parameter 1svery uncertam Thus a heurrstrc approach IS R-tree variants of Guttman and Greene Section 4 describes applied, whrch is based on many different experiments rn detail the design our new R*-tree The results of the carried out m a systematrc framework comparrsons of the R*-tree wrth the other R-tree varmnts are reported m section 5 Section 6 concludes the paper In this section some of the parameters which are essential for the retrieval performance are considered Furthermore, 2. Principles of R-trees and possible tnterdependencres between different parameters and optimization criteria optnnrzatron criteria are analyzed An R-tree 1s a B+-tree like structure which stores multrdrm- (01) The area covered by a drrectory rectangle should be ensional rectangles as complete ObJects without clipping mtnrmrzed, 1 e the area covered by the boundmg rectangle them or transformmg them to higher drmensronal points but not covered by the enclosed rectangles, the dead space, before should be mmlmrzed Thus will Improve performance smce A non-leaf node contarns entries of the form (cp, decrsrons which paths have to be traversed, can be taken on Rectangle) where cp 1s the address of a child node m the higher levels R-tree and Rectangle 1s the mnumum boundmg rectangle of all rectangles which are entries m that child node A leaf (02) The overlap between drrectory rectangles should be node contams entries of the form (Old, Rectangle) where mwmrzed Thts also decreases the number of paths to be Old refers to a record m the database, describing a spatial traversed oblect and Rectangle 1s the enclosrng rectangle of that spatial oblect Leaf nodes containing entries of the form (03) The margrn of a dwectory rectangle should be (datuob.tect, Rectangle) are also possrble This wrll not mlnrmrzed Here the margin 1s the sum of the lengths of the affect the basic structure of the R-tree In the followmg we edges of a rectangle Assummg fixed area, the oblect wnh wrll not consider such leaf nodes the smallest margrn IS the square Thus mmtmrzmg the margin mstead of the area, the dvectory rectangles wrll be Let M be the maximum number of entries that will fit m one shaped more quadratrc Essentrally queries with large node and let m be a parameter specrfymg the mrmmum quadratic query rectangles will profit from this optimizatron number of entries m a node (2 5 m < M/2) An R-tree More important. mmrmrzatlon of the margm wrll basrcally satisfies the following properties improve the structure Since quadratic objects can be packed l The root has at least two children unless rt 1s a leaf easier, the bounding boxes of a level will build smaller l Every non-leaf node has between m and M children unless directory rectangles m the level above Thus clustermg it is the root rectangles into bounding boxes wrth only little variance of l Every leaf node contans between m and M entries unless the lengths of the edges wrll reduce the area of dtrectory It 1s the root rectangles l All leaves appear on the same level (04) Storage utlltzatron should be optlmrzed Higher An R-tree (R*-tree) 1s completely dynamrc, msertrons and storage utrhzatron will generally reduce the query cost as the deletions can be intermixed with queries and no perrodrc height of the tree wrll be kept low Evidently. query types global reorgamzatron 1s required Obvrously, the structure with large query rectangles are influenced more smce the must allow overlappmg drrectory rectangles Thus rt cannot concentratron of rectangles m several nodes wrll have a guarantee that only one search path 1s requued for an exact stronger effect rf the number of found keys IS hrgh match query For further mformatron we refer to [Gut841 We wrll show m this paper that the overlappmg-regrons- Keepmg the area and overlap of a directory rectangle small, techruque does not rmply bad average retrieval performance requires more freedom m the number of rectangles stored m Here and rn the followmg, we use the term directory one node Thus mmrmrzmg these parameters will be paid rectangle, which 1s geometrrcally the minrmum bounding with lower storage utrlrzatton. Moreover, when applymg rectangle of the underlymg rectangles (01) or (02) more freedom rn choosrng the shape 1s necessary Thus rectangles wrll be less quadratic Wrth (01) The main problem rn R-trees 1s the followrng For an the overlap between directory rectangles may be affected m arbitrary set of rectangles, dynamrcally burld up bounding a postttve way srnce the coverrng of the data space 1s boxes from subsets of between m and M rectangles, m a reduced As for every geometrrc optrmrzatron, muumrzmg way that arbitrary retrieval operatrons with query rectangles the margins wrll also lead to reduced storage uttltzatton of arbitrary srze are supported effrcrently The known However, smce more quadratrc directory rectangles support 323 packing better, It will be easier to maintain high storage Algorithm QuadraticSplit utlllzatlon Obviously, the performance for queries with [Divide a set of M+l entries mto two groups] sufflclently large query rectangles will be affected more by QSl Invoke PickSeeds to choose two entries to be the first the storage utlllzatlon than by the parameters of (Ol)-(03) entries of the groups QS2 Repeat DlstrlbuteEntry 3.
Load more

Recommended publications
  • Tree-Combined Trie: a Compressed Data Structure for Fast IP Address Lookup
    (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 6, No. 12, 2015 Tree-Combined Trie: A Compressed Data Structure for Fast IP Address Lookup Muhammad Tahir Shakil Ahmed Department of Computer Engineering, Department of Computer Engineering, Sir Syed University of Engineering and Technology, Sir Syed University of Engineering and Technology, Karachi Karachi Abstract—For meeting the requirements of the high-speed impact their forwarding capacity. In order to resolve two main Internet and satisfying the Internet users, building fast routers issues there are two possible solutions one is IPv6 IP with high-speed IP address lookup engine is inevitable. addressing scheme and second is Classless Inter-domain Regarding the unpredictable variations occurred in the Routing or CIDR. forwarding information during the time and space, the IP lookup algorithm should be able to customize itself with temporal and Finding a high-speed, memory-efficient and scalable IP spatial conditions. This paper proposes a new dynamic data address lookup method has been a great challenge especially structure for fast IP address lookup. This novel data structure is in the last decade (i.e. after introducing Classless Inter- a dynamic mixture of trees and tries which is called Tree- Domain Routing, CIDR, in 1994). In this paper, we will Combined Trie or simply TC-Trie. Binary sorted trees are more discuss only CIDR. In addition to these desirable features, advantageous than tries for representing a sparse population reconfigurability is also of great importance; true because while multibit tries have better performance than trees when a different points of this huge heterogeneous structure of population is dense.
    [Show full text]
  • Heaps a Heap Is a Complete Binary Tree. a Max-Heap Is A
    Heaps Heaps 1 A heap is a complete binary tree. A max-heap is a complete binary tree in which the value in each internal node is greater than or equal to the values in the children of that node. A min-heap is defined similarly. 97 Mapping the elements of 93 84 a heap into an array is trivial: if a node is stored at 90 79 83 81 index k, then its left child is stored at index 42 55 73 21 83 2k+1 and its right child at index 2k+2 01234567891011 97 93 84 90 79 83 81 42 55 73 21 83 CS@VT Data Structures & Algorithms ©2000-2009 McQuain Building a Heap Heaps 2 The fact that a heap is a complete binary tree allows it to be efficiently represented using a simple array. Given an array of N values, a heap containing those values can be built, in situ, by simply “sifting” each internal node down to its proper location: - start with the last 73 73 internal node * - swap the current 74 81 74 * 93 internal node with its larger child, if 79 90 93 79 90 81 necessary - then follow the swapped node down 73 * 93 - continue until all * internal nodes are 90 93 90 73 done 79 74 81 79 74 81 CS@VT Data Structures & Algorithms ©2000-2009 McQuain Heap Class Interface Heaps 3 We will consider a somewhat minimal maxheap class: public class BinaryHeap<T extends Comparable<? super T>> { private static final int DEFCAP = 10; // default array size private int size; // # elems in array private T [] elems; // array of elems public BinaryHeap() { .
    [Show full text]
  • Binary Search Tree
    ADT Binary Search Tree! Ellen Walker! CPSC 201 Data Structures! Hiram College! Binary Search Tree! •" Value-based storage of information! –" Data is stored in order! –" Data can be retrieved by value efficiently! •" Is a binary tree! –" Everything in left subtree is < root! –" Everything in right subtree is >root! –" Both left and right subtrees are also BST#s! Operations on BST! •" Some can be inherited from binary tree! –" Constructor (for empty tree)! –" Inorder, Preorder, and Postorder traversal! •" Some must be defined ! –" Insert item! –" Delete item! –" Retrieve item! The Node<E> Class! •" Just as for a linked list, a node consists of a data part and links to successor nodes! •" The data part is a reference to type E! •" A binary tree node must have links to both its left and right subtrees! The BinaryTree<E> Class! The BinaryTree<E> Class (continued)! Overview of a Binary Search Tree! •" Binary search tree definition! –" A set of nodes T is a binary search tree if either of the following is true! •" T is empty! •" Its root has two subtrees such that each is a binary search tree and the value in the root is greater than all values of the left subtree but less than all values in the right subtree! Overview of a Binary Search Tree (continued)! Searching a Binary Tree! Class TreeSet and Interface Search Tree! BinarySearchTree Class! BST Algorithms! •" Search! •" Insert! •" Delete! •" Print values in order! –" We already know this, it#s inorder traversal! –" That#s why it#s called “in order”! Searching the Binary Tree! •" If the tree is
    [Show full text]
  • 6.172 Lecture 19 : Cache-Oblivious B-Tree (Tokudb)
    How TokuDB Fractal TreeTM Indexes Work Bradley C. Kuszmaul Guest Lecture in MIT 6.172 Performance Engineering, 18 November 2010. 6.172 —How Fractal Trees Work 1 My Background • I’m an MIT alum: MIT Degrees = 2 × S.B + S.M. + Ph.D. • I was a principal architect of the Connection Machine CM-5 super­ computer at Thinking Machines. • I was Assistant Professor at Yale. • I was Akamai working on network mapping and billing. • I am research faculty in the SuperTech group, working with Charles. 6.172 —How Fractal Trees Work 2 Tokutek A few years ago I started collaborating with Michael Bender and Martin Farach-Colton on how to store data on disk to achieve high performance. We started Tokutek to commercialize the research. 6.172 —How Fractal Trees Work 3 I/O is a Big Bottleneck Sensor Query Systems include Sensor Disk Query sensors and Sensor storage, and Query want to perform Millions of data elements arrive queries on per second Query recently arrived data using indexes. recent data. Sensor 6.172 —How Fractal Trees Work 4 The Data Indexing Problem • Data arrives in one order (say, sorted by the time of the observation). • Data is queried in another order (say, by URL or location). Sensor Query Sensor Disk Query Sensor Query Millions of data elements arrive per second Query recently arrived data using indexes. Sensor 6.172 —How Fractal Trees Work 5 Why Not Simply Sort? • This is what data Data Sorted by Time warehouses do. • The problem is that you Sort must wait to sort the data before querying it: Data Sorted by URL typically an overnight delay.
    [Show full text]
  • B-Trees M-Ary Search Tree Solution
    M-ary Search Tree B-Trees • Maximum branching factor of M • Complete tree has height = Section 4.7 in Weiss # disk accesses for find : Runtime of find : 2 Solution: B-Trees B-Trees • specialized M-ary search trees What makes them disk-friendly? • Each node has (up to) M-1 keys: 1. Many keys stored in a node – subtree between two keys x and y contains leaves with values v such that • All brought to memory/cache in one access! 3 7 12 21 x ≤ v < y 2. Internal nodes contain only keys; • Pick branching factor M Only leaf nodes contain keys and actual data such that each node • The tree structure can be loaded into memory takes one full irrespective of data object size {page, block } x<3 3≤x<7 7≤x<12 12 ≤x<21 21 ≤x • Data actually resides in disk of memory 3 4 B-Tree: Example B-Tree Properties ‡ B-Tree with M = 4 (# pointers in internal node) and L = 4 (# data items in leaf) – Data is stored at the leaves – All leaves are at the same depth and contain between 10 40 L/2 and L data items – Internal nodes store up to M-1 keys 3 15 20 30 50 – Internal nodes have between M/2 and M children – Root (special case) has between 2 and M children (or root could be a leaf) 1 2 10 11 12 20 25 26 40 42 AB xG 3 5 6 9 15 17 30 32 33 36 50 60 70 Data objects, that I’ll Note: All leaves at the same depth! ignore in slides 5 ‡These are technically B +-Trees 6 1 Example, Again B-trees vs.
    [Show full text]
  • AVL Trees and Rotations
    / AVL trees and rotations Q1 Operations (insert, delete, search) are O(height) Tree height is O(log n) if perfectly balanced ◦ But maintaining perfect balance is O(n) Height-balanced trees are still O(log n) ◦ For T with height h, N(T) ≤ Fib(h+3) – 1 ◦ So H < 1.44 log (N+2) – 1.328 * AVL (Adelson-Velskii and Landis) trees maintain height-balance using rotations Are rotations O(log n)? We’ll see… / or = or \ Different representations for / = \ : Just two bits in a low-level language Enum in a higher-level language / Assume tree is height-balanced before insertion Insert as usual for a BST Move up from the newly inserted node to the lowest “unbalanced” node (if any) ◦ Use the balance code to detect unbalance - how? Do an appropriate rotation to balance the sub-tree rooted at this unbalanced node For example, a single left rotation: Two basic cases ◦ “See saw” case: Too-tall sub-tree is on the outside So tip the see saw so it’s level ◦ “Suck in your gut” case: Too-tall sub-tree is in the middle Pull its root up a level Q2-3 Unbalanced node Middle sub-tree attaches to lower node of the “see saw” Diagrams are from Data Structures by E.M. Reingold and W.J. Hansen Q4-5 Unbalanced node Pulled up Split between the nodes pushed down Weiss calls this “right-left double rotation” Q6 Write the method: static BalancedBinaryNode singleRotateLeft ( BalancedBinaryNode parent, /* A */ BalancedBinaryNode child /* B */ ) { } Returns a reference to the new root of this subtree.
    [Show full text]
  • Tries and String Matching
    Tries and String Matching Where We've Been ● Fundamental Data Structures ● Red/black trees, B-trees, RMQ, etc. ● Isometries ● Red/black trees ≡ 2-3-4 trees, binomial heaps ≡ binary numbers, etc. ● Amortized Analysis ● Aggregate, banker's, and potential methods. Where We're Going ● String Data Structures ● Data structures for storing and manipulating text. ● Randomized Data Structures ● Using randomness as a building block. ● Integer Data Structures ● Breaking the Ω(n log n) sorting barrier. ● Dynamic Connectivity ● Maintaining connectivity in an changing world. String Data Structures Text Processing ● String processing shows up everywhere: ● Computational biology: Manipulating DNA sequences. ● NLP: Storing and organizing huge text databases. ● Computer security: Building antivirus databases. ● Many problems have polynomial-time solutions. ● Goal: Design theoretically and practically efficient algorithms that outperform brute-force approaches. Outline for Today ● Tries ● A fundamental building block in string processing algorithms. ● Aho-Corasick String Matching ● A fast and elegant algorithm for searching large texts for known substrings. Tries Ordered Dictionaries ● Suppose we want to store a set of elements supporting the following operations: ● Insertion of new elements. ● Deletion of old elements. ● Membership queries. ● Successor queries. ● Predecessor queries. ● Min/max queries. ● Can use a standard red/black tree or splay tree to get (worst-case or expected) O(log n) implementations of each. A Catch ● Suppose we want to store a set of strings. ● Comparing two strings of lengths r and s takes time O(min{r, s}). ● Operations on a balanced BST or splay tree now take time O(M log n), where M is the length of the longest string in the tree.
    [Show full text]
  • Binary Tree Fall 2017 Stony Brook University Instructor: Shebuti Rayana [email protected] Introduction to Tree
    CSE 230 Intermediate Programming in C and C++ Binary Tree Fall 2017 Stony Brook University Instructor: Shebuti Rayana [email protected] Introduction to Tree ■ Tree is a non-linear data structure which is a collection of data (Node) organized in hierarchical structure. ■ In tree data structure, every individual element is called as Node. Node stores – the actual data of that particular element and – link to next element in hierarchical structure. Tree with 11 nodes and 10 edges Shebuti Rayana (CS, Stony Brook University) 2 Tree Terminology ■ Root ■ In a tree data structure, the first node is called as Root Node. Every tree must have root node. In any tree, there must be only one root node. Root node does not have any parent. (same as head in a LinkedList). Here, A is the Root node Shebuti Rayana (CS, Stony Brook University) 3 Tree Terminology ■ Edge ■ The connecting link between any two nodes is called an Edge. In a tree with 'N' number of nodes there will be a maximum of 'N-1' number of edges. Edge is the connecting link between the two nodes Shebuti Rayana (CS, Stony Brook University) 4 Tree Terminology ■ Parent ■ The node which is predecessor of any node is called as Parent Node. The node which has branch from it to any other node is called as parent node. Parent node can also be defined as "The node which has child / children". Here, A is Parent of B and C B is Parent of D, E and F C is the Parent of G and H Shebuti Rayana (CS, Stony Brook University) 5 Tree Terminology ■ Child ■ The node which is descendant of any node is called as CHILD Node.
    [Show full text]
  • Red-Black Trees
    Red-Black Trees 1 Red-Black Trees balancing binary search trees relation with 2-3-4 trees 2 Insertion into a Red-Black Tree algorithm for insertion an elaborate example of an insert inserting a sequence of numbers 3 Recursive Insert Function pseudo code MCS 360 Lecture 36 Introduction to Data Structures Jan Verschelde, 20 April 2020 Introduction to Data Structures (MCS 360) Red-Black Trees L-36 20 April 2020 1 / 36 Red-Black Trees 1 Red-Black Trees balancing binary search trees relation with 2-3-4 trees 2 Insertion into a Red-Black Tree algorithm for insertion an elaborate example of an insert inserting a sequence of numbers 3 Recursive Insert Function pseudo code Introduction to Data Structures (MCS 360) Red-Black Trees L-36 20 April 2020 2 / 36 Binary Search Trees Binary search trees store ordered data. Rules to insert x at node N: if N is empty, then put x in N if x < N, insert x to the left of N if x ≥ N, insert x to the right of N Balanced tree of n elements has depth is log2(n) ) retrieval is O(log2(n)), almost constant. With rotation we make a tree balanced. Alternative to AVL tree: nodes with > 2 children. Every node in a binary tree has at most 2 children. A 2-3-4 tree has nodes with 2, 3, and 4 children. A red-black tree is a binary tree equivalent to a 2-3-4 tree. Introduction to Data Structures (MCS 360) Red-Black Trees L-36 20 April 2020 3 / 36 a red-black tree red nodes have hollow rings 11 @ 2 14 @ 1 7 @ 5 8 Four invariants: 1 A node is either red or black.
    [Show full text]
  • Balanced Binary Search Trees – AVL Trees, 2-3 Trees, B-Trees
    Balanced binary search trees – AVL trees, 2‐3 trees, B‐trees Professor Clark F. Olson (with edits by Carol Zander) AVL trees One potential problem with an ordinary binary search tree is that it can have a height that is O(n), where n is the number of items stored in the tree. This occurs when the items are inserted in (nearly) sorted order. We can fix this problem if we can enforce that the tree remains balanced while still inserting and deleting items in O(log n) time. The first (and simplest) data structure to be discovered for which this could be achieved is the AVL tree, which is names after the two Russians who discovered them, Georgy Adelson‐Velskii and Yevgeniy Landis. It takes longer (on average) to insert and delete in an AVL tree, since the tree must remain balanced, but it is faster (on average) to retrieve. An AVL tree must have the following properties: • It is a binary search tree. • For each node in the tree, the height of the left subtree and the height of the right subtree differ by at most one (the balance property). The height of each node is stored in the node to facilitate determining whether this is the case. The height of an AVL tree is logarithmic in the number of nodes. This allows insert/delete/retrieve to all be performed in O(log n) time. Here is an example of an AVL tree: 18 3 37 2 11 25 40 1 8 13 42 6 10 15 Inserting 0 or 5 or 16 or 43 would result in an unbalanced tree.
    [Show full text]
  • Tree-To-Tree Neural Networks for Program Translation
    Tree-to-tree Neural Networks for Program Translation Xinyun Chen Chang Liu UC Berkeley UC Berkeley [email protected] [email protected] Dawn Song UC Berkeley [email protected] Abstract Program translation is an important tool to migrate legacy code in one language into an ecosystem built in a different language. In this work, we are the first to employ deep neural networks toward tackling this problem. We observe that program translation is a modular procedure, in which a sub-tree of the source tree is translated into the corresponding target sub-tree at each step. To capture this intuition, we design a tree-to-tree neural network to translate a source tree into a target one. Meanwhile, we develop an attention mechanism for the tree-to-tree model, so that when the decoder expands one non-terminal in the target tree, the attention mechanism locates the corresponding sub-tree in the source tree to guide the expansion of the decoder. We evaluate the program translation capability of our tree-to-tree model against several state-of-the-art approaches. Compared against other neural translation models, we observe that our approach is consistently better than the baselines with a margin of up to 15 points. Further, our approach can improve the previous state-of-the-art program translation approaches by a margin of 20 points on the translation of real-world projects. 1 Introduction Programs are the main tool for building computer applications, the IT industry, and the digital world. Various programming languages have been invented to facilitate programmers to develop programs for different applications.
    [Show full text]
  • Algorithm for Character Recognition Based on the Trie Structure
    University of Montana ScholarWorks at University of Montana Graduate Student Theses, Dissertations, & Professional Papers Graduate School 1987 Algorithm for character recognition based on the trie structure Mohammad N. Paryavi The University of Montana Follow this and additional works at: https://scholarworks.umt.edu/etd Let us know how access to this document benefits ou.y Recommended Citation Paryavi, Mohammad N., "Algorithm for character recognition based on the trie structure" (1987). Graduate Student Theses, Dissertations, & Professional Papers. 5091. https://scholarworks.umt.edu/etd/5091 This Thesis is brought to you for free and open access by the Graduate School at ScholarWorks at University of Montana. It has been accepted for inclusion in Graduate Student Theses, Dissertations, & Professional Papers by an authorized administrator of ScholarWorks at University of Montana. For more information, please contact [email protected]. COPYRIGHT ACT OF 1 9 7 6 Th is is an unpublished manuscript in which copyright sub ­ s i s t s , Any further r e p r in t in g of its contents must be approved BY THE AUTHOR, Ma n sfield L ibrary U n iv e r s it y of Montana Date : 1 987__ AN ALGORITHM FOR CHARACTER RECOGNITION BASED ON THE TRIE STRUCTURE By Mohammad N. Paryavi B. A., University of Washington, 1983 Presented in partial fulfillment of the requirements for the degree of Master of Science University of Montana 1987 Approved by lairman, Board of Examiners iean, Graduate School UMI Number: EP40555 All rights reserved INFORMATION TO ALL USERS The quality of this reproduction is dependent upon the quality of the copy submitted.
    [Show full text]