Abstract

A complete relational calculus is introduced for similarity-based fuzzy relational databases. The ordinary domain calculus is chosen as the basis from which to develop the fuzzy counterpart because it tends to be closer to natural language than tuple calculus. A constructive proof is used to show that the fuzzy relational algebra can be mapped into the calculus. The proof is significant from the standpoint of demonstrating implementability of the calculus as a query language.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call