958 search results - page 10 / 192 » Efficient data structures for range-aggregate queries on tre... |
SIAMCOMP
2012
11 years 9 months ago
2012
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
CIKM
2006
Springer
13 years 9 months ago
2006
Springer
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...