11-02-2010, 06:50 AM
I cannot answer to 1) and 3).
Indexing nature, as I imagine it:
1. Indexing:
a) Get all filenames.
b) Get all unique words.
c) Bind each word with all filenames that contain it.
d) Save all to a database.
2. Searching:
a) Open the database.
b) Find the word in the word list (1 b).
c) Get filenames that are bound to the word.
It is simplified. Need much programming to make useful. But if you don't need to search in file data, would be quite simple.
Or you can use Windows Search: Enumerate files (with text in file)
Quote:2) What is the nature of "indexing" and can I do it myself easily within QM using SQLITE as Index database.
- I tried just outputting the filepaths of my folders to .txt file but it got so huge that it wouldn't open properly and I know it would be too big to do simple text string searching in QM. But maybe this could be done with SQLITE database. If it was just a list of filepaths, would searching this as a SQLITE database be faster than going through the regular Windows file structure like in the Search in Files dialog? Any advice on how to structure such an index database if so?
Indexing nature, as I imagine it:
1. Indexing:
a) Get all filenames.
b) Get all unique words.
c) Bind each word with all filenames that contain it.
d) Save all to a database.
2. Searching:
a) Open the database.
b) Find the word in the word list (1 b).
c) Get filenames that are bound to the word.
It is simplified. Need much programming to make useful. But if you don't need to search in file data, would be quite simple.
Or you can use Windows Search: Enumerate files (with text in file)