Sciweavers

28 search results - page 5 / 6
» Dynamic skyline queries in metric spaces
Sort
View
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
13 years 7 months ago
CP-index: using clustering and pivots for indexing non-metric spaces
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. ...
Victor Sepulveda, Benjamin Bustos
COCOON
1998
Springer
14 years 21 days ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
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...
WWW
2010
ACM
14 years 3 months ago
Facetedpedia: dynamic generation of query-dependent faceted interfaces for wikipedia
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...
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
14 years 25 days ago
DynaMat: A Dynamic View Management System for Data Warehouses
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...
Yannis Kotidis, Nick Roussopoulos
SCCC
2003
IEEE
14 years 1 months ago
Improved Deletions in Dynamic Spatial Approximation Trees
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...
Gonzalo Navarro, Nora Reyes