591 search results - page 52 / 119 » The complexity of XPath query evaluation |
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
PODS
2009
ACM
14 years 9 months ago
2009
ACM
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
SIGMOD
2005
ACM
14 years 8 months ago
2005
ACM
Database query languages can be intimidating to the nonexpert, leading to the immense recent popularity for keyword based search in spite of its significant limitations. The holy ...
DEXA
2006
Springer
14 years 12 days ago
2006
Springer
Recent work on continuous queries has focused on processing queries in very large, mobile environments. In this paper, we propose a system leveraging the computing capacities of mo...
ICDE
2011
IEEE
13 years 13 days ago
2011
IEEE
—When users submit new queries to a distributed stream processing system (DSPS), a query planner must allocate physical resources, such as CPU cores, memory and network bandwidth...