Abstract
Whenever we pick one representation of data over another, we need to have reasons why we consider that representation to be superior (or at least not inferior) to the other representation for the given purpose. The most common considerations used in such decisions involve the amount of storage space (working set size in a virtual memory) occupied by the data structures, and the execution time (cpu time) necessary for performing all the access and updates to the data structures. Also involved are the programming costs (original design and debugging) of implementing the representation. In this system we are totally ignoring these latter costs, because all the representations which are candidates for selection are fixed in advance, and we have already programmed and debugged the library of their implementation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
