meta user
network profile
|
Dec 27 |
revised |
Design for archiving a sorted list (with ability for a few INSERT) It's INT UNSIGNED, not the other way around |
|
Dec 27 |
accepted | Design for archiving a sorted list (with ability for a few INSERT) |
|
Dec 27 |
answered | Design for archiving a sorted list (with ability for a few INSERT) |
|
Dec 25 |
comment |
Design for archiving a sorted list (with ability for a few INSERT) Hi Richard, I've just found another solution combining a rank mechanism and gaps (as Joel said). I'll post a solutino tomorrow ;) +1 for you both BTW. |
|
Dec 25 |
awarded | Scholar |
|
Dec 25 |
comment |
Design for archiving a sorted list (with ability for a few INSERT) So I just use 0-10,000 for book 1, 10,000-20,000 for book 2? |
|
Dec 25 |
revised |
Design for archiving a sorted list (with ability for a few INSERT) added 106 characters in body |
|
Dec 25 |
comment |
Design for archiving a sorted list (with ability for a few INSERT) Many thanks for your answer! I had the same idea, but there's still one problem resulting from the oversimplification I made: there is another column called for example 'book_id' which is a PK of another table. The problem is now that I have to retain the order inside all words belonging to a single 'book'. I could adopt the same approach with gaps but wouldn't it be easier to just add another column? |
|
Dec 25 |
awarded | Supporter |
|
Dec 25 |
comment |
Design for archiving a sorted list (with ability for a few INSERT) Thanks for your answer, but I think you have misunderstood me. I've included an example in the question body which should make things clearer. I also forgot to say that I'm using MySQL. |
|
Dec 25 |
revised |
Design for archiving a sorted list (with ability for a few INSERT) Added an example for clarity |
|
Dec 25 |
awarded | Editor |
|
Dec 25 |
revised |
Design for archiving a sorted list (with ability for a few INSERT) Forgot to mention that I'm using MySQL. |
|
Dec 24 |
comment |
Design for archiving a sorted list (with ability for a few INSERT) @Rohan But I can't really compute the 'rank' itself. It depends on which word the user saves at first. |
|
Dec 24 |
awarded | Student |
|
Dec 24 |
asked | Design for archiving a sorted list (with ability for a few INSERT) |
