432 search results - page 17 / 87 » On Notions of Regularity for Data Languages |
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
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...
NJC
2006
13 years 7 months ago
2006
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 ...
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
FAD is a powerful and simple language designed for a highly parallel database machine. The basic concepts of the language are its data structures (which we call objects) and its p...
DLT
2007
13 years 9 months ago
2007
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
Concurrency-related bugs may happen when multiple threads access shared data and interleave in ways that do not correspond to any sequential execution. Their absence is not guaran...