Indexing Values of a Fuzzy Variable

Indexing Values of a Fuzzy Variable

Blog Article

Currently, fuzzy data, linguistic variables, etc.are used.However, modern DBMS lacks support for operations on odd data and means of indexing this data.A solution to the problem of indexing a set of fuzzy values of a linguistic alternative is proposed.Fuzzy variables are represented as closed planar polylines or polygons.

To optimize processing, a polygon projection is built, which will Gear Shift Extensions be stored in a hierarchical index.A modified R-tree structure is proposed, which is optimized for storing fuzzy values.Internal tree nodes store the minimum bounding spacing for all child nodes, leaf nodes, in addition, store the fuzzy value polygon itself and the polygons corresponding to the specified alpha levels.Leaf nodes have links to neighboring leaf Early Learning Toy nodes to perform more, less, unequal operations.Modified algorithms for insertion and search in a modified R-tree are proposed.

Testing of the proposed algorithms was carried out, which showed not the worst execution time compared to standard R-tree algorithms.