Abstract | ||
---|---|---|
Structural index, which acts as a structural summary, plays an important role in query optimization over XML and semi-structured data. To speed up branching path queries, we introduce the notion of k-l-bisimilarity into M(k)-index and propose an adaptive structural index, MBF(k, l)-index, which supports branching paths with any complexity efficiently and inherits the advantage of avoiding over-refinement from M(k)-index. Our experiments have shown that the index performs more efficiently in terms of space consumption and query performance for branching or simple paths in comparison with the same kind of indexes. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1109/ICIS.2008.47 | ACIS-ICIS |
Keywords | Field | DocType |
frequent branching path queries,important role,query optimization,space consumption,structural summary,semi-structured data,query performance,path query,structural index,adaptive index,simple path,adaptive structural index,data mining,database languages,information science,indexation,technology management,xml,directed graphs,data models,information technology,database indexing,semi structured data | Query optimization,Data mining,Data modeling,Query language,XML,Computer science,Directed graph,Theoretical computer science,Database index,Speedup,Branching (version control) | Conference |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
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 |