Sciweavers

419 search results - page 14 / 84
» Improving Adaptable Similarity Query Processing by Using App...
Sort
View
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
14 years 10 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 8 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...
CIKM
2008
Springer
13 years 10 months ago
Using the current browsing context to improve search relevance
In this paper, we investigate the problem of improving the relevance of a Web search engine by adapting it to the dynamic needs of the user. We examine a representative case of su...
Mandar Rahurkar, Silviu Cucerzan
ICASSP
2010
IEEE
13 years 8 months ago
Approximate nearest neighbors using sparse representations
A new method is introduced that makes use of sparse image representations to search for approximate nearest neighbors (ANN) under the normalized inner-product distance. The approa...
Joaquin Zepeda, Ewa Kijak, Christine Guillemot
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 10 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei