SIGMOD
2011
ACM
13 years 3 months ago
2011
ACM
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
AMW
2011
13 years 4 months ago
2011
Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into aut...
DATESO
2007
14 years 1 months ago
2007
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
COMAD
2008
14 years 1 months ago
2008
Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...
ICDT
2010
ACM
14 years 2 months ago
2010
ACM
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...
DEXA
2006
Springer
14 years 4 months ago
2006
Springer
One of the problems associated with XML databases is the poor performance of XPath queries. Although this has attracted much attention by the research community, solutions are eith...
EDBT
2009
ACM
14 years 5 months ago
2009
ACM
In this study, we present experiences of parallelizing XPath queries using the Xalan XPath engine on shared-address space multi-core systems. For our evaluation, we consider a sce...
CIKM
2003
Springer
14 years 5 months ago
2003
Springer
There have been several techniques proposed for building statistics for static XML data. However, very little work has been done in the area of building XML statistics for data so...
VLDB
2004
ACM
14 years 5 months ago
2004
ACM
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may...
VLDB
2004
ACM
14 years 5 months ago
2004
ACM
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...