Sciweavers

1923 search results - page 59 / 385
» Ranking in Spatial Databases
Sort
View
SSD
2009
Springer
127views Database» more  SSD 2009»
14 years 12 days ago
Incremental Reverse Nearest Neighbor Ranking in Vector Spaces
In this paper, we formalize the novel concept of incremental reverse nearest neighbor ranking and suggest an original solution for this problem. We propose an efficient approach f...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
SIGIR
1999
ACM
14 years 5 days ago
Comparing the Performance of Database Selection Algorithms
Abstract We compare the performance of two database selection algorithms reported in the literature. Their performance is compared using a common testbed designed specifically for ...
James C. French, Allison L. Powell, James P. Calla...
TKDE
1998
184views more  TKDE 1998»
13 years 7 months ago
Supporting Ranked Boolean Similarity Queries in MARS
To address the emerging needs of applications that require access to and retrieval of multimedia objects, we are developing the Multimedia Analysis and Retrieval System (MARS) 29]...
Michael Ortega, Yong Rui, Kaushik Chakrabarti, Kri...
ICDE
2010
IEEE
157views Database» more  ICDE 2010»
13 years 8 months ago
Subspace similarity search using the ideas of ranking and top-k retrieval
— There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, onl...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...
KDD
2004
ACM
157views Data Mining» more  KDD 2004»
14 years 1 months ago
Fast mining of spatial collocations
Spatial collocation patterns associate the co-existence of nonspatial features in a spatial neighborhood. An example of such a pattern can associate contaminated water reservoirs ...
Xin Zhang, Nikos Mamoulis, David W. Cheung, Yutao ...