Fault-tolerant database using distributed associative memories

DOI10.1016/0020-0255(91)90061-XzbMATH Open0714.68020OpenAlexW1994488920MaRDI QIDQ751252FDOQ751252

Authors: Vladimir Cherkassky, Malathi Rao, Harry Wechsler 

Publication date: 1991

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(91)90061-x

Recommendations

• scientific article; zbMATH DE number 140112
• Data structures resilient to memory faults: an experimental study of dictionaries
• Fault-tolerance and complexity (extended abstract)
• On Data Recovery in Distributed Databases
• scientific article; zbMATH DE number 2040846

zbMATH Keywords

distributed-associative-memoryfault-tolerant relational databasefault-tolerant retrieval

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Database theory (68P15)

Cites Work

• Self-organization and associative memory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Content-addressable memories
• The use of context in pattern recognition
• An Integrated Algorithm for Text Recognition: Comparison with a Cascaded Algorithm
• A simple algorithm for computing the generalized inverse of a matrix
• Can A Priori Probabilities Help in Character Recognition?

Cited In (3)

• Title not available (Why is that?)
• Fault-tolerance in distributed in-memory database systems
• Title not available (Why is that?)

This page was built for publication: Fault-tolerant database using distributed associative memories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751252)