273 search results - page 53 / 55 » Compressed String Dictionaries |
EDBT
2010
ACM
13 years 11 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
CNIS
2006
13 years 9 months ago
2006
A variety of network security services, such as access control in firewalls and protocol analysis in intrusion detection systems, require the discrimination of packets based on th...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
A great jump towards the advent of the Semantic Web will take place when a critical mass of web resources is available for use in a semantic way. This goal can be reached by the c...