Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
We propose Facetedpedia, a faceted retrieval system for information discovery and exploration in Wikipedia. Given the set of Wikipedia articles resulting from a keyword query, Fac...
Chengkai Li, Ning Yan, Senjuti Basu Roy, Lekhendro...
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...