William Park opengeometry at yahoo.ca
Fri Oct 8 01:41:10 EDT 2004

• Previous message (by thread): Data/File Structure and Algorithm for Retrieving Sorted Data Chunk Efficiently
• Next message (by thread): Data/File Structure and Algorithm for Retrieving Sorted Data Chunk Efficiently
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

Jane Austine <janeaustine50 at hotmail.com> wrote:
> Thank you for reminding me Knuth's words. However, there are other
> information on each records, and the whole list could grow upto
> 10MB~100MB.
> 
> Another problem is, the list update action could take a long time and
> big memory. The list could shrink and expand. Do I have to sort them
> all in memory and then update the textfile _everytime_ it's changed?

There are so many ways.  Textfile is one.  SQL is another.  Only you can
answer that question.

-- 
William Park <opengeometry at yahoo.ca>
Open Geometry Consulting, Toronto, Canada

---

• Previous message (by thread): Data/File Structure and Algorithm for Retrieving Sorted Data Chunk Efficiently
• Next message (by thread): Data/File Structure and Algorithm for Retrieving Sorted Data Chunk Efficiently
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

More information about the Python-list mailing list