• Login
    View Item 
    •   Repository Home
    • Brock Theses
    • Masters Theses
    • M.Sc. Computer Science
    • View Item
    •   Repository Home
    • Brock Theses
    • Masters Theses
    • M.Sc. Computer Science
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    An Abstract Algebraic Theory of L-Fuzzy Relations for Relational Databases

    Thumbnail
    View/Open
    Wazed Chowdhury (5264486) Thesis.pdf (603.1Kb)
    Author
    Chowdhury, Abdul Wazed
    Metadata
    Show full item record
    Abstract
    Classical relational databases lack proper ways to manage certain real-world situations including imprecise or uncertain data. Fuzzy databases overcome this limitation by allowing each entry in the table to be a fuzzy set where each element of the corresponding domain is assigned a membership degree from the real interval [0…1]. But this fuzzy mechanism becomes inappropriate in modelling scenarios where data might be incomparable. Therefore, we become interested in further generalization of fuzzy database into L-fuzzy database. In such a database, the characteristic function for a fuzzy set maps to an arbitrary complete Brouwerian lattice L. From the query language perspectives, the language of fuzzy database, FSQL extends the regular Structured Query Language (SQL) by adding fuzzy specific constructions. In addition to that, L-fuzzy query language LFSQL introduces appropriate linguistic operations to define and manipulate inexact data in an L-fuzzy database. This research mainly focuses on defining the semantics of LFSQL. However, it requires an abstract algebraic theory which can be used to prove all the properties of, and operations on, L-fuzzy relations. In our study, we show that the theory of arrow categories forms a suitable framework for that. Therefore, we define the semantics of LFSQL in the abstract notion of an arrow category. In addition, we implement the operations of L-fuzzy relations in Haskell and develop a parser that translates algebraic expressions into our implementation.
    URI
    http://hdl.handle.net/10464/7280
    Collections
    • M.Sc. Computer Science

    Brock University | Copyright © 2006-2015 
    Contact Us | Send Feedback
     

     

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    Brock University | Copyright © 2006-2015 
    Contact Us | Send Feedback