[REBOL] Overhead for insert and blocks
From: chris:starforge:demon at: 30-Oct-2000 15:36
Hi,
I'm developing a package of scripts that store a
large number (potentially in the thousands) of usernames,
passwords, email addresses and other details. Insertions
and removals will be uncommon, but updates and searches
will be very common and they must be fast. For this reason
I've decided to split the data into 26 files and the file
any particular user will be in is determined by the first
character of the username. Internally the files look like:
[
[ username
password
email
......
]
[ username
... etc...
]
.....
]
I chose this structure to make accessing, adding and
removing records easier for me. The only problem I have
is that I can't use append - new items must be inserted
at the start of the list for reasons that would take too
long to go into now.
What is the overhead of inserting new user blocks at the
start or how are blocks stored? Do blocks containing
nested blocks contain pointers to the nested data, or is
the data arranged in a single continuos memory area?
Chris
--
New sig in the works
Explorer2260 Designer and Coder
http://www.starforge.co.uk
