Affiliation:
1. Georgia Institute of Technology, Atlanta, GA
2. Yale Univ., New Haven, CT
Abstract
Programmers and data structure designers are often forced to choose between alternative structures. In storing these structures, preserving logical adjacencies or “proximity” is usually an important consideration. The combinatorial problem of storing arrays as various kinds of list structures is examined. Embeddings of graphs are used to model the loss of proximity involved in such storage schemes, and an elementary proof that arrays cannot be stored as linear lists with bounded loss of proximity is presented. Average loss of proximity is then considered, and it is shown that arrays cannot be stored as linear lists with only bounded loss of average proximity, but can be so stored in binary trees. The former result implies, for instance, that row major order is an asymptotically optimal storage strategy for arrays.
Publisher
Association for Computing Machinery (ACM)
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Object-based and image-based object representations;ACM Computing Surveys;2004-06
2. LINEAR LAYOUT OF GENERALIZED HYPERCUBES;International Journal of Foundations of Computer Science;2003-02
3. Object Representations;Foundations of Image Understanding;2001
4. Mapping between 2-d meshes of the same size;Journal of Computer Science and Technology;1997-09
5. On embedding between 2D meshes of the same size;IEEE Transactions on Computers;1997