Trie - PDFSEARCH.IO - Document Search Engine

Trie
Results: 613

#	Item
291	4 Static Inverted Indices In this chapter we describe a set of index structures that are suitable for supporting search queries of the type outlined in Chapter 2. We restrict ourselves to the case of static text collect Add to Reading List Source URL: www.ir.uwaterloo.ca Language: English - Date: 2010-01-22 03:41:41 Information Data types Abstract data types Data management Associative arrays Inverted index Search engine indexing Hash table Trie Computing Information science Search algorithms
292	Index Compression is Good, Especially for Random Access Stefan Buttcher ¨ and Charles L. A. Clarke David R. Cheriton School of Computer Science Add to Reading List Source URL: stefan.buettcher.org Language: English - Date: 2007-08-04 13:52:39 Computing Central processing unit Virtual memory Cache CPU cache Translation lookaside buffer B-tree Trie B+ tree Computer memory Computer hardware Information science
293	The Link is the Data On Realisations, Representations, and the Link Betwixt Werner Kriechbaum Gerhard Stenzel IBM Deutschland Entwicklung GmbH Schonaicher ¨ Add to Reading List Source URL: www.cosignconference.org Language: English - Date: 2008-12-13 12:14:51 Markup languages Technical communication ISO standards Knowledge representation Standard Generalized Markup Language XML Trie Cross-reference Tree Information science Computing Information
294	CITI Technical Report 00-1 Linux Kernel Hash Table Behavior: Analysis and Improvements Chuck Lever, Sun-Netscape Alliance Add to Reading List Source URL: www.citi.umich.edu Language: English - Date: 2000-05-03 13:54:06 Information science Information retrieval Artificial intelligence Hash table Cryptographic hash functions Hash function Trie CPU cache Hash list Search algorithms Hashing Error detection and correction
295	Eﬃcient Subgraph Matching using GPUs Xiaojie Lin1 , Rui Zhang1 , Zeyi Wen1 , Hongzhi Wang2 , and Jianzhong Qi1 1 University of Melbourne, Victoria, Australia [removed] Add to Reading List Source URL: people.eng.unimelb.edu.au Language: English - Date: 2014-08-08 21:55:50 Graphics hardware Parallel computing Video cards Graph operations Trie Speedup Matching CUDA Tree decomposition Graph theory Theoretical computer science Mathematics
296	A FAST ALGORITHM FOR MULTI-PATTERN SEARCHING Sun Wu Department of Computer Science Chung-Cheng University Chia-Yi, Taiwan [removed] Add to Reading List Source URL: webglimpse.net Language: English - Date: 2002-10-23 23:03:02 Computing String searching algorithm Boyer–Moore string search algorithm Aho–Corasick string matching algorithm Hash function Boyer–Moore–Horspool algorithm Hash table Trie Regular expression String matching algorithms Information retrieval Information science
297	Ideal Hash Trees Phil Bagwell Hash Trees with nearly ideal characteristics are described. These Hash Trees require no initial root hash table yet are faster and use significantly less space than chained or double hash tr Add to Reading List Source URL: lampwww.epfl.ch Language: English - Date: 2001-10-05 03:05:47 Information science Artificial intelligence Hash table Trie Hash function Hash array mapped trie Cryptographic hash function Perfect hash function Universal hashing Hashing Search algorithms Information retrieval
298	Sprint: Speculative Prefetching of Remote Data Arun Raman Greta Yorsh Martin Vechev Add to Reading List Source URL: www.srl.inf.ethz.ch Language: English - Date: 2011-10-04 10:26:44 Windows XP CPU cache Cache Central processing unit Parallel computing Database Prefetcher Trie Computer program Computing Computer memory Computer hardware
299	Longest Prefix Matching Using Bloom Filters Sarang Dharmapurikar Praveen Krishnamurthy David E. Taylor [removed] [removed] [removed] Washington University in Saint Louis 1 Brookings Drive Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2003-07-24 11:26:24 Arrays Hashing Data Associative arrays Bloom filter Hash table Trie Lookup table Hash function Search algorithms Computing Computer programming
300	Lecture III Page 1 “Trees are the earth’s endless effort to speak to the listening heaven.” – Rabindranath Tagore, Fireflies, 1928 Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-04-13 15:13:18 Data management Binary search tree B-tree Linked list Tree Trie Splay tree Self-balancing binary search tree T-tree Binary trees Graph theory Computing

UPDATE