On algorithms preserving neighborhood, to file and retrieve information in a memory

  • J. C. Simon
  • G. Guiho


Algorithms to file and retrieve information in a memory are used currently for many applications: compilers, systems, business, artificial intelligence, etc.... For example, binary search and Hash coding allow a compromise between memory size and number of access operations to be obtained. But, in many cases, distance or neighborhood has to be preserved. We propose two new methods having this quality. The algorithms of our methods are determined by properties of the set of information to be filed. The first is based on variation properties. Approximation methods are utilized. The second exploit the probability properties of the set. The resulting performances are comparable to Hash coding's and neighborhood is preserved.


Operating System Artificial Intelligence Approximation Method Variation Property Binary Search 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. R. Bell, “The quadratic quotient method: A Hash code eliminating secondary dustering,”Commun. ACM 13:107–109 (1970).Google Scholar
  2. 2.
    J. C. Horvat, Thesis, Institut de Programmation, Paris (1970).Google Scholar
  3. 3.
    R. Houdas, Thesis, Institut de Programmation, Paris (1970).Google Scholar
  4. 4.
    M. D. McIlroy, “A variant method of file searching,”Commun ACM 6:101 (1963).Google Scholar
  5. 5.
    B. Jones, “A variation on sorting by address calculation,”Commun. ACM 13:105–107 (1970).Google Scholar
  6. 6.
    S. Manasfi, Doctoral dissertation, Faculté des Sciences, Paris (1970).Google Scholar
  7. 7.
    W. C. Maurer, “An improved Hash code for scatter storage,”Commun. ACM 11:35–38 (1968).Google Scholar
  8. 8.
    M. Minsky and S. Papert,Perceptrons (MIT Press, Cambridge, 1969).Google Scholar
  9. 9.
    R. Morris, “Scatter storage techniques,”Commun. ACM 11:38–44 (1968).Google Scholar
  10. 10.
    C. E. Radke, “The use of quadratic residue research,”Commun. ACM 13:103–105 (1970).Google Scholar
  11. 11.
    G. Schay and W. G. Spruth, “Analyses of a file addressing method,”Commun. ACM 5:459–462 (1962).Google Scholar
  12. 12.
    M. E. Senko, Formatted File Organization Techniques, Final Report, IBM (May 16, 1967).Google Scholar
  13. 13.
    J. C. Simon and J. P. Aubineau,Function and Signal Representation on Connection with Precision (Institut de Programmation, Paris, 1970), to be published.Google Scholar
  14. 14.
    J. C. Simon and G. D. Guiho, “Une nouvelle methode détablissement et d'utilisation de mémoires ordonnées,”Compt. Rend. Acad. Sci. Ser. A 271:1022–1025 (1970).Google Scholar

Copyright information

© Plenum Publishing Corporation 1972

Authors and Affiliations

  • J. C. Simon
    • 1
  • G. Guiho
    • 1
  1. 1.Institut de ProgrammationUniversité de ParisParisFrance

Personalised recommendations