SAM: An efficient algorithm for F&B-index construction

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Author supplied keywords

Cite

CITATION STYLE

APA

Liu, X., Li, J., & Wang, H. (2007). SAM: An efficient algorithm for F&B-index construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4505 LNCS, pp. 697–708). Springer Verlag. https://doi.org/10.1007/978-3-540-72524-4_72

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free