Content-addressable mass memories

Access Full Text

Content-addressable mass memories

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings E (Computers and Digital Techniques) — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In the area of non-numerical data processing, the usual local addressing with its fixed access path is troublesome and time-consuming if very large data sets have to be handled. Next to the well-known software procedures more and more hardware solutions are sought for supporting the typically content-addressable data access. The apparently ideal solution of a parallel associative memory cannot be implemented in the capacities of mass memories, but it can be substituted for mass memories with content addressability.

Inspec keywords: content-addressable storage

Other keywords: nonnumerical data processing; local addressing; content-addressable mass memories; content-addressable data access

Subjects: Other digital storage; Memory circuits

References

    1. 1)
      • H. Schweppe , H.Ch. Zeidler , W. Hell , H.-O. Leilich , G. Stiege , W. Teich . , RDBM — a dedicated multiprocessor system for database management.
    2. 2)
      • Leilich, H.-O., Stiege, G., Zeidler, H.Ch.: `A search processor for database management systems', Proc. VLDB, 1978, p. 280–287.
    3. 3)
      • Wolf, G.: `Associative mass storage for database', Proc. 5. Workshop Comp. Arch. for Non-numeric Proc., 1980, Pacific Grove, p. 70–81.
    4. 4)
      • Gonzalez-Rubio, R., Rohmer, J., Terral, D.: `The SCHUSS-filter: A processor for non-numerical data processing', Proc. 11th Ann. Int. Symp. Comp. Arch., 1984, p. 64–73.
    5. 5)
      • Tanaka, Y.: `MPDC: massive parallel architecture for very large databases', Proc. Int. Conf. on 5th Generation Comp. Syst., 1984, p. 113–137.
    6. 6)
      • S. Lamb . An add-in recognition memory for S-100 bus microcomputers. Comput. Des. , 140 - 142
    7. 7)
      • M. Missikoff , M. Terranova , D. Hsiao . (1983) The architecture of a relational database computer known as DBMAC, Advanced database machine architecture.
    8. 8)
      • R.W. Mitchell . New hardware for information systems. Proc. IERE Comput. , 11 - 18
    9. 9)
      • H.-O. Leilich . (1974) , Assoziative Speicher.
    10. 10)
      • F. Bancilhon , D. Fortin , S. Gamerman , M. Laubin , P. Richard , M. Scholl , D. Tusera , A. Verroust . , VERSO: A relational backend database machine.
    11. 11)
      • J. Kreyssig , H. Schukat , H.Ch. Zeidler , M. Kitsuregawa , H. Tanaka . (1988) A filter processor as part of an intelligent disk controller, Database machines and knowledge base machines.
    12. 12)
      • Ozkarahan, E.A., Schuster, S.A., Smith, K.C.: `RAP — An associative processor for data base management', Proc. NCC, 1975, p. 379–387.
    13. 13)
      • D.L. Slotnick , J. Tou . (1970) Logic per track devices, Advances in computers.
    14. 14)
      • H.Ch. Zeidler . (1987) , Funktionsorientierte Hardware zur Lösung des Suchproblems — Entwicklung und Möglichkeiten.
    15. 15)
      • D.J. Dewitt . DIRECT — a multiprocessor organization for supporting relational database management systems. IEEE Trans. Commun. , 6 , 395 - 406
    16. 16)
      • M.J. Flynn . Some computer organizations and their effectiveness. IEEE Trans. Commun. , 9 , 948 - 960
    17. 17)
      • Kamibayashi, N., Seo, K.: `SPIRIT III: An advanced relational database machine introducing a novel data-staging architecture with tuple stream filters to preprocess relational algebra', Proc. NCC, 1982, p. 605–616.
    18. 18)
      • Su, S.Y., Lupkiewicz, S., Lee, C.-J., Lo, D.M., Doty, K.L.: `MICRONET: A microcomputer network system for managing distributed relational databases', Proc. VLDB, 1978, p. 288–298.
    19. 19)
      • Hollander, G.L.: `Quasi-random access memory systems', Proc. AFIPS Conf. (FJCC), 1956, p. 128–135.
    20. 20)
      • Parker, J.L.: `A logic per track retrieval system', Proc. IFIP, 1971, p. 146–150, (TA-4).
    21. 21)
      • Kitsuregawa, M., Nakano, M., Harada, L., Tagaki, M.: `Functional disk system for relational database', Proc. 3rd Int. Conf. Data Engineering, 1987.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-e.1989.0047
Loading

Related content

content/journals/10.1049/ip-e.1989.0047
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading