Titlebook: Database Systems for Advanced Applications; 16th International C Jeffrey Xu Yu,Myoung Ho Kim,Rainer Unland Conference proceedings 2011 Spri

無能性

https://doi.org/10.1007/978-3-031-32346-1data structure “Weighted Indexing Map”(WIM) is presented. The WIM keeps an index of the weighted length information. Based on WIM, we propose an efficient algorithm, called .Neighbors, for answering the W.NN query. The experimental results show that our WIM based W.NN processing algorithm are effective and efficient.

揭穿真相

interior

The DISTARNET Approach to Reliable Autonomic Long-Term Digital Preservation archived. In this paper, we present DISTARNET, a fully distributed system that reliably executes pre-defined workflows for long-term preservation. Moreover, DISTARNET is designed as an open system that allows the curators of digital objects to specify new processes to cope with additional challenges.

代理人

Neighbors: A Method for Finding k Nearest Neighbors in Weighted Regionsdata structure “Weighted Indexing Map”(WIM) is presented. The WIM keeps an index of the weighted length information. Based on WIM, we propose an efficient algorithm, called .Neighbors, for answering the W.NN query. The experimental results show that our WIM based W.NN processing algorithm are effective and efficient.

GET

Aggregate Farthest-Neighbor Queries over Spatial Dataree aggregate functions. The BF algorithm is incremental and IO optimal. Extensive experiments on both synthetic and real data sets confirm the efficiency and effectiveness of our proposed algorithms.

SHOCK

Ceramic