Back to Search
Start Over
SAM: An Efficient Algorithm for F&B-Index Construction.
- Source :
- Advances in Data & Web Management; 2007, p697-708, 12p
- Publication Year :
- 2007
-
Abstract
- Using index to process structural queries on XML data is a natural way. F&B-Index has been proven to be the smallest index which covers all branching path queries. One disadvantage which prevents the wide usage of F&B-Index is that its construction requires lots of time and very large main memory. However, few works focus on this problem. In this paper, we propose an effective and efficient F&B-Index construction algorithm, SAM, for DAG-structured XML data. By maintaining only a small part of index, SAM can save required space of construction. Avoiding complex computation of the selection of nodes to process, SAM takes less time cost than existing algorithms. Theoretical analysis and experimental results show that SAM is correct, effective and efficient. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783540724834
- Database :
- Supplemental Index
- Journal :
- Advances in Data & Web Management
- Publication Type :
- Book
- Accession number :
- 33198390
- Full Text :
- https://doi.org/10.1007/978-3-540-72524-4_72