AxPRE summaries: Exploring the (semi-)structure of XML web collections

被引:5
作者
Consens, Mariano P. [1 ]
Rizzolo, Flavio [1 ]
Vaisman, Alejandro A. [2 ]
机构
[1] Univ Toronto, Toronto, ON M5S 1A1, Canada
[2] Univ Buenos Aires, RA-1053 Buenos Aires, DF, Argentina
来源
2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3 | 2008年
基金
加拿大自然科学与工程研究理事会;
关键词
D O I
10.1109/ICDE.2008.4497609
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper introduces AxPRE summaries, a formalism that allows exploring the (semi-)structure of large XML collections. AxPRE summaries are implemented in a tool, DescribeX, that supports visualizing XML collections via summaries that can be interactively refined using a powerful and descriptive axis path regular expression language. Experimental results on gigabyte collections have shown that this flexibility does not come at the expense of efficiency.
引用
收藏
页码:1519 / +
页数:2
相关论文
共 8 条
[1]  
ALI MS, 2008, ICDE
[2]  
Bex G.J., 2006, VLDB
[3]  
Consens M. P., 2007, XSYM
[4]  
CONSENS MP, 2007, EXPLORING SEMI STRUC
[5]   An efficient algorithm for computing bisimulation equivalence [J].
Dovier, A ;
Piazza, C ;
Policriti, A .
THEORETICAL COMPUTER SCIENCE, 2004, 311 (1-3) :221-256
[6]  
Nestorov S., 1997, ICDE
[7]   3 PARTITION REFINEMENT ALGORITHMS [J].
PAIGE, R ;
TARJAN, RE .
SIAM JOURNAL ON COMPUTING, 1987, 16 (06) :973-989
[8]  
*W3C, XPATH 2 0