Paper Info
Title
An Efficient Structural Index for Branching Path Queries
Abstract
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.
Year
DOI
Venue
2008
10.1109/WAIM.2008.23
WAIM
Keywords
Field
DocType
xml data graph,important role,query optimization,semi-structured data,query performance,efficient structural index,branching path queries,structural index,construction time,adaptive structural index,simple path,inter-relevant successive trees,directed graphs,indexation,tree graphs,construction industry,mathematical model,information technology,information management,semi structured data,database indexing,equivalence relation,technology management,indexing,data models,xml,indexes,data structures,merging
Query optimization,Data mining,Data structure,Equivalence relation,Tree (graph theory),Path (graph theory),XML,Computer science,Directed graph,Database index
Conference
Citations 
PageRank 
References 
0
0.34
6
Authors
5
Name
Order
Citations
PageRank
Yingjie Fan192.22
Shuyun Wang2173.39
Zhang Chenghong3227.07
Haibing Ma421.08
Yunfa Hu57413.44