Richard Hipp a écrit :
> On Wed, Sep 1, 2010 at 10:28 AM, Pierre AUBERT wrote:
>
>
>> Hello all,
>>
>> I can't compile sqlite 3.7.2 if SQLITE_OMIT_WAL is defined.
>> In pager.c, the function pagerPagecount is defined only if
>> SQLITE_OMIT_
Hello all,
I can't compile sqlite 3.7.2 if SQLITE_OMIT_WAL is defined.
In pager.c, the function pagerPagecount is defined only if
SQLITE_OMIT_WAL is not, but this function is called from hasHotJournal
regardless SQLITE_OMIT_WAL.
Best regards
___
sql
Hello John,
a page rank like algorithm does not make sense with only a bunch of text files.
Its power
comes from its hability to take into account the matrix of links between
documents on the web.
In this case, a classic TFIDF http://en.wikipedia.org/wiki/Tf-idf algorithm
should be sufficient.
P
t search in database
2007/3/6, Pierre Aubert <[EMAIL PROTECTED]>:
> You can also use ft3.sourceforge.net
Does this also allow having an inverted index without actually storing
the files in the database?
Cheers,
Jos
-
You can also use ft3.sourceforge.net
Pierre
- Message d'origine
De : Henrik Ræder <[EMAIL PROTECTED]>
À : sqlite-users@sqlite.org
Envoyé le : Mardi, 6 Mars 2007, 9h22mn 33s
Objet : [sqlite] Soft search in database
Hi
(First post - hope it's an appropriate place)
I've been impl
Hello Cesar,
may be you can have a look at ft3 (ft3.sourceforge.net) which does the same
thing.
Some advices:
* partition your table ft_index on wordid
I use 1024 tables and use them like that:
ft_index[ wordid % 1024 ]
to access them. This reduce the size of the table and thus the size
Hello,
I wrote a small full text search engine for sqlite3.
Basic ideas are as follow:
--
* use another sqlite3 file for storing full text index
information
* store everything into sqlite3 (this is not the
fastest strategy in particular for inverted index)
* don't ca
7 matches
Mail list logo