Sciweavers

151 search results - page 1 / 31
» Efficient regular expression evaluation: theory to practice
Sort
View
WWW
2005
ACM
14 years 5 months ago
Expressiveness of XSDs: from practice to theory, there and back again
On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. However, an invest...
Geert Jan Bex, Wim Martens, Frank Neven, Thomas Sc...
ICDE
2003
IEEE
209views Database» more  ICDE 2003»
14 years 6 months ago
An Evaluation of Regular Path Expressions with Qualifiers against XML Streams
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
Dan Olteanu, François Bry, Tobias Kiesling
NJC
2006
102views more  NJC 2006»
13 years 4 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
FPL
2008
Springer
178views Hardware» more  FPL 2008»
13 years 6 months ago
High-speed regular expression matching engine using multi-character NFA
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
Norio Yamagaki, Reetinder P. S. Sidhu, Satoshi Kam...