Sciweavers

121 search results - page 17 / 25
» Anytime K-Nearest Neighbor Search for Database Applications
Sort
View
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 8 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
ISM
2006
IEEE
174views Multimedia» more  ISM 2006»
14 years 2 months ago
Fast Similarity Search for High-Dimensional Dataset
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
Quan Wang, Suya You
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 1 months 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 ...
GIS
2008
ACM
14 years 9 months ago
Monitoring continuous queries over streaming locations
We report on our experience from design and implementation of a powerful map application for managing, querying and visualizing evolving locations of moving objects. Instead of bu...
Kostas Patroumpas, Evi Kefallinou, Timos K. Sellis
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 10 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe