Skip to main content
Article thumbnail
Location of Repository

SAS Global Forum 2011 Programming: Beyond the Basics ABSTRACT

By 

Abstract

Did you know that an element of a hash table can be another hash table? How cool is that? Kind of like a multidimensional array on steroids. You don’t need to know in advance how many elements you will have nor how deep they will nest. Furthermore, you can do this without a single macro variable! The “hash of hashes ” technique provides one solution to a classic challenge in healthcare: how to process claims data to determine which provider within a given specialty is most likely overseeing a patient’s care. The algorithm requires examining an unpredictable amount of information and making decisions at defined breakpoints. This paper will demonstrate the code for a “hash of hashes ” solution and compare it to two other approaches: the double DOW and SQL. Along the way we’ll make use of some features of hash tables that are new in 9.2. If you love hash tables, you’ll flip for the hash of hashes

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.3336
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://support.sas.com/resourc... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.