With the rapid growth in size and number of available databases, the manipulation of large concept hierarchies that cannot be fit in main memory becomes more and more frequent. Several representations of concept hierarchies are possible, for example tree, lattice, table, linked list, etc. In this paper, we propose an efficient implementation technique to manipulate large concept hierarchies. We use a lattice data structure to represent concept hierarchies and encode such a lattice into a boolean transitive closure matrix. A set of lattice operators are defined and implemented as abstract data types on the top of an object-relational database management system, and are used to perform generalization and specialization operations. We show the efficiency of the lattice operators to perform generalization and specialization in large concept hierarchies and compare their performance with the START WITH and CONNECT BY clauses of SQL.
CITATION STYLE
Kachai, Y., & Waiyamai, K. (2001). Representing large concept hierarchies using lattice data structure. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2035, pp. 186–197). Springer Verlag. https://doi.org/10.1007/3-540-45357-1_23
Mendeley helps you to discover research relevant for your work.