Sciweavers

929 search results - page 175 / 186
» Answering imprecise database queries: a novel approach
Sort
View
VLDB
2004
ACM
119views Database» more  VLDB 2004»
14 years 7 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran
EDBT
2009
ACM
118views Database» more  EDBT 2009»
14 years 2 months ago
Optimized union of non-disjoint distributed data sets
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
Itay Dar, Tova Milo, Elad Verbin
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
14 years 1 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002
DEXA
2010
Springer
213views Database» more  DEXA 2010»
13 years 8 months ago
Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
DASFAA
2010
IEEE
220views Database» more  DASFAA 2010»
13 years 5 months ago
An Effective Object-Level XML Keyword Search
Keyword search is widely recognized as a convenient way to retrieve information from XML data. In order to precisely meet users' search concerns, we study how to effectively r...
Zhifeng Bao, Jiaheng Lu, Tok Wang Ling, Liang Xu, ...