295 search results - page 3 / 59 » Compressed full-text indexes |
WEBDB
2005
Springer
14 years 1 months ago
2005
Springer
Current peer-to-peer (p2p) full-text keyword search techniques fall into the following categories: document-based partitioning, keyword-based partitioning, hybrid indexing, and se...
VLDB
1993
ACM
13 years 12 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
WEBNET
1996
13 years 9 months ago
1996
: Because digital libraries are expensive to create and maintain, Internet analogs of public libraries--reliable, quality, community services--have only recently begun to appear. A...
JEA
2008
13 years 8 months ago
2008
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
JIPS
2008
13 years 7 months ago
2008
: This research proposes a new strategy where documents are encoded into string vectors and modified version of KNN to be adaptable to string vectors for text categorization. Tradi...