Signature path dictionary for nested object query processing

Abstract

Predicate evaluation and object traversal are two critical issues for nested object query processing. Aiming at these two issues, we introduce a new method, the signature path dictionary, which combines signature techniques with the path dictionary organization designed for fast object traversals. We derive cost formulae for its storage overhead as well as the retrieval and update costs. Comparing to a previously proposed indexing organization, path signature, the signature path dictionary is superior in all aspects.