Sciweavers

5130 search results - page 53 / 1026
» Constraint Query Languages
Sort
View
DATESO
2007
103views Database» more  DATESO 2007»
14 years 12 days ago
Using BMH Algorithm to Solve Subset of XPath Queries
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
David Toth
JANCL
2002
90views more  JANCL 2002»
13 years 10 months ago
A Topological Constraint Language with Component Counting
A topological constraint language is a formal language whose variables range over certain subsets of topological spaces, and whose nonlogical primitives are interpreted as topologi...
Ian Pratt-Hartmann
EXTREME
2004
ACM
14 years 4 months ago
A Simple Proof for the Turing-Completeness of XSLT and XQuery
The World Wide Web Consortium recommends both XSLT and XQuery as query languages for XML documents. XSLT, originally designed to transform XML into XSL-FO, is nowadays a fully gro...
Stephan Kepser
EACL
2003
ACL Anthology
14 years 10 days ago
Finite Structure Query: A Tool for Querying Syntactically Annotated Corpora
Finite structure query (fsq for short) is a tool for querying syntactically annotated corpora. fsq employs a query language of high expressive power, namely full first order logi...
Stephan Kepser