Inverted files versus suffix arrays for locating patterns in primary memory
Recent advances in the asymptotic resource costs of pattern matching with compressed suffix arrays are attractive, but a key rival structure, the compressed inverted file, has been dismissed or ignored in papers presenting the new structures. In this paper we examine the resource requirements of com...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
Springer
2006
|
| Online Access: | http://hdl.handle.net/20.500.11937/43428 |