Direct Addressing Techniques of Table Look-up Part 1 . Key-indexing-bitmapping Part 2 . Hashing

@inproceedings{Dorfman2001DirectAT,
  title={Direct Addressing Techniques of Table Look-up Part 1 . Key-indexing-bitmapping Part 2 . Hashing},
  author={Paul M. Dorfman},
  year={2001}
}
Table look-up is the most time-consuming part of many SAS programs. Base SAS offers a rich collection of built-in searching techniques. Merging, SQL joins, formats, SAS indexes all serve the purpose of locating relevant data. For custom programming, SAS offers arrays, whose direct addressability lends itself to implementing just about any searching algorithm. Array-based lookup is not a ready-to-go food; it has to be cooked at home. However, it may result in dishes digested by the computer more… CONTINUE READING

From This Paper

Topics from this paper.
0 Citations
3 References
Similar Papers

Similar Papers

Loading similar papers…