DTD-Based XML Indexing

Lu Yan; Zhang Liang; Duan Qiyang; Shi Baile

Journal of Computer Research and Development > 2005 > 42(1): 30-37.

Lu Yan, Zhang Liang, Duan Qiyang, Shi Baile. DTD-Based XML Indexing[J]. Journal of Computer Research and Development, 2005, 42(1): 30-37.

Citation:

Lu Yan, Zhang Liang, Duan Qiyang, Shi Baile. DTD-Based XML Indexing[J]. Journal of Computer Research and Development, 2005, 42(1): 30-37.

Citation:

Lu Yan, Zhang Liang, Duan Qiyang, Shi Baile. DTD-Based XML Indexing[J]. Journal of Computer Research and Development, 2005, 42(1): 30-37.

PDF (428 KB)

DTD-Based XML Indexing

1(School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001) 2(College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao 266510) 3(Department of Computing and Information Technology, Fudan University, Shanghai 200433)

More Information

Published Date: January 14, 2005

Graphical Abstract

Abstract

Abstract

Path expression is a common feature of XML query languages. Many indexing methods have been proposed. DTD can be of great help in XML indexing, but most techniques available now are generic to XML documents that are completely schema-less. Proposed in this paper is DBXI, a new method that takes advantage of information embedded in DTD for speeding up the process of XML path query. DBXI adopts a new coding scheme. With the help of DBXI, a path expression with N elements/attributes and one predicate restriction needs only zero or one structural join operations per XML document. For a path expression that does not match with any paths in XML documents, DBXI can give a judgment of no answer in much shorter time than those of indexing methods in existence. Experimental results demonstrate that DBXI can process path queries faster than Lore, SphinX and XISS do.
- XML,
- DTD,
- path expression,
- indexing

FullText(HTML)

References (0)

[1]	Zhou Peng, Wu Yanjun, Zhao Chen. A Programming Paradigm Combining Programmer and Neural Network to Promote Automated Program Generation[J]. Journal of Computer Research and Development, 2021, 58(3): 638-650. DOI: 10.7544/issn1000-1239.2021.20200298
[2]	Dai Wangzhou, Zhou Zhihua. A Survey on Inductive Logic Programming[J]. Journal of Computer Research and Development, 2019, 56(1): 138-154. DOI: 10.7544/issn1000-1239.2019.20180759
[3]	Chen Donghuo, Liu Quan, Jin Haidong, Zhu Fei, Wang Hui. A Temporal Logic with a Semantics Defined on the Static Structure and Dynamic Behavior of Program[J]. Journal of Computer Research and Development, 2016, 53(9): 2067-2084. DOI: 10.7544/issn1000-1239.2016.20150370
[4]	Duan Zhao, Tian Cong, Duan Zhenhua. CEGAR Based Null-Pointer Dereference Checking in C Programs[J]. Journal of Computer Research and Development, 2016, 53(1): 155-164. DOI: 10.7544/issn1000-1239.2016.20150669
[5]	Zhang Zhitian, Li Zhaopeng, Chen Yiyun, and Liu Gang. An Automatic Program Verifier for PointerC: Design and Implementation[J]. Journal of Computer Research and Development, 2013, 50(5): 1044-1054.
[6]	Chen Qiaoqiao, Li Bixin, and Ji Shunhui. A Modeling and Verification Method of CPS Based on Differential-Algebraic Dynamic Logic[J]. Journal of Computer Research and Development, 2013, 50(4): 700-710.
[7]	Wang Changjing. Verifying the Correctness of Loop Optimization Based on Extended Logic Transformation System μTS[J]. Journal of Computer Research and Development, 2012, 49(9): 1863-1873.
[8]	Ma Peijun, Wang Tiantian, and Su Xiaohong. Automatic Grading of Student Programs Based on Program Understanding[J]. Journal of Computer Research and Development, 2009, 46(7): 1136-1142.
[9]	Lin Jiao, Chen Wenguang, Li Qiang, Zheng Weimin, Zhang Yimin. A New Data Clustering Algorithm for Parallel Whole-Genome Shotgun Sequence Assembly[J]. Journal of Computer Research and Development, 2006, 43(8): 1323-1329.
[10]	Sui Aina, Wu Wei, Chen Xiaowu, Zhao Qinping. A Assembly Constraint Semantic Model in Distributed Virtual Environment[J]. Journal of Computer Research and Development, 2006, 43(3): 542-550.