Node Identification Schemes for Efficient XML Retrieval

Abstract

Node identifiers (IDs) encoding part of the tree structure in XML documents can save I/O for table look-ups,
thus speeding up the evaluation of path and tree queries on large persistent document collections. In
particular, binary tree relations such as the extended XPath axes can be either decided for a given pair of
node IDs, or reconstructed for a single node ID, without access to secondary storage. Several ID schemes have
been proposed so far, which differ with respect to (1) expressiveness, i.e. which relations can be
decided or reconstructed from IDs, (2) the runtime performance and asymptotic behaviour of decision and
reconstruction operations, (3) the storage overhead for the IDs, and (4) robustness, i.e. behaviour in the
presence of updates. First we review five ID schemes, positioning them in the trade-off between these four comparison
criteria. Then a new ID scheme called BIRD, for Balanced Index-based ID scheme for Reconstruction and
Decision, is introduced and illustrated throughout several examples of decision and reconstruction operations
on IDs. We argue that emphasizing runtime performance and expressive power, BIRDs strategy in the above
trade-off is best for many applications, especially where storage minimization is not the primary goal and
updates occur in a bulk-fashion rather than in realtime. Our experimental results on document collections of
up to one gigabyte prove BIRD to be most efficient in terms of expressiveness and runtime performance. Most
notably, BIRD is the only scheme to support both decision and reconstruction of many relations in constant
time. But also in terms of storage and robustness BIRD is highly competitive.