591 search results - page 37 / 119 » The complexity of XPath query evaluation |
DOLAP
2004
ACM
14 years 2 months ago
2004
ACM
In today’s OLAP systems, integrating fast changing data, e.g., stock quotes, physically into a cube is complex and time-consuming. The widespread use of XML makes it very possib...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Due to the complexity of XML query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of XML to wider c...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
We present a novel approach for filtering XML documents using nondeterministic finite automata and distributed hash tables. Our approach differs architecturally from recent propos...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are asso...
ICDT
2001
ACM
14 years 1 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...