116 search results - page 15 / 24 » Measuring the Complexity of Join Enumeration in Query Optimi... |
181
Voted
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
117
click to vote
EDBT
2002
ACM
15 years 11 months ago
2002
ACM
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
108
Voted
PODS
2007
ACM
15 years 11 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
DAWAK
2010
Springer
15 years 23 days ago
2010
Springer
Spatial data warehouses (SDW) enable analytical multidimensional queries together with spatial analysis. Mainly, three operations are related to SDW query processing performance: (...
116
Voted
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...