IBFI / Urbana / New York / Ballarat / Trie / Demaine / Introduction Trie / Melbourne / Washington / London / /
Company
Prentice-Hall / Heinz / GenBank / Ge / Australian Computer Society Inc. / ACM Press / CRC Press / Pergamon Press Inc. / IEEE Computer Society Press / Database Systems / World Scientific Press / /
Country
Germany / Netherlands / United States / Australia / / /
Facility
SPIRE String Processing / RMIT University / /
IndustryTerm
oblivious algorithms / graph algorithm applications / optimized binary search tree / software prefetching / cache-efficient trie search / cacheefficient algorithms / linux systems / data mining / cache-sensitive search tree / search mechanisms / oblivious search trees / compact binary search tree / ternary search tree / search speed / dictionary management / in-memory string management / cache-oriented processors / oblivious static search trees using program instrumentation / dynamic in-memory string management / search branches / web crawl / space-economical suffix tree construction algorithm / scalar processors / software caching / unsorted string management / search failure / management software / b-trie algorithm / binary search tree / web data / search time / text processing / software prefetchers / /
OperatingSystem
Linux / /
Organization
RMIT University / Melbourne / Society for Industrial and Applied Mathematics / Strings Nikolas Askitis Ranjan Sinha School of Computer Science and Information Technology / Australian Computer Society / /
Person
Gillian Dobbie / Morgan Kaufmann / /
Product
HAT / /
ProvinceOrState
Illinois / New York / Manitoba / /
PublishedMedium
Communications of the ACM / Theory of Computing / Lecture Notes in Computer Science / /
Technology
RAM / Linux / Information Technology / B-trie splitting algorithm / cache-oriented processors / developing cacheefficient algorithms / Cache-oblivious algorithms / random access / operating system / B-trie algorithm / ASCII / space-economical suffix tree construction algorithm / http / data mining / caching / Adaptive algorithms / /
HAT-trie: A Cache-conscious Trie-based Data Structure for Strings Nikolas Askitis Ranjan Sinha School of Computer Science and Information Technology,