An efficient index structure for XML based on generalized suffix tree

  • Authors:

  • Liang Zuopeng;Hu Kongfa;Ye Ning;Dong Yisheng

  • Affiliations:

  • Department of Computer Science & Engineering, Southeast University, Nanjing 210096, China,;Institute of Information Technology, Yangzhou University, Yangzhou 225009, China;Department of Computer Science & Engineering, Southeast University, Nanjing 210096, China,;Department of Computer Science & Engineering, Southeast University, Nanjing 210096, China,

  • Venue:
  • Information Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A novel index structure based on the generalized suffix tree (PIGST) is proposed. Combined with post lists, PIGST can answer both structural and content queries. The distinct paths in an XML collection are mapped into strings. The construction algorithm of the PIGST for the path strings is presented based on the modification and improvement of a well-known suffix tree construction algorithm that only requires linear time and space complexity. The query process merely needs m character comparisons for direct containment queries, where m is the length of a query string. An efficient processing method for the indirect containment queries that avoids the inefficient tree traversal operation is also presented. Experiments show that PIGST outperforms earlier approaches.