611 search results - page 100 / 123 » Querying Tree-Structured Data Using Dimension Graphs |
166
click to vote
WADS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
164
click to vote
SPLC
2000
15 years 3 months ago
2000
The evolution tree model is a two-dimensional model that describes how the versions of the artifacts of a software product evolve. The propagation graph is a data structure that c...
144
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
96
Voted
VLDB
2002
ACM
15 years 1 months ago
2002
ACM
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
144
click to vote
EDBT
2000
ACM
15 years 6 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...