Sciweavers

2514 search results - page 24 / 503
» On the Computation of Approximations of Database Queries
Sort
View
BMCBI
2008
123views more  BMCBI 2008»
15 years 6 months ago
Shape based indexing for faster search of RNA family databases
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
Stefan Janssen, Jens Reeder, Robert Giegerich
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
13 years 8 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
VLDB
2005
ACM
129views Database» more  VLDB 2005»
15 years 11 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
SSD
2005
Springer
108views Database» more  SSD 2005»
15 years 11 months ago
On Trip Planning Queries in Spatial Databases
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
Feifei Li, Dihan Cheng, Marios Hadjieleftheriou, G...
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
16 years 7 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...