Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Faster Dynamic Compressed d-ary Relations   The $k^2$-tree is a successful compact representation of binary relations
that exhibit sparseness and/or clustering properties. It can be extended to $d$
dimensions, where it is called a $k^d$-tree. The representation boils down to a
long bitvector. We show that interpreting the $k^d$-tree as a dynamic trie on
the Morton codes of the points, instead of as a dynamic representation of the
bitvector as done in previous work, yields operation times that are below the
lower bound of dynamic bitvectors and offers improved time performance in
practice.

30
The categories of this paper are: q-alg
21
The categories of this paper are: adap-org
9
The categories of this paper are: nlin
2
The categories of this paper are: math
17
The categories of this paper are: q-fin
27
The categories of this paper are: comp-gas
20
The categories of this paper are: acc-phys
34
The categories of this paper are: chem-ph
23
The categories of this paper are: solv-int
26
The categories of this paper are: bayes-an
14
The categories of this paper are: math-ph
19
The categories of this paper are: eess
28
The categories of this paper are: alg-geom
35
The categories of this paper are: mtrl-th
4
The categories of this paper are: cond-mat
29
The categories of this paper are: funct-an