By Topic

Highly efficient processing of XML path/twig queries using Index Caches

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

4 Author(s)
Shichuan Li ; Key Lab. of High Confidence Software Technol., Peking Univ., Beijing, China ; Dongqing Yang ; Tengjiao Wang ; Yue Wang

XML has been becoming the de facto standard for data exchange on the World Wide Web. Now, while XML data files are become more, people have developed a variety of storage methods of the XML file, such as the use of relational databases, native XML databases, and so on. Meanwhile, people have a higher demand on the technology to efficient processing of large XML data sets, now the main direction of research is XML index technology, on the one hand, the twig matching process is more important. Many researchers have done a lot of research in this area. This paper proposed an XML Index Cache designed to improve the efficiency of matching XML indexes, including the simple path matching and twig matching. This paper also presents the structure of XML Index Cache technology and related algorithms. Finally, we do the experiments in CoSQL RX 1.0 that is dual engine database system which was independently developed by the laboratory of Peking University.

Published in:

Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on

Date of Conference:

29-31 May 2012