Compressed Bit-sliced Signature Files An Index Structure for Large Lexicons
| dc.contributor.author | Can, Fazli | en_US |
| dc.contributor.author | Carterette, Ben | en_US |
| dc.date.accessioned | 2008-07-22T19:31:44Z | |
| dc.date.available | 2008-07-22T19:31:44Z | |
| dc.date.issued | 1999-04-01 | en_US |
| dc.date.submitted | 2008-03-17 | en_US |
| dc.identifier.uri | http://hdl.handle.net/2374.MIA/250 | |
| dc.description.abstract | We use the signature file method to search for partially specified terms in large lexicons. To optimize efficiency, we use the concepts of the partially evaluated bit-sliced signature file method and memory resident data structures. Our system employs signature partitioning, compression, and term blocking. We derive equations to obtain system design parameters, and measure indexing efficiency in terms of time and space. The resulting approach provides good response time and is storage-efficient. In the experiments we use four different lexicons, and show that the signature file approach outperforms the inverted file approach in certain efficiency aspects. KEYWORDS: Lexicon search, n-grams, signature files. | en_US |
| dc.title | Compressed Bit-sliced Signature Files An Index Structure for Large Lexicons | en_US |
| dc.type | Text | en_US |
| dc.type.genre | Report | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| fulltext.pdf | 644.0Kb |
|