Sciweavers

36 search results - page 1 / 8
» Experiments on String Matching in Memory Structures
Sort
View
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
14 years 6 months ago
XML Prefiltering as a String Matching Problem
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...
Christoph Koch, Stefanie Scherzinger, Michael Schm...
DASFAA
2009
IEEE
136views Database» more  DASFAA 2009»
14 years 3 days ago
A Two-Tire Index Structure for Approximate String Matching with Block Moves
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
Bin Wang, Long Xie, Guoren Wang
JSAC
2006
172views more  JSAC 2006»
13 years 5 months ago
A Memory-Efficient Parallel String Matching Architecture for High-Speed Intrusion Detection
The ability to inspect both packet headers and payloads to identify attack signatures makes network intrusion detection system (NIDS) a promising approach to protect Internet syste...
Hongbin Lu, Kai Zheng, Bin Liu, Xin Zhang, Y. Liu
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
13 years 10 months ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu