Sciweavers

707 search results - page 117 / 142
» Processing queries on tree-structured data efficiently
Sort
View
VLDB
2004
ACM
125views Database» more  VLDB 2004»
14 years 2 months ago
Reverse kNN Search in Arbitrary Dimensionality
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
Yufei Tao, Dimitris Papadias, Xiang Lian
PAMI
2008
216views more  PAMI 2008»
13 years 8 months ago
Annotating Images by Mining Image Search Results
Although it has been studied for years by the computer vision and machine learning communities, image annotation is still far from practical. In this paper, we propose a novel atte...
Xin-Jing Wang, Lei Zhang 0001, Xirong Li, Wei-Ying...
BMCBI
2007
177views more  BMCBI 2007»
13 years 8 months ago
The BioPrompt-box: an ontology-based clustering tool for searching in biological databases
Background: High-throughput molecular biology provides new data at an incredible rate, so that the increase in the size of biological databanks is enormous and very rapid. This sc...
Claudio Corsi, Paolo Ferragina, Roberto Marangoni
SSDBM
1999
IEEE
140views Database» more  SSDBM 1999»
14 years 28 days ago
An Infrastructure for Scalable Parallel Multidimensional Analysis
Multidimensional Analysis in On-Line Analytical Processing (OLAP), and Scientific and statistical databases (SSDB) use operations requiring summary information on multi-dimensiona...
Sanjay Goil, Alok N. Choudhary
SIGMOD
2007
ACM
121views Database» more  SIGMOD 2007»
14 years 8 months ago
Execution strategies for SQL subqueries
Optimizing SQL subqueries has been an active area in database research and the database industry throughout the last decades. Previous work has already identified some approaches ...
César A. Galindo-Legaria, Milind Joshi, Mos...