Sciweavers

23 search results - page 2 / 5
» Compact and efficient strings for Java
Sort
View
TCS
2008
13 years 5 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq
DASFAA
2005
IEEE
134views Database» more  DASFAA 2005»
13 years 11 months ago
An Improved Prefix Labeling Scheme: A Binary String Approach for Dynamic Ordered XML
A number of labeling schemes have been designed to facilitate the query of XML, based on which the ancestor-descendant relationship between any two nodes can be determined quickly....
Changqing Li, Tok Wang Ling
IPPS
2010
IEEE
13 years 3 months ago
Head-body partitioned string matching for Deep Packet Inspection with scalable and attack-resilient performance
Abstract--Dictionary-based string matching (DBSM) is a critical component of Deep Packet Inspection (DPI), where thousands of malicious patterns are matched against high-bandwidth ...
Yi-Hua E. Yang, Viktor K. Prasanna, Chenqian Jiang
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
14 years 5 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
COMPSAC
2007
IEEE
13 years 12 months ago
A Combined Concept Location Method for Java Programs
Concept location is one of the fundamental activities during software maintenance which locates the parts of the source code where a specific concept is implemented. The methods f...
Dapeng Liu, Shaochun Xu