62 search results - page 10 / 13 » Tree Logical Classes for Efficient Evaluation of XQuery |
SIGMOD
2005
ACM
14 years 9 months ago
2005
ACM
We present a method to evaluate path queries based on the novel concept of partial path instances. Our method (1) maximizes performance by means of sequential scans or asynchronou...
JCP
2008
13 years 8 months ago
2008
We perform the task of shape recognition using a skeleton based method. Skeleton of the shape is considered as a free tree and is represented by a connectivity graph. Geometric fea...
FOCS
1998
IEEE
14 years 1 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
POPL
2008
ACM
14 years 9 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
CSCLP
2004
Springer
14 years 2 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...