SQL Tree Insertion 1

[kentusha]

Hi-ya

Alrighty I have a sql tree structure,

for example:

("1","0","Top"}
("2","1","A"}
("3","1","C"}
("4","1","D"}

and I want to do an insert and retain the sorting eg:

("1","0","Top"}
("2","1","A"}
("3","1","B"}
("4","1","C"}
("5","1","D"}

what is the best way to do this?

 

[Golom]

Things inserted into an SQL table are not sorted in any particular order. By default (i.e. if you don't do anything to change it) records are usually retrieved in the order in which they were input. If you want to GUARANTEE that order then you need to attach some field that is incremented sequentially (like an autonumber field) and then ORDER BY that field when you retrieve records from the table.

 

[kentusha]

thanks for the advice but I am not sure how I would implement it.

I am currently inserting them alpha, and they come out alpha. Can I not go and reorder them somehow without reinsterting them all?

How would your idea get implemented?

This is basically the table structure shown in an insert.
INSERT INTO treemenu_swap ( id, prev, title, url, target, attributes, folder_flag) VALUES("1","0","Top","

http://www.bigblogzoo.com/cgi-bin/newsfeed.pl?curID=1&dmoz=Top","","","1");

 

[fredericofonseca]

When you insert records into a table the order is whatever order you insert then as.

When you retrieve then you need to specify which order you wish them to be on by using the "ORDER BY" clause of the "SELECT" statement.

Regards

Frederico Fonseca
SysSoft Integrated Ltd

http://www.syssoft-int.com

 

[kentusha]

sounds logical. will try it. thanks.