Sciweavers

360 search results - page 20 / 72
» Indexing the Distance: An Efficient Method to KNN Processing
Sort
View
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
14 years 7 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
DEXA
2003
Springer
193views Database» more  DEXA 2003»
14 years 23 days ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
VISAPP
2007
13 years 8 months ago
Texture based image indexing and retrieval
The Content Based Image Retrieval (CBIR) has been an active research area. Given a collection of images, it is to retrieve the images based on a query image, which is specified by...
N. Gnaneswara Rao, V. Vijaya Kumar
BTW
2005
Springer
108views Database» more  BTW 2005»
14 years 1 months ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...
CGF
2008
153views more  CGF 2008»
13 years 7 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm