Sciweavers

Share
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
8 years 3 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
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...
Pierre Senellart, Asma Souihli
AMW
2011
8 years 3 months ago
A Direct Translation from XPath to Nondeterministic Automata
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...
Nadime Francis, Claire David, Leonid Libkin
DATESO
2007
103views Database» more  DATESO 2007»
9 years 1 months ago
Using BMH Algorithm to Solve Subset of XPath Queries
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...
David Toth
COMAD
2008
9 years 1 months ago
Efficient Evaluation of Forward XPath Axes over XML Streams
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 ...
Abdul Nizar, P. Sreenivasa Kumar
ICDT
2010
ACM
194views Database» more  ICDT 2010»
9 years 2 months ago
Bag Equivalence of XPath Queries
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...
Sara Cohen, Yaacov Y. Weiss
DEXA
2006
Springer
118views Database» more  DEXA 2006»
9 years 3 months ago
Using an Oracle Repository to Accelerate XPath Queries
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...
Colm Noonan, Cian Durrigan, Mark Roantree
EDBT
2009
ACM
90views Database» more  EDBT 2009»
9 years 4 months ago
Parallelization of XPath queries using multi-core processors: challenges and experiences
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...
Rajesh Bordawekar, Lipyeow Lim, Oded Shmueli
CIKM
2003
Springer
9 years 5 months ago
Building XML statistics for the hidden web
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...
Ashraf Aboulnaga, Jeffrey F. Naughton
VLDB
2004
ACM
96views Database» more  VLDB 2004»
9 years 5 months ago
Answering XPath Queries over Networks by Sending Minimal Views
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...
Keishi Tajima, Yoshiki Fukui
VLDB
2004
ACM
101views Database» more  VLDB 2004»
9 years 5 months ago
Taming XPath Queries by Minimizing Wildcard Steps
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...
Chee Yong Chan, Wenfei Fan, Yiming Zeng
books