Sciweavers

Share
154 search results - page 1 / 31
» Space efficient dynamic stabbing with fast queries
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
11 years 4 days ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
ICDE
2005
IEEE
173views Database» more  ICDE 2005»
11 years 1 months ago
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; th...
Xuemin Lin, Yidong Yuan, Wei Wang 0011, Hongjun Lu
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
11 years 1 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
ICASSP
2008
IEEE
10 years 6 months ago
Fast query by example of environmental sounds via robust and efficient cluster-based indexing
There has been much recent progress in the technical infrastructure necessary to continuously characterize and archive all sounds, or more precisely auditory streams, that occur w...
Jiachen Xue, Gordon Wichern, Harvey D. Thornburg, ...
DAWAK
2004
Springer
10 years 3 months ago
Space-Efficient Range-Sum Queries in OLAP
Abstract. In this paper, we present a fast algorithm to answer rangesum queries in OLAP data cubes. Our algorithm supports constanttime queries while maintaining sub-linear time up...
Fredrik Bengtsson, Jingsen Chen
books