We present a system for efficient indexed querying of XML documents, enhanced with sibling operations. R-tree index proposed in [5] has a very high cost for the following-sibling and precedingsibling axes. We develop a family of index structures, which we refer to as transformed split-tree indexes, to address this problem, in which (i) XML data is horizontally split by a simple, yet efficient c...

Example 1 (Mixture of K Poisson distributions). The sample spaces are X = Z+ := {0, 1, 2, . . . } = and Y = [K] := {1, 2, . . . ,K}. The parameter space is Θ = ∆K−1 × R++, where ∆K−1 := {π = (π1, π2, . . . , πK) ∈ R+ : ∑K j=1 πj = 1}, R+ := {t ∈ R : t ≥ 0}, and R++ := {t ∈ R : t > 0}. Each distribution Pθ in P = {Pθ : θ ∈ Θ} is as follows. If (X,Y ) ∼ Pθ for θ = (π, λ1, λ2, . . . , λK), then Y ...

We show how to associate an R-tree to the set of cut points of a continuum. If X is a continuum without cut points we show how to associate an R-tree to the set of cut pairs of X . AMS Classification 54F15,54F05,20F65,20E08