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

Authors:
Xianmin Liu;Jianzhong Li;Hongzhi Wang
Affiliations:
Harbin Institute of Technology, Heilongjiang, China;Harbin Institute of Technology, Heilongjiang, China;Harbin Institute of Technology, Heilongjiang, China
Venue:
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Year:
2007

Citing 9
Cited 1

Three partition refinement algorithms

SIAM Journal on Computing
Covering indexes for branching path queries

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Optimizing Regular Path Expressions Using Graph Schemas

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
D(k)-index: an adaptive structural summary for graph-structured data

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient processing of XML path queries using the disk-based F&B Index

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Covering indexes for XML queries: bisimulation - simulation = negation

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

Linear computation of the maximum simultaneous forward and backward bisimulation for node-labeled trees

XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies

Quantified Score

Hi-index	0.00

Visualization

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.