An Efficient Structural Index for Branching Path Queries
Structural index, which acts as a schema, plays an important role in query optimization over XML and semi-structured data. On the basis of the Inter-Relevant Successive Trees (IRST), we extend IRST to the XML data graph, introduce the new equivalence relation of k-l-similarity, and propose IRST(k, l)-index, an adaptive structural index that can support branching or simple path queries efficiently. Compared with the same kind of indexes, our experiments show that IRST(k, l)-index performs more efficiently in terms of space consumption and query performance for branching or simple paths, while using significantly less construction time.
XML Semi-structured data branching path query IRST Structural index
Yingjie Fan Shuyun Wang Chenghong Zhang Haibing Ma Yunfa Hu
Department of Computing and Information Technology,Fudan University,Shanghai,200433 School of Management,Fudan University,Shanghai,200433
国际会议
The Ninth International Conference on Web-Age Information Management(第九届web时代信息管理国际会议)(WAIM 2008)
张家界
英文
2008-07-20(万方平台首次上网日期,不代表论文的发表时间)