Programming the logic theory machine
IRE-AIEE-ACM '57 (Western) Papers presented at the February 26-28, 1957, western joint computer conference: Techniques for reliability
Communications of the ACM
Search structures and algorithms for personalized ranking
Information Sciences: an International Journal
Generic XML-based framework for metadata portals
Computers & Geosciences
Information filtering and query indexing for an information retrieval model
ACM Transactions on Information Systems (TOIS)
Experience with a generalized information processing system
AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference
Extracting unique rows of a bounded degree array using tries
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Phylogenetic graph models beyond trees
Discrete Applied Mathematics
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
A scrabble crossword game playing program
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2
HMS: a predictive text entry method using bigrams
TextEntry '03 Proceedings of the 2003 EACL Workshop on Language Modeling for Text Entry Methods
File organization and addressing
IBM Systems Journal
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
The parameterized complexity of local consistency
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Cosine interesting pattern discovery
Information Sciences: an International Journal
Detecting unknown network attacks using language models
DIMVA'06 Proceedings of the Third international conference on Detection of Intrusions and Malware & Vulnerability Assessment
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Analysis of a class of tries with adaptive multi-digit branching
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Concurrent tries with efficient non-blocking snapshots
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Relaxation labelling - the principle of 'least disturbance'
Pattern Recognition Letters
Efficient subsequence search in databases
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 0.02 |
Many computer applications require the storage of large amounts of information within the computer's memory where it will be readily available for reference and updating. Quite commonly, more storage space is required than is available in the computer's high-speed working memory. It is, therefore, a common practice to equip computers with magnetic tapes, disks, or drums, or a combination of these to provide additional storage. This additional storage is always slower in operation than the computer's working memory and therefore care must be taken when using it to avoid excessive operating time.