Sciweavers

182 search results - page 24 / 37
» Comparing XML path expressions
Sort
View
ICS
2009
Tsinghua U.
14 years 3 months ago
High-performance regular expression scanning on the Cell/B.E. processor
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...
Daniele Paolo Scarpazza, Gregory F. Russell
WWW
2003
ACM
14 years 9 months ago
XQuery By Example
XQuery, the standard query language for XML, is gaining popularity among users with a SQL background; indeed, formulating XQuery and SQL queries requires comparable skills. Howeve...
Daniele Braga, Alessandro Campi, Stefano Ceri, Enr...
ISCA
2007
IEEE
111views Hardware» more  ISCA 2007»
14 years 2 months ago
Express virtual channels: towards the ideal interconnection fabric
Due to wire delay scalability and bandwidth limitations inherent in shared buses and dedicated links, packet-switched on-chip interconnection networks are fast emerging as the per...
Amit Kumar 0002, Li-Shiuan Peh, Partha Kundu, Nira...
PODS
2008
ACM
143views Database» more  PODS 2008»
14 years 8 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
DOCENG
2009
ACM
14 years 3 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...