Sciweavers

360 search results - page 22 / 72
» Indexing the Distance: An Efficient Method to KNN Processing
Sort
View
IS
2007
13 years 7 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 5 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
ICIP
2007
IEEE
14 years 9 months ago
A New Descriptor for 2D Depth Image Indexing and 3D Model Retrieval
We present here a new descriptor for depth images adapted to 2D/3D model matching and retrieving. We propose a representation of a 3D model by 20 depth images rendered from the ve...
Mohamed Chaouch, Anne Verroust-Blondet
BTW
2003
Springer
94views Database» more  BTW 2003»
14 years 23 days ago
The Paradigm of Relational Indexing: a Survey
Abstract: In order to achieve efficient execution plans for queries comprising userdefined data types and predicates, the database system has to be provided with appropriate index ...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
PODS
2005
ACM
127views Database» more  PODS 2005»
14 years 7 months ago
FTW: fast similarity search under the time warping distance
Time-series data naturally arise in countless domains, such as meteorology, astrophysics, geology, multimedia, and economics. Similarity search is very popular, and DTW (Dynamic T...
Yasushi Sakurai, Masatoshi Yoshikawa, Christos Fal...