Trie - PDFSEARCH.IO - Document Search Engine

Trie
Results: 613

#	Item
131	I/O-efficient Point Location using Persistent B-Trees Lars Arge∗ Andrew Danner† Sha-Mayn Teh Add to Reading List Source URL: www.cs.swarthmore.edu Language: English - Date: 2003-01-06 11:49:03 B-tree Data structures Computing R-tree Rope Persistent data structure Trie Segment tree B+ tree Binary trees Graph theory Data management
132	The Bw-Tree: A B-Tree On Steroids Justin Levandoski David Lomet Sudipta Sengupta The Bw-Tree: What is it? Add to Reading List Source URL: hpts.ws Language: English - Date: 2013-10-01 05:37:38 Information Non-volatile memory Flash memory B-tree Pointer Address space Database index Trie Cache Computing Computer memory Data
133	FAST: A Generic Framework for Flash-Aware Spatial Trees Mohamed Sarwat1, , Mohamed F. Mokbel1, , Xun Zhou1 , and Suman Nath2 1 Department of Computer Science and Engineering, University of Minnesota Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2012-03-05 10:36:56 Data R-tree B-tree Trie R* tree T-tree Tree Database Rope Data management Computing Binary trees
134	Sprint: Speculative Prefetching of Remote Data Arun Raman Greta Yorsh Martin Vechev Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2011-08-29 23:46:23 Windows XP CPU cache Cache Central processing unit Parallel computing Database Prefetcher Trie Computer program Computing Computer memory Computer hardware
135	High Performance Dynamic Lock-Free Hash Tables and List-Based Sets Maged M. Michael IBM Thomas J. Watson Research Center P.O. Box 218 Yorktown Heights NYUSA Add to Reading List Source URL: www.research.ibm.com Language: English - Date: 2004-08-02 14:09:15 Computer programming Linked list Hash table Trie Mutual exclusion Non-blocking algorithm Compare-and-swap Software transactional memory Tree traversal Concurrency control Computing Data management
136	A Probabilisti Dynami Te hnique for the Distributed Generation of Very Large State Spa es W.J. Knottenbelt a;1 Add to Reading List Source URL: pubs.doc.ic.ac.uk Language: English - Date: 2011-11-14 07:13:41 Information science Artificial intelligence Error detection and correction Hash function Hash table Trie Search algorithms Hashing Information retrieval
137	The Log-Structured Merge-Tree Add to Reading List Source URL: www.cs.umb.edu Language: English - Date: 2003-10-20 12:42:00 B-tree Binary trees Database index Trie Rope Extensible Storage Engine Hard disk drive LSM B+ tree Computing Data management Computer hardware
138	Concurrent Cache-Oblivious B-Trees Michael A. Bender Jeremy T. Fineman Department of Computer Science Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2007-09-28 06:21:01 Data management B-tree Linked lists T-tree Skip list Trie Insertion sort Priority queue Cache-oblivious algorithm Computing Binary trees Computer programming
139	OpenDHT: A Public DHT Service and Its Uses Sean Rhea, Brighten Godfrey, Brad Karp, John Kubiatowicz, Sylvia Ratnasamy, Scott Shenker, Ion Stoica, and Harlan Yu UC Berkeley and Intel Research Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2005-06-20 16:13:06 Distributed hash table Chord Peer-to-peer Hash table Prefix hash tree Lookup table PlanetLab Trie Kademlia Distributed data storage Computing Computer programming
140	Instructions for ACL 2007 Proceedings Add to Reading List Source URL: nlp.cs.nyu.edu Language: English - Date: 2008-09-16 14:40:55 Computational linguistics Corpus linguistics Information retrieval Natural language processing N-gram Speech recognition Trie Search engine indexing Lucene Information science Science Linguistics

UPDATE