DE2538401A1 - - Google Patents

Info

Publication number
DE2538401A1
DE2538401A1 DE19752538401 DE2538401A DE2538401A1 DE 2538401 A1 DE2538401 A1 DE 2538401A1 DE 19752538401 DE19752538401 DE 19752538401 DE 2538401 A DE2538401 A DE 2538401A DE 2538401 A1 DE2538401 A1 DE 2538401A1
Authority
DE
Germany
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
DE19752538401
Other languages
German (de)
Other versions
DE2538401B1 (de
DE2538401C2 (de
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed filed Critical
Priority to DE19752538401 priority Critical patent/DE2538401C2/de
Priority claimed from DE19752538401 external-priority patent/DE2538401C2/de
Publication of DE2538401B1 publication Critical patent/DE2538401B1/de
Publication of DE2538401A1 publication Critical patent/DE2538401A1/de
Application granted granted Critical
Publication of DE2538401C2 publication Critical patent/DE2538401C2/de
Expired legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C11/00—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/903—Querying
    • G06F16/90335—Query processing
    • G06F16/90339—Query processing by using parallel associative memories or content-addressable memories

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
DE19752538401 1975-08-28 Verfahren und Anordnung zum Auffinden eines kurzen, einem Suchbegriff gleichen Begriffs aus einer längeren Zeichenkette Expired DE2538401C2 (de)

Priority Applications (1)

Application Number Priority Date Filing Date Title
DE19752538401 DE2538401C2 (de) 1975-08-28 Verfahren und Anordnung zum Auffinden eines kurzen, einem Suchbegriff gleichen Begriffs aus einer längeren Zeichenkette

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
DE19752538401 DE2538401C2 (de) 1975-08-28 Verfahren und Anordnung zum Auffinden eines kurzen, einem Suchbegriff gleichen Begriffs aus einer längeren Zeichenkette

Publications (3)

Publication Number Publication Date
DE2538401B1 DE2538401B1 (de) 1976-12-09
DE2538401A1 true DE2538401A1 (pl) 1976-12-09
DE2538401C2 DE2538401C2 (de) 1977-07-28

Family

ID=

Also Published As

Publication number Publication date
DE2538401B1 (de) 1976-12-09

Similar Documents

Publication Publication Date Title
FR2316636B1 (pl)
FR2325005B1 (pl)
JPS525254U (pl)
FR2322434B1 (pl)
JPS51162956U (pl)
JPS5444948Y2 (pl)
JPS569753Y1 (pl)
JPS51134049U (pl)
JPS5248015U (pl)
DE2538401A1 (pl)
CH606968A5 (pl)
CH606207A5 (pl)
CH586353A5 (pl)
CH585088A5 (pl)
CH584804B5 (pl)
CH429375A4 (pl)
BG22617A1 (pl)
CH606700A5 (pl)
DD123321A5 (pl)
CH607901A5 (pl)
CH607544A5 (pl)
CH607308A5 (pl)
CH607067A5 (pl)
CH606982A5 (pl)
CH602630A5 (pl)

Legal Events

Date Code Title Description
E77 Valid patent as to the heymanns-index 1977
8339 Ceased/non-payment of the annual fee