Computational Indexes for Time Series
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Information Processing Letters
Access methods: a brief overview for the 1971 ACM SIGFIDET Workshop
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Expandable open addressing hash table storage and retrieval
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Fast and compact hash tables for integer keys
ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
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
Proceedings of the 2011 SIGGRAPH Asia Conference
Distributed contextual information storage using content-centric hash tables
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Dynamic interpolation search revisited
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Information Sciences: an International Journal
Dictionary data structures for smartphone devices
Proceedings of the 5th International Conference on PErvasive Technologies Related to Assistive Environments
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 0.00 |
Estimates are made of the amount of searching required for the exact location of a record in several types of storage systems, including the index-table method of addressing and the sorted-file method. Detailed data and formulas for access time are given for an "open" system which offers high flexibility and speed of access. Experimental results are given for actual record files.