Name
Abstract | ||
|---|---|---|
To speed up queries over XML and semi-structured data, a number of structural indexes have been proposed. The structural index is usually a labeled directed graph defined by partitioning nodes in the XML data graph into equivalence classes and storing equivalence classes as index nodes. On the basis of the Inter- Relevant Successive Trees (IRST), we propose an efficient adaptive structural index, IRST(k)-index. Compared with the previous indexes, such as the A(k)'-index, D(k)- index, and M(k)-index, our experiment results show that the IRST(k)-index performs more efficiently in terms of space consumption and query performance, while using significantly less construction time. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ICIS.2008.9 | ACIS-ICIS |
Keywords | Field | DocType |
structural summary,xml,storing equivalence class,xml datagraph,tree data structures,experiment result,previous index,database indexing,graph-structured data,structural index,xml data graph,query performance,efficient adaptive structural index,adaptive structural index,index node,equivalence classes,construction time,partitioning node,graph theory,efficient structural index,equivalence relation,inter-relevant successive trees,indexation,directed graph,structured data,indexing,semi structured data,mathematical model,tree graphs,data mining,information science,technology management,information technology | Graph theory,Data mining,Discrete mathematics,Equivalence relation,Tree (graph theory),Computer science,Tree (data structure),Search engine indexing,Directed graph,Equivalence class,Database index | Conference |
ISBN | Citations | PageRank |
978-0-7695-3131-1 | 0 | 0.34 |
References | Authors | |
6 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yingjie Fan | 1 | 9 | 2.22 |
| Chenghong Zhang | 2 | 116 | 18.03 |
| Shuyun Wang | 3 | 17 | 3.39 |
| Xiulan Hao | 4 | 22 | 3.91 |
| Yunfa Hu | 5 | 74 | 13.44 |