Sciweavers

121 search results - page 4 / 25
» First-Order Queries over One Unary Function
Sort
View
ICDE
2008
IEEE
176views Database» more  ICDE 2008»
14 years 11 months ago
Automatic Result Verification for the Functional Testing of a Query Language
Functional testing of a query language is a challenging task in practice. In order to reveal errors in the query processing functionality, it is necessary to verify the actual res...
Carsten Binnig, Donald Kossmann, Eric Lo, Angel Sa...
CVPR
2009
IEEE
15 years 5 months ago
A Tensor-Based Algorithm for High-Order Graph Matching
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 10 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
BNCOD
2004
85views Database» more  BNCOD 2004»
13 years 11 months ago
Database Support for Path Query Functions
Extending relational database functionality to include data mining primitives is one step towards the greater goal of more closely integrated database and mining systems. This pape...
Rachel Hamill, Nigel J. Martin
LICS
2002
IEEE
14 years 2 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin