XJoin index: Indexing XML data for efficient handling of branching path expressions

Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICDE.2004.1320059

Title:	XJoin index: Indexing XML data for efficient handling of branching path expressions
Authors:	Bertino, E. Catania, B. Wang, W.Q.
Issue Date:	2004
Citation:	Bertino, E., Catania, B., Wang, W.Q. (2004). XJoin index: Indexing XML data for efficient handling of branching path expressions. Proceedings - International Conference on Data Engineering 20 : 828-. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDE.2004.1320059
Abstract:	The problem of indexing XML data for solving branching path expressions with a technique called XJoin Index was discussed. XJoin Index, precomputes some structural join results thus reducing the number of joins to be computed. XJoin Index support various operations which includes attribute selections, detection of parant-child relationships and counting selections. XJoin Index is entirely based on B + trees and can be coupled with any structural join algorithm .
Source Title:	Proceedings - International Conference on Data Engineering
URI:	http://scholarbank.nus.edu.sg/handle/10635/42176
DOI:	10.1109/ICDE.2004.1320059
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check