64 search results - page 2 / 13 » Expressiveness and Performance of Full-Text Search Languages |
ICS
2010
Tsinghua U.
13 years 10 months ago
2010
Tsinghua U.
We explore the intersection between an emerging class of architectures and a prominent workload: GPGPUs (General-Purpose Graphics Processing Units) and regular expression matching...
EUROPAR
2005
Springer
13 years 11 months ago
2005
Springer
This paper describes a novel approach to performance analysis for parallel and distributed systems that is based on soft computing. We introduce the concept of performance score re...
VLDB
2003
ACM
14 years 5 months ago
2003
ACM
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
ICS
2009
Tsinghua U.
14 years 12 days ago
2009
Tsinghua U.
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
WSDM
2009
ACM
14 years 12 days ago
2009
ACM
Temporal expressions, such as between 1992 and 2000, are frequent across many kinds of documents. Text retrieval, though, treats them as common terms, thus ignoring their inherent...