3269 search results - page 317 / 654 » Query Optimization for XML |
161
Voted
RSCTC
2000
Springer
15 years 8 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
142
click to vote
OTM
2005
Springer
15 years 10 months ago
2005
Springer
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each ...
154
click to vote
KR
1992
Springer
15 years 9 months ago
1992
Springer
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
145
click to vote
ISCI
2007
15 years 4 months ago
2007
Declustering techniques reduce query response time through parallel I/O by distributing data among multiple devices. Except for a few cases it is not possible to find declusterin...
247
click to vote
ICDE
2006
IEEE
16 years 6 months ago
2006
IEEE
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...