Sciweavers

792 search results - page 13 / 159
» Computing Iceberg Queries Efficiently
Sort
View
SSDBM
1999
IEEE
118views Database» more  SSDBM 1999»
14 years 19 hour ago
Evaluation of Ad Hoc OLAP: In-Place Computation
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
Damianos Chatziantoniou
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 8 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel
VLDB
2009
ACM
381views Database» more  VLDB 2009»
14 years 7 months ago
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN
In this paper, we study the problem of continuous monitoring of reverse k nearest neighbor queries. Existing continuous reverse nearest neighbor monitoring techniques are sensitive...
Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wei...
RTSS
2008
IEEE
14 years 2 months ago
MDS: Efficient Multi-dimensional Query Processing in Data-Centric WSNs
Hanhua Chen, Mo Li, Hai Jin, Yunhao Liu, Lionel M....