Sciweavers

223 search results - page 28 / 45
» Efficient Recursive Query Processing using Wavefront Methods
Sort
View
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 8 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 8 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
DOLAP
1999
ACM
14 years 28 days ago
Design and Selection of Materialized Views in a Data Warehousing Environment: A Case Study
In this paper, we describe the design of a data warehousing system for an engineering company ‘R’. This system aims to assist users in retrieving data for business analysis in...
Goretti K. Y. Chan, Qing Li, Ling Feng
SIGMOD
2003
ACM
152views Database» more  SIGMOD 2003»
14 years 8 months ago
Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects
In modern application domains such as multimedia, molecular biology and medical imaging, similarity search in database systems is becoming an increasingly important task. Especial...
Hans-Peter Kriegel, Stefan Brecheisen, Peer Kr&oum...
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
14 years 9 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider