Download now Free registration required
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexes as supporting data structures for this problem. In this paper, the authors investigate efficient update algorithms for structure indexes. They study two kinds of updates-the addition of a subgraph, intended to represent the addition of a new file to the database, and the addition of an edge, to represent a small incremental change.
- Format: PDF
- Size: 221 KB