Radix tree - PDFSEARCH.IO - Document Search Engine

Radix tree
Results: 48

#	Item
1	Indexing Mixed Types for Approximate Retrieval Liang Jin Nick Koudas University of California, Irvine, USA Add to Reading List Source URL: flamingo.ics.uci.edu Language: English - Date: 2013-04-16 21:54:23 Finite automata Trie Software engineering Computer programming Computing Tree Distributed data storage String matching algorithms Radix tree
2	QP tries are smaller and faster than crit-bit trees Tony Finch University of Cambridge Add to Reading List Source URL: tinytocs.ece.utexas.edu Language: English - Date: 2016-03-05 17:06:25 Hashing Computer programming Information science Information retrieval Finite automata Trie Associative arrays Radix tree Hash tree Search algorithms Hash array mapped trie Hamming weight
3	Implementing Sorting in Database Systems GOETZ GRAEFE Microsoft Most commercial database systems do (or should) exploit many sorting techniques that are publicly known, but not readily available in the research literatur Add to Reading List Source URL: wwwlgis.informatik.uni-kl.de Language: English - Date: 2006-11-07 04:12:03 Sorting algorithms Trie Radix sort Quicksort Sorting String Lossless compression Huffman coding External sorting Extensible Storage Engine Binary tree B-tree
4	Implementing a Generic Radix Trie in Rust Michael Sproul University of California, Santa Cruz University of Sydney Introduction Add to Reading List Source URL: michaelsproul.github.io Language: English - Date: 2015-03-30 20:03:55 Data types Procedural programming languages Functional programming Concurrent programming languages Functional languages Trie Rust Radix tree Associative array Pointer Go Immutable object
5	Under consideration for publication in J. Functional Programming 1 A Functional Toolkit for Morphological and Phonological Processing, Add to Reading List Source URL: gallium.inria.fr Language: English - Date: 2004-04-19 09:40:02 Search algorithms Trie HAT-trie Hash table Hash function Set Search tree Radix tree Radix sort
6	QoS aware Dynamic Power Scaling Algorithms for Deploying Energy Efficient Routers Add to Reading List Source URL: conferences2.sigcomm.org Language: English - Date: 2015-10-04 17:06:37 Units of information Computer memory Forwarding plane Trie Computer networking Dynamic random-access memory Content-addressable memory Mebibyte Gibibyte Radix tree
7	Scalable Name-Based Packet Forwarding: From Millions to Billions Tian Song Haowei Yuan Add to Reading List Source URL: conferences2.sigcomm.org Language: English - Date: 2015-10-01 13:10:42 Routing Computer networking Forwarding plane Trie Radix tree Forwarding information base Named data networking Packet forwarding Forwarding Hash table Router Routing table
8	Space-Efficient Data Structures for Top-k Completion Bo-June (Paul) Hsu Giuseppe Ottaviano Microsoft Research Add to Reading List Source URL: www2013.wwwconference.org Language: English - Date: 2014-07-21 08:47:06 Computer programming Software engineering Computing Search algorithms Finite automata Trie Radix tree Binary trees Arrays Routing algorithms Suffix tree Tree
9	LU-CS-TR:LUNFD6/(NFCS–)], Lund University, Sweden NOTES ON SUFFIX SORTING N. JESPER LARSSON Abstract. We study the problem of lexicographically sorting the suffixes of a string of symbols. In pa Add to Reading List Source URL: www.larsson.dogma.net Language: English - Date: 2003-04-20 17:07:09 Sorting algorithms Order theory Computing Mathematics Suffix array Quicksort Suffix tree Radix sort Bucket sort Best worst and average case Sort LCP array
10	Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints Jiannan Wang Jianhua Feng Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2012-01-09 09:42:38 Trie Binary trees Tree Pruning Rope Sorting algorithms Radix tree Ternary search tree Graph theory Mathematics Computing

UPDATE