2635 search results - page 239 / 527 » Algorithms for the Database Layout Problem |
283
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
147
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
161
click to vote
DASFAA
2008
IEEE
16 years 1 months ago
2008
IEEE
Applications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach t...
176
click to vote
DASFAA
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we design a local classification algorithm using implicit link analysis, considering the situation that the labeled and unlabeled data are drawn from two different ...
182
click to vote
ADC
2008
Springer
16 years 29 days ago
2008
Springer
With respect to current methods for query evaluation over XML data streams, adoption of certain types of buffering techniques is unavoidable. Under lots of circumstances, the buff...