Sciweavers

911 search results - page 43 / 183
» On the Distance of Databases
Sort
View
SSD
1995
Springer
97views Database» more  SSD 1995»
13 years 11 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet
ISM
2006
IEEE
207views Multimedia» more  ISM 2006»
13 years 7 months ago
Affinity Hybrid Tree: An Indexing Technique for Content-Based Image Retrieval in Multimedia Databases
A novel indexing and access method, called Affinity Hybrid Tree (AH-Tree), is proposed to organize large image data sets efficiently and to support popular image access mechanisms...
Kasturi Chatterjee, Shu-Ching Chen
ICDE
2006
IEEE
239views Database» more  ICDE 2006»
14 years 1 months ago
Grid Representation for Efficient Similarity Search in Time Series Databases
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
Guifang Duan, Yu Suzuki, Kyoji Kawagoe
EDBT
2004
ACM
126views Database» more  EDBT 2004»
14 years 7 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,...
BMCBI
2010
151views more  BMCBI 2010»
13 years 7 months ago
Using diffusion distances for flexible molecular shape comparison
Background: Many molecules are flexible and undergo significant shape deformation as part of their function, and yet most existing molecular shape comparison (MSC) methods treat t...
Yu-Shen Liu, Qi Li, Guo-Qin Zheng, Karthik Ramani,...