66 search results - page 1 / 14 » Dynamic indexability and lower bounds for dynamic one-dimens... |
PODS
2009
ACM
14 years 5 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
Abstract. Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive distance measures can, however, be compu...
PDP
2006
IEEE
13 years 11 months ago
2006
IEEE
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of dynamically indexing temporal observations about a collection of objects, each observation consisting of a key identifying the object, a list of attribu...
DEXA
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. In this paper we examine the problem of indexing time sequences in order to answer inverse queries. An inverse query computes all the time points at which the sequence co...