With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. This poses a new challenge concerning indexing and searching XML data, because conventional approaches based on relational model may not meet the processing requirements for XML data. In this paper, a path index based on Patricia-tries is proposed, namely PT index. The PT index structure offers several novel features. First, the index can support to fast search data by its structure based on Patricia-tries. Second, the path indexes are compressed so that PT index can be stored in memory. Thirdly, because PT index includes structure and text of XML data, the results can be got form the PT index without reading original XML data from disk. The time complexity and space complexity of PT index further analyze. Experimental results from the prototype system implementation show that the PT index can outperform some representative index approaches include DataGuide, B+tree index and Index Fabric.
|Number of pages||11|
|Journal||Journal of Computational Information Systems|
|Publication status||Published - Feb 1 2007|
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications