Sciweavers

6274 search results - page 282 / 1255
» From query complexity to computational complexity
Sort
View
DOCENG
2008
ACM
15 years 6 months ago
Improving query performance on XML documents: a workload-driven design approach
As XML has emerged as a data representation format and as great quantities of data have been stored in the XML format, XML document design has become an important and evident issu...
Rebeca Schroeder, Ronaldo dos Santos Mello
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 5 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
146
Voted
EDBTW
2006
Springer
15 years 8 months ago
Hash-Based Structural Join Algorithms
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
Christian Mathis, Theo Härder
SIGMOD
2007
ACM
170views Database» more  SIGMOD 2007»
16 years 5 months ago
Cardinality estimation using sample views with quality assurance
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...
Per-Åke Larson, Wolfgang Lehner, Jingren Zho...
IPMI
2007
Springer
15 years 11 months ago
Spine Detection and Labeling Using a Parts-Based Graphical Model
Abstract. The detection and extraction of complex anatomical structures usually involves a trade-off between the complexity of local feature extraction and classification, and th...
Stefan Schmidt, Jörg H. Kappes, Martin Bergth...