Sciweavers

6004 search results - page 24 / 1201
» Parallelizing query optimization
Sort
View
IJWIS
2008
110views more  IJWIS 2008»
13 years 8 months ago
Determined: a system with novel techniques for XML query optimization and evaluation
: Purpose -- Efficient processing of XML queries is critical for XML data management and related applications. Previously proposed techniques are unsatisfactory. This article prese...
Dunren Che, Wen-Chi Hou
VLDB
2007
ACM
102views Database» more  VLDB 2007»
14 years 2 months ago
Depth Estimation for Ranking Query Optimization
A relational ranking query uses a scoring function to limit the results of a conventional query to a small number of the most relevant answers. The increasing popularity of this q...
Karl Schnaitter, Joshua Spiegel, Neoklis Polyzotis
PVLDB
2010
146views more  PVLDB 2010»
13 years 3 months 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...
EDBT
2009
ACM
90views Database» more  EDBT 2009»
14 years 1 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
EDBT
2011
ACM
281views Database» more  EDBT 2011»
13 years 5 days ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo