A Kind Of XML Indexing Approaches Based On Bitcube

As the development of computer technology and network technology, the enterprises and individuals transferred more and more data by Internet. At the same time, the data of different users are stored in different formats, there are a lot of inconveniences in transference by Internet, and an accepted data format is needed to unify all the data transferred by Internet. Since XML1.0 standard was introduced by W3C in 1998, there has been great development in XML technology. And XML becomes an effective tool to describe and manage structure information under the network environment. XML, as a data format, is widely used in the fields of database and Internet transference, which is becoming the standard of data format in fact.At present, the researches of XML data storage and indexing are hot spots in the field of database study. Considering the prominent position of indexing technology in data management, much XML documents research also focus on the XML indexing technologies. How to capture the XML data structure characteristic and support the path inquiry processing is the core of XML indexing technology. Considering the difference in dealing the two flaws of XML basic inquiring way, XML indexing technology can be divided into two basic categories: structure-summary index and node-record index.This paper affords an effective way for building indexes on a large-scale XML database. It mends the constructing process of the primitive bitcube indexing, besides it adds the document tree having an orderly path-name table and keywords indexing table on the index. So it' s an efficient XML database indexing technique for both keywords query and path query (including incomplete path query). Adopt this indexing approach, users can do querying operations based on keyword complete path incomplete path and document to a XML database rapidly.The main works and achievements of this article are:Afford a kind of new XML indexing approach. Describe the data structure of the indexing approach, and afford a constructing arithmetic for this indexing approach.Discuss the maintenance problem of the affording indexing. And afford the maintenance arithmetic while adding a document or deleting a document.Afford the steps of querying a XML database, which adopting the affording indexes in this paper. The querying operations includes keyword query complete path query incomplete path query and document query.Improve that the affording index has high efficiency, not matter considering the constructing time but also the query operations.Applying the adopting index on XML database will satisfy many kinds of query needs and reduce the querying time. The affording indexes in this paper are especially useful for the frequent query operations on the steady XML databases, which having massive documents. The similar degree between the paths of documents is better, the effect is better.