Titlebook: Similarity Search and Applications; 7th International Co Agma Juci Machado Traina,Caetano Traina,Robson Leo Conference proceedings 2014 Spr

Prehypertension

書目名稱Similarity Search and Applications影響因子(影響力)




書目名稱Similarity Search and Applications影響因子(影響力)學科排名




書目名稱Similarity Search and Applications網(wǎng)絡(luò)公開度




書目名稱Similarity Search and Applications網(wǎng)絡(luò)公開度學科排名




書目名稱Similarity Search and Applications被引頻次




書目名稱Similarity Search and Applications被引頻次學科排名




書目名稱Similarity Search and Applications年度引用




書目名稱Similarity Search and Applications年度引用學科排名




書目名稱Similarity Search and Applications讀者反饋




書目名稱Similarity Search and Applications讀者反饋學科排名

SNEER

Faster Proximity Searching with the Distal SATlinear sized indexes in the model of distance computations..In summary, we obtained an index more resistant to the curse of dimensionality, establishing a new benchmark in performance, faster to build than the . and with a small memory footprint. Our strategies can be used in any version of the ., either in main or secondary memory.

執(zhí)

REIGN

0302-9743 rs are organized in topical sections on Improving Similarity Search Methods and Techniques; Indexing and Applications; Metrics and Evaluation; New Scenarios and Approaches; Applications and Specific Domains.978-3-319-11987-8978-3-319-11988-5Series ISSN 0302-9743 Series E-ISSN 1611-3349

Gustatory

Nebulous

Efficient Algorithms for Similarity Search in Axis-Aligned Subspacesions are specified at query time. In this paper, we propose several new methods for the subspace similarity search problem. Extensive experiments are provided showing very competitive performance relative to state-of-the-art solutions.

CBC471

Iatrogenic

A Dynamic Pivoting Algorithm Based on Spatial Approximation Indexesesult is a technique that allows one to traverse a dynamic . without necessarily comparing all traversed nodes against the query object. As a result, the novel algorithm makes a much better use of the available space, yielding a saving of distance computations of about 10% to 70%, compared with previous . schemes that use pivot information.

HARD

Mendacious

The Similarity-Aware Relational Intersect Database Operatorn-source database system, namely PostgreSQL. Several queries from the TPC-H benchmark are extended to include similarity-based set intersetion predicates. Performance results demonstrate up to three orders of magnitude speedup in performance over equivalent queries that only employ regular operators.