Data/File Structure and Algorithm for Retrieving Sorted Data Chunk Efficiently

Paul Rubin http
Tue Oct 5 21:08:25 CEST 2004


janeaustine50 at hotmail.com (Jane Austine) writes:
> What can I do instead? What data structure allows you to access
> nth..n+10th data from the sorted list in a constant time?

If you're building a real application you probably should use an SQL
database that handles all the concurrency issues, etc. as well as the
problem you're describing.  If you're asking out of theoretical
interest (a homework problem?), then think in terms of secondary
indexes.



More information about the Python-list mailing list