269 search results - page 13 / 54 » On Tree Pattern Query Rewriting Using Views |
135
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
113
click to vote
IEICET
2008
15 years 1 months ago
2008
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
129
click to vote
ALT
1995
Springer
15 years 5 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
75
Voted
CIKM
2005
Springer
15 years 7 months ago
2005
Springer
123
click to vote
IDEAS
2005
IEEE
15 years 7 months ago
2005
IEEE
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...