Sciweavers

325 search results - page 39 / 65
» Group Nearest Neighbor Queries
Sort
View
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
14 years 11 months ago
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
Bernd-Uwe Pagel, Flip Korn, Christos Faloutsos
VLDB
2007
ACM
169views Database» more  VLDB 2007»
14 years 10 months ago
Peer-to-Peer Similarity Search in Metric Spaces
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
Christos Doulkeridis, Akrivi Vlachou, Yannis Kotid...
EDBT
2004
ACM
126views Database» more  EDBT 2004»
14 years 10 months ago
Spatial Queries in the Presence of Obstacles
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis,...
ICDE
2005
IEEE
146views Database» more  ICDE 2005»
14 years 3 months ago
Best Effort Query Processing in DHT-based P2P Systems
Structured P2P systems in the form of distributed hash tables (DHT) are a promising approach for building massively distributed data management platforms. However, for many applic...
Philipp Rösch, Kai-Uwe Sattler, Christian von...
SSD
2005
Springer
175views Database» more  SSD 2005»
14 years 3 months ago
Probabilistic Spatial Queries on Existentially Uncertain Data
We study the problem of answering spatial queries in databases where objects exist with some uncertainty and they are associated with an existential probability. The goal of a thre...
Xiangyuan Dai, Man Lung Yiu, Nikos Mamoulis, Yufei...