Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Performance of data structures for small sets of strings
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
A general-purpose compression scheme for large collections
ACM Transactions on Information Systems (TOIS)
Efficient single-pass index construction for text databases
Journal of the American Society for Information Science and Technology
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Fast phrase querying with combined indexes
ACM Transactions on Information Systems (TOIS)
Index-Based Persistent Document Identifiers
Information Retrieval
Efficient online index maintenance for contiguous inverted lists
Information Processing and Management: an International Journal
Hybrid index maintenance for growing text collections
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
HAT-trie: a cache-conscious trie-based data structure for strings
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Perfect hash functions for large dictionaries
Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience
Hybrid index maintenance for contiguous inverted lists
Information Retrieval
An Evolutionary Perspective on Approximate RDF Query Answering
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Massive Semantic Web data compression with MapReduce
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Fast and compact hash tables for integer keys
ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
Minimal perfect hashing: A competitive method for indexing internal memory
Information Sciences: an International Journal
Fast construction of the HYB index
ACM Transactions on Information Systems (TOIS)
Exploiting traffic localities for efficient flow state lookup
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Cache-Conscious collision resolution in string hash tables
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
A hybrid approach to index maintenance in dynamic text retrieval systems
ECIR'06 Proceedings of the 28th European conference on Advances in Information Retrieval
A morphological analyzer using hash tables in main memory (MAHT) and a lexical knowledge base
CICLing'12 Proceedings of the 13th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
Scalable RDF data compression with MapReduce
Concurrency and Computation: Practice & Experience
| Hi-index | 0.90 |