Prefix Tree

Prefix Tree
Trie, der die Zeichenketten Java, Rad, Rand, Rau, Raum und Rose speichert

Ein Trie oder Präfixbaum ist eine Datenstruktur, die in der Informatik zum Suchen nach Zeichenketten verwendet wird. Es handelt sich dabei um einen speziellen Suchbaum zur gleichzeitigen Speicherung mehrerer Zeichenketten.

Das Wort Trie wurde von Edward Fredkin empfohlen und leitete sich aus dem englischen Wort Information Retrieval ab.

In einem Trie repräsentiert jede Kante des Baums einen zusätzlichen Buchstaben. Jeder Knoten entspricht der Zeichenkette, die aus der Verkettung aller Kantenbuchstaben entsteht. Der Wurzelknoten eines Trie entspricht einer leeren Zeichenkette.

Um Daten in komprimierter Form in einem Trie abzulegen, werden Patricia-Tries benutzt.

Siehe auch

Literatur

  • R. de la Briandais: File Searching Using Variable Length Keys. Proceedings of the Western Joint Computer Conference, 1959, S. 295–298
  • E. Fredkin: Trie Memory. Communications of the ACM, 3(9):490-499, Sept. 1960
  • Donald E. Knuth: The Art of Computer Programming. Vol. 3, 2nd ed. Boston 1998. S. 492–512.

Weblinks


Wikimedia Foundation.

Игры ⚽ Поможем написать реферат

Schlagen Sie auch in anderen Wörterbüchern nach:

  • Prefix hash tree — A prefix hash tree (PHT) is a distributed data structure that enables more sophisticated queries over a distributed hash table (DHT). The prefix hash tree uses the lookup interface of a DHT to construct a trie based data structure that is both… …   Wikipedia

  • Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional …   Wikipedia

  • Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… …   Wikipedia

  • Radix tree — In computer science, a radix tree (also patricia trie or radix trie) is a space optimized trie data structure where each node with only one child is merged with its child. The result is that every internal node has at least two children. Unlike… …   Wikipedia

  • Suffix tree — In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many… …   Wikipedia

  • B+ tree — In computer science, a B+ tree is a type of tree which represents sorted data in a way that allows for efficient insertion, retrieval and removal of records, each of which is identified by a key . It is a dynamic, multilevel index, with maximum… …   Wikipedia

  • Ternary search tree — In computer science, a ternary search tree (trie,TST) is a ternary (three way) tree data structure which combines the time efficiency of digital tries with the space efficiency of binary search trees. The resulting structure is faster than… …   Wikipedia

  • Family Tree (Nick Drake album) — Infobox Album | Name = Family Tree Type = Compilation album Artist = Nick Drake Released = July 9, 2007 (UK) July 10, 2007 (US) Recorded = Various Genre = Folk Length = 66:10 Label = Island (UK CD), Tsunami LG/Fontana (US CD), Sunbeam (UK 2LP)… …   Wikipedia

  • Family Tree — У этого термина существуют и другие значения, см. Family Tree (значения). Family Tree …   Википедия

  • Ordeal tree — Ordeal Or de*al ([^o]r d[ e]*al), n. [AS. ord[=a]l, ord[=ae]l, a judgment; akin to D. oordeel, G. urteil, urtheil; orig., what is dealt out, the prefix or being akin to [=a] compounded with verbs, G. er , ur , Goth. us , orig. meaning, out. See… …   The Collaborative International Dictionary of English

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”