Indexing XML data with a schema graph

被引:0
作者
Luoma, O [1 ]
机构
[1] Turku Univ, Dept Informat Technol, FIN-20520 Turku, Finland
来源
Proceedings of the IASTED International Conference on Databases and Applications | 2004年
关键词
XML; XML indexing; schema tree; schema graph;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
I introduce a novel concept of schema graph, which can be used to index XML data. I also describe Xeek, a prototype system based on a relational database, which utilizes my innovation. As in many other methods, the basic idea of Xeek is to decompose the documents into element, attribute, and text nodes, which then are stored into element, attribute, and text relations, respectively. The database schema of Xeek is fixed, so it is possible to store all kinds of XML documents without any prior information about document DTDs. Because Xeek summarizes document structures using a schema graph rather than a schema tree. it is very efficient when querying documents based on their structure. The results of performance studies demonstrate the effectiveness of my method.
引用
收藏
页码:274 / 279
页数:6
相关论文
共 17 条
[1]  
BOSAK J, COMPLETE PLAYS SHAKE
[2]  
BREMER JM, 2003, CSE200304 U CAL DEP
[3]  
BUSSE R, XMARK XML BENCHMARK
[4]  
CERI S, 2000, P 7 INT C EXT DAT TE
[5]  
Christophides V., 1994, SIGMOD Record, V23, P313, DOI 10.1145/191843.191901
[6]  
DIETZ PF, 1982, P 14 ANN ACM S THEOR, P122, DOI DOI 10.1145/800070.802184
[7]  
FLORESCU D, 1999, 3680 INRIA RENN FRAN
[8]  
Goldman R, 1997, PROCEEDINGS OF THE TWENTY-THIRD INTERNATIONAL CONFERENCE ON VERY LARGE DATABASES, P436
[9]  
Jiang H, 2002, P 13 AUSTR DAT C, P85
[10]  
KHA DD, 2001, P 17 IEEE INT C DAT, P212