Help with project! Multiway decision tree on SQL

[aElen]

Hello,

 

Im working on my minor project for my Undergrad course.

I have no earlier experience on working with SQL, im the biggest noob if there ever was one.

 

For a part of my project i have to design a page using php and sql to query from a big student database selected details(Rank, Sex, Branch) and calculate the industrial placement chances and to construct a multiway decision search tree on SQL(im using WAMP server).

 

This page is supposed to help new students joining the college decide an ideal branch based on past performances and placement record. A new student will enter his rank and relevant details and the from the decision tree an ideal branch(es) with high placement history will be suggested.

 

My project assignment reads:

"Now from the above prepared data constuct a decision search tree implement it a either using association rules or persistent Objects and store it in secondary storage as shown

 

 

Further studies can be done to improve existing decision trees ... data mining bayesian classifier blah blah blah ... "

 

What i have done till now is create a table in this format:

 

 

But this hardly a tree. Rather i had flattened each path of the tree and made it into a table like:

[node] -> [node] -> [node] -> [leaf]

 

I have tried to read some text on how to do this, but its not making sence and most importantly im not sure what im reading is actually going to help me achieve my project goals. Right now stranded reading random articles. I have to do this within 5 days. I have asked people around here some professionals and teachers, noone seems to have done this before. A little help in direction would be greatly appreciated.

 

Regards

 

Anurag

[beebum]

I'm not sure I understand all your data so this may not help but here goes. 

 

You can use a type of full-text query to get a "score" and then order by col1, col3, col2... as required.

 

http://dev.mysql.com/doc/refman/5.0/en/fulltext-boolean.html