Develop a web site to present decision tree structure, Database Management System

I am going to develop a web site to present decision tree structure. For this, I want a web application with AJAX technology to connect the database and prepare the decision tree's nods based upon what I define in the database. Admin of web site will define each nod and its children.

In the user side every time user click on a node, application consider to send a message to server and retrieves which records in the database are children of that returns and nod them. And user can see these new nods in the screen.

Skills required are AJAX, Graphic Design, Database Administration, HTML, Website Design

Posted Date: 1/29/2014 3:57:26 AM | Location : United States







Related Discussions:- Develop a web site to present decision tree structure, Assignment Help, Ask Question on Develop a web site to present decision tree structure, Get Answer, Expert's Help, Develop a web site to present decision tree structure Discussions

Write discussion on Develop a web site to present decision tree structure
Your posts are moderated
Related Questions
A student entity type has the following attributes,name..

Create Student DB and perform delete operation? STUDENT (name, student#, class, major) COURSE (course name, course#, credit hours, department) SECTION (section identifier, co

(1)     Insert into PERSON Violated constraint: - Key constraint Reason: - Primary key 1 already exists in PERSON. Dealing: - DBMS could ask the user to provide valid PER

What is Thread splitting A thread of control is a path by which a set of state diagrams on that a single object is active at a time. Objects are shared between threads

Using Literal Character String Example: To print IS A as one string with column name employee SELECT ENAME || ' IS A ' || JOB AS "EMPLOYEE" FROM EMP;

Why Like predicate used for? LIKE predicate: The LIKE predicate searches for strings in which have a certain pattern.

Define Atom of domain relational calculus An atom has the outline 1 , x 2 , ... , x n > -> r , in which r stands for a relation on n attributes and x 1 , x 2 , ... , x n ar

Compare the Nested-loop join and block-nested loop join Ans: Nested  loop join - It is costly as worst case cost, no. of block accesses needed is n r * b s + b r   where b

how to make an e r diagram?

What is a hashing function?  What are the properties of a good hashing function?  Describe the folding technique for hashing functions.      Ans:  Hashing function is a method