.png){kind=icon}
返回
An efficient index structure for XML based on generalized suffix tree
.png){kind=icon}
PRE
AI
DOI：10.1016/j.is.2005.10.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (c) 2005 Elsevier B.V. All rights reserved.
Keyword:
XML
information retrieval
generalized suffix tree (GST)
path index based on generalized suffix tree (PIGST)
query processing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
2.8K
被引数:
1.8K
机构
暂无机构信息
引用论文
Cell lineage-specific genome-wide DNA methylation analysis of patients with paediatric-onset systemic lupus erythematosus.png)
Epigenetics
OAAI
EpigeneticsIF0
OAAI分享收藏
Design and management considerations towards productively sustainable work places in Saudi Arabia
PREAI
分享收藏In vivo assembly and large-scale purification of a GPCR - Gα fusion with Gβγ, and characterization of the active complexPLOS ONEOAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容