54 search results - page 3 / 11 » Cost based plan selection for xpath |
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
We make two main contributions in this paper. First, we motivate and introduce a novel class of data mining problems that arise in labeling a group of mass spectra, specifically f...
PVLDB
2008
13 years 7 months ago
2008
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query opt...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
A “plan diagram” is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. In this paper, we present and an...
WWW
2008
ACM
13 years 7 months ago
2008
ACM
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...