710 search results - page 16 / 142 » Relational Expressive Power of Constraint Query Languages |
DOCENG
2009
ACM
14 years 2 months ago
2009
ACM
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...
LREC
2010
13 years 9 months ago
2010
In this work we present further development of the SpLaSH (Spoken Language Search Hawk) project. SpLaSH implements a data model for annotated speech corpora integrated with textua...
ICDT
1995
ACM
13 years 11 months ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
ACL
1998
13 years 9 months ago
1998
Starting from descriptions of French connectives (in particular "donc"---therefore), on the one hand, and aspectual properties of French tenses pass4 simple and imparfai...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...