Source :
Proceedings of 2017 Tenth International Conference on Contemporary Computing ( IC3)
Descriptors :
XML indexing , B+ trees; Hashma , Binary search tree , linked lis , Red Black Tree
Abstract :
With the increasing volume of XML documents on
the Web,indexing, storing and retrieving these documents is of a
great concern. Indexing allows efficient access to XML document
parts. There are several methods proposed for indexing XML
documents. Generally, they are classified by the database
community and information retrieval community. This paper
presents a comparative study of different data structures to create
an efficient indexing of XML documents. The experiments were
conducted to evaluate the performance of the various index
structures in terms of the index construction time and the index
storage space.
Title of Article :
Performance Evaluation of Various Data Structures in Building Efficient
Indexing schemes for XML Documents
Author/Authors :
Dhanalekshmi G , Krishna Asawa
Author/Authors - جزئيات :
