| |
| |
| |
|
Page: 1 2 3 4 5 6 7 8 9 10 11
Comments:
<0> maybe a few megs
<1> each?
<1> or total?
<0> each record
<0> there would be a list ***ociated with each record
<1> do you want to search on the strings?
<0> ill need to bring them all up at once but no specific searching
<0> ill need to display the actual list but not necessarily search
<1> are there any other data relating to the strings?
<0> its just a list of strings ill probably do something with some of the string values but not manipulating the actual strings
<0> it would be readonly
<1> you're going to display a list of strings that are 2Mb each?
<0> possibly
<0> like a tree
<0> and actualyl you know what
<0> i am going to need to search
<0> the list
<1> well to quote a famous dead guy. krikey!
<0> is there a good way for this
<0> or maybe multiple string lists or something that can be linked maybe
<1> I would have 1 table for each level of the table
<1> table = tree rather.
<0> :)
<1> how many branch levels will you have?
<0> variable amount
<1> you can do it in one table too.
<0> how?
<0> these are directory structures id be dealing wiht
<1> but traversing a flat table is much much harder.
<0> i wa sthinking xml but that can get slow
<0> forget the xml actually
<0> id be storing directory structures
<0> im not sure the best way to go about oit
<1> hmmm.
<1> if it weren't for the 3Mb per record... I'd say you need a memory structure.
<0> and what is that :)
<1> linked lists... binary trees, dictionaries, etc...
<0> oo
<0> yea
<0> does delphi have direct support for this?
<1> TList/TObjectList
<1> but its way too much memory.
<0> hm
<0> what about just listing in a file
<0> the directory structure
<1> are you doing anything which requires m***ive speed ?
<0> well id like it to be fairly quick
<0> nothin ridiculous
<1> how many strings are we looking at?
<1> 10, 20, 2000, 20 000,
<1> ...
<0> well think about a list of directories ud find on you rhard drive
<0> plus subdirectoriesm etc
<1> well 99% of my directories are almost empty.
<0> i basically just need a list of directories and files in the directories and subdirs
<1> how do you get about 3Mb per record out of that?
<0> i dotn know
<0> maybe its a large structure
<1> are you trying to index your whole drive?
<0> i suppose
<1> what are you storing in these strings?
<0> just list of directories and files
<0> full paths
<1> so you're talking <256 bytes per string then.
<1> as Max_path is 255
<0> is that what it would amount to
<0> i dont know
<1> including filename which can be up to 62 characters.
<1> hmmm.
<1> well that brings a linked list backinto play.
<1> are you searching for filenames?
<0> yes
<0> and path
<1> yeah but we can store those seperately.
<0> and link them?
<1> yes
<0> so we are back to the memory structure
<1> but my point is... they can be indexed faster because of smaller strings...
<0> i see
<1> well you could... but you'd have to write you're own search routines.
<1> if you use a db then you get a bunch of powerful search utils built in.
<0> well
<1> I would suggest a master/detail relationship.
<0> i will be usin a database for general information and i guess something to point to the relevant directory structure
<0> for this?
<0> and storing the directories in memory structures?
<1> 1 table with UniqueId, Path and another with UniqueId, PathId (link to table1 UniqueId) and filename.
<0> for each database entry?
<0> you mean 1 tree or list?
<1> then you could do searches like... select * from table1 t1 right join table2 t2 on t1.UniqueId = t2.PathId where t2.filename like "%.mp3"
<1> and that would show you where all your mp3s are.
<0> so your saying a whole table for each dir structure
<1> it would then be up to you on how to load that into a tree.
<1> no. a table for all the dir structure... 1 record per folder.
<1> and drive
<0> ok
<1> and 1 table for a link to the path... and the filenames.
<1> 1 record per filename.
<0> i see
<1> *grin* good.
<0> sorry
<0> you are being very helpful i just get a little confused
<1> dbs are like that.
<1> until you get them... they can be confusing.
<0> so say i have 3 hard drives each with different dir structures, are you sainyg 2 tables for each
<0> dont get mad :)
<0> haha
<1> but like learning cl***es... once you get over the hump... its almost downhill from there.
<1> no I'm not saying that at all.
<0> so basically
<1> each HD is just another path to the filesystem.
<0> well i much rather each hd be its own thing
<1> that is a choice you will have to make.
<0> as each one will have differnet properties
<1> but it is not a design limit on my design.
<0> so i was thinking 1 table for each of thsoe drives then maybe another table for the links to that
<0> is that what you're saying
<1> you could add a 3rd table to track drive properties :-)
<0> oh boy
<1> yes.
<0> haha
<0> ur makin me sweat
<0> haha
<1> no your idea would work.
<1> its the same thing... you just said it differently.
<0> wouldnt the table of all this data for each drive be huge
<1> well it wouldn't be tiny.
<0> listing each dir and filename
<1> but since each dir is only listed once... it cuts down dramatically on storage.
<0> so this is the best way
<1> best? I dunno. its the fastest that I know of.
<1> and the easiest to search.
<0> i just want the most proper way
<0> and fast
<0> so this makes sense then
<1> then go with the db as I described it.
<1> or wait a few hours and find someone else who works with dbs and memory structures
<0> so the second table would list each directory as a record
<0> im sure your way makes justa s much sense as any one elses i certainly trust your judgement you seem very educated
<1> yes. but only once for each directory.
<0> what about subdirectories
<1> hah! I'm educated.... but about dbs... I'm self taught... like most others.
<0> yea
<0> the best are self taught in my opinion
<1> pacabel_: _ALL_ directories... from root to the deepest level.
<0> but each drive will be different how do i ***ociate them
<0> by field
<0> u knwo what i mean
<0> sorry im complicating this
<1> have a table... something like. UniqueId, DriveLetter, Properties
<1> then alter table1 to include DriveId
Return to
#delphi
or
Go to some related
logs:
#computers
#debian
#computers
tspc INTERFACE_SETUP_FAILED
#nhl
#politics
nv4dsp
#heroin
#nhl
#sex
|
|