By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Scheffner, D. ; Dept. of Comput. Sci., Humboldt-Univ., Berlin, Germany ; Freytag, J.-C.

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.

Published in:

Scientific and Statistical Database Management, 2002. Proceedings. 14th International Conference on

Date of Conference:

2002