Sciweavers

3020 search results - page 347 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
JCST
2010
155views more  JCST 2010»
15 years 1 months ago
Efficient Location Updates for Continuous Queries over Moving Objects
Abstract The significant overhead related to frequent location updates from moving objects often results in poor performance. As most of the location updates do not affect the quer...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
13 years 9 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
16 years 7 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
WWW
2005
ACM
16 years 7 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
VLDB
2004
ACM
119views Database» more  VLDB 2004»
16 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