807 search results - page 47 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
248
click to vote
ICDE
2003
IEEE
16 years 5 months ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
134
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Like Darwinian-type genetic algorithms, there also exists genetic drift in Univariate Marginal Distribution Algorithm (UMDA). Since the universal analysis of genetic drift in UMDA...
122
Voted
JDCTA
2010
14 years 10 months ago
2010
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
357
click to vote
ICDE
2000
IEEE
16 years 5 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
132
click to vote
ADBIS
2009
Springer
15 years 1 months ago
2009
Springer
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...