Sciweavers

599 search results - page 3 / 120
» Improving the Efficiency of XPath Execution on Relational Sy...
Sort
View
VLDB
2005
ACM
123views Database» more  VLDB 2005»
14 years 5 months ago
Querying XML streams
Efficient querying of XML streams will be one of the fundamental features of next-generation information systems. In this paper we propose the TurboXPath path processor, which acce...
Vanja Josifovski, Marcus Fontoura, Attila Barta
PVLDB
2010
146views more  PVLDB 2010»
13 years 4 days ago
Generating Efficient Execution Plans for Vertically Partitioned XML Databases
Experience with relational systems has shown that distribution is an effective way of improving the scalability of query evaluation. In this paper, we show how distributed query e...
Patrick Kling, M. Tamer Özsu, Khuzaima Daudje...
XIMEP
2006
ACM
194views Database» more  XIMEP 2006»
13 years 11 months ago
Template Folding for XPath
We discuss query evaluation for XML-based server systems where the same query is evaluated on every incoming XML message. In a typical scenario, many of the incoming messages will...
Carl-Christian Kanne, Guido Moerkotte
EDBT
2010
ACM
149views Database» more  EDBT 2010»
13 years 10 months ago
Statistics-based parallelization of XPath queries in shared memory systems
The wide availability of commodity multi-core systems presents an opportunity to address the latency issues that have plaqued XML query processing. However, simply executing multi...
Rajesh Bordawekar, Lipyeow Lim, Anastasios Kements...
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
14 years 5 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...