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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 275-281 |
| Number of pages | 7 |
| Journal | Conference Proceedings - International Phoenix Conference on Computers and Communications |
| State | Published - Jan 1 1996 |
| Event | Proceedings of the 1996 IEEE 15th Annual International Phoenix Conference on Computers and Communications - Scottsdale, AZ, USA Duration: Mar 27 1996 → Mar 29 1996 |
All Science Journal Classification (ASJC) codes
- General Computer Science