Sciweavers

853 search results - page 159 / 171
» Similarity Indexing with the SS-tree
Sort
View
WWW
2008
ACM
15 years 10 months ago
Tag-based social interest discovery
The success and popularity of social network systems, such as del.icio.us, Facebook, MySpace, and YouTube, have generated many interesting and challenging problems to the research...
Xin Li, Lei Guo, Yihong Eric Zhao
WWW
2003
ACM
15 years 10 months ago
Monitoring the dynamic web to respond to continuous queries
Continuous queries are queries for which responses given to users must be continuously updated, as the sources of interest get updated. Such queries occur, for instance, during on...
Sandeep Pandey, Krithi Ramamritham, Soumen Chakrab...
155
Voted
VLDB
2008
ACM
147views Database» more  VLDB 2008»
15 years 9 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
15 years 9 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
90
Voted
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
15 years 9 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang