Sciweavers

54 search results - page 4 / 11
» Answering approximate string queries on large data sets usin...
Sort
View
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 5 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
14 years 5 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
IMC
2005
ACM
13 years 11 months ago
Improving Sketch Reconstruction Accuracy Using Linear Least Squares Method
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...
Gene Moo Lee, Huiya Liu, Young Yoon, Yin Zhang
ICDE
2005
IEEE
115views Database» more  ICDE 2005»
14 years 6 months ago
Snapshot Queries: Towards Data-Centric Sensor Networks
In this paper we introduce the idea of snapshot queries for energy efficient data acquisition in sensor networks. Network nodes generate models of their surrounding environment th...
Yannis Kotidis
ICDE
2002
IEEE
209views Database» more  ICDE 2002»
14 years 6 months ago
Geometric-Similarity Retrieval in Large Image Bases
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...
Ioannis Fudos, Leonidas Palios, Evaggelia Pitoura