50 search results - page 2 / 10 » Enhancing Graph Database Indexing by Suffix Tree Structure |
176
click to vote
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
Online persistent suffix tree construction has been considered impractical due to its excessive I/O costs. However, these prior studies have not taken into account the effects of ...
CPM
2007
Springer
15 years 3 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
176
click to vote
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
CIKM
2005
Springer
15 years 5 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...