Storing a Sparse Table with 0(1) Worst Case Access Time.
Michael L. FredmanJános KomlósEndre SzemerédiPublished in: J. ACM (1984)
Keyphrases
- worst case
- upper bound
- lower bound
- high dimensional
- average case
- access control
- database
- information access
- greedy algorithm
- data structure
- databases
- theoretical guarantees
- random access
- case study
- np hard
- database systems
- random projections
- storage and retrieval
- feature selection
- sparse data
- social networks
- information retrieval
- running times