首页> 外文会议>International Conference on Scientific and Statistical Database Management >Access Support Tree and TextArray: a data structure for XML document storage and retrieval
【24h】

Access Support Tree and TextArray: a data structure for XML document storage and retrieval

机译:访问支持树和TextArray:XML文档存储和检索的数据结构

获取原文

摘要

The characteristics of XML documents require new ways of storing and querying such documents. Queries on both textual content and structural aspects must be supported efficiently. For this reason, we examined existing work on both document storage approaches and models for querying documents to derive requirements that are essential for the storage of XML documents. As a result of our study, we designed the Access Support Tree and TextArray (AST/TA) data structure. The important idea of the AST/TA data structure is the separation of the (logical) structure of a document from its "visible" text content. The latter is represented as a single contiguous string. At the same time the AST/TA data structure provides a tight integration to guarantee consistent changes. We introduce the AST/TA data structure formally by, its abstraction, namely the AST/TA model and compare requirements of our AST/TA approach with those found in the current literature. Finally, we describe the advantage of the AST/TA model based on the AST/TA design principles.
机译:XML文档的特征需要新的存储和查询此类文档。必须有效地支持对文本内容和结构方面的查询。因此,我们在文档存储方法和模型上检查了查询文档的型号,以导出XML文档存储至关重要的要求。由于我们的研究,我们设计了访问支持树和TextArray(AST / TA)数据结构。 AST / TA数据结构的重要思想是从其“可见”文本内容中的(逻辑)结构的分离。后者表示为单个连续串。同时,AST / TA数据结构提供了紧密的集成,以保证一致的变化。我们通过其抽象,即AST / TA模型正式地介绍了AST / TA数据结构,并与当前文献中发现的人进行了比较我们的AST / TA方法的要求。最后,我们根据AST / TA设计原理描述AST / TA模型的优势。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号