Sciweavers

156 search results - page 2 / 32
» Statistical Learning Techniques for Costing XML Queries
Sort
View
ADC
2008
Springer
135views Database» more  ADC 2008»
14 years 1 months ago
Faster Path Indexes for Search in XML Data
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
Nils Grimsmo
ICDE
2002
IEEE
153views Database» more  ICDE 2002»
14 years 8 months ago
From XML Schema to Relations: A Cost-Based Approach to XML Storage
As Web applications manipulate an increasing amount of XML, there is a growing interest in storing XML data in relational databases. Due to the mismatch between the complexity of ...
Jérôme Siméon, Juliana Freire,...
KAIS
2006
247views more  KAIS 2006»
13 years 7 months ago
XCQ: A queriable XML compression system
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a fa...
Wilfred Ng, Wai Yeung Lam, Peter T. Wood, Mark Lev...
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 10 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
VLDB
2001
ACM
190views Database» more  VLDB 2001»
13 years 12 months ago
LEO - DB2's LEarning Optimizer
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
Michael Stillger, Guy M. Lohman, Volker Markl, Mok...