Efficient determination of the sequence of attributes of an N-attributed database for obtaining an optimal tree representation

  • Authors:

  • Ranjeet Kumar;Preetham Kumar;V. S. Ananthanarayana

  • Affiliations:

  • Department of Information & Communication Technology, Manipal Institute of Technology, Manipal, Karnataka, India;Department of Information & Communication Technology, Manipal Institute of Technology, Manipal, Karnataka, India;Department of Information Technology, National Institute of Technology, Surathkal, Karnataka, India

  • Venue:
  • AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

For an N-attributed database i.e. database storing the non-binary values of N number of attributes, a great deal of saving in space can be achieved while representing the database on the lines similar to PC-Tree, by determining the sequence of attributes (sorting order) to be considered constructing the tree. In order to avoid the ordinary and highly inefficient approach of constructing the tree by trying all the N! ( Factorial N ) combinations one by one, and accepting the combination that gives minimal number of nodes in the tree, we construct a mesh (abstraction), called RON's mesh, which gives an idea of how strongly the elements of an attribute are linked with the elements of other attributes, in terms of the number of nodes (elements) under each attribute and the number of links existing between the elements of attributes in the mesh. Finally, using the information from the mesh in an N*N matrix, we can find a sequence of attributes that gives the minimal number of nodes in the tree.