1018 search results - page 57 / 204 » On the minimization of XPath queries |
103
click to vote
COLT
2004
Springer
15 years 5 months ago
2004
Springer
We investigate label efficient prediction, a variant, proposed by Helmbold and Panizza, of the problem of prediction with expert advice. In this variant, the forecaster, after gues...
226
click to vote
ICDE
2004
IEEE
16 years 2 months ago
2004
IEEE
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
102
click to vote
EDBT
2006
ACM
16 years 1 months ago
2006
ACM
In authorization-transparent access control, users formulate their queries against the database schema rather than against authorization views that transform and hide data. The Tru...
123
click to vote
IS
2012
13 years 9 months ago
2012
When transforming data one often wants certain information in the data source to be preserved, i.e., we identify parts of the source data and require these parts to be transformed...
PVLDB
2010
14 years 12 months ago
2010
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...