Efficient Query Processing for XML Keyword Queries Based on the IDList Index
Keyword search over XML data has attracted a lot of research efforts in the last decade, where one of the fundamental research problems is how to efficiently answer a given keyword query w.r.t. a certain query semantics. The authors found that the key factor resulting in the inefficiency for existing methods is that they all heavily suffer from the common ancestor-repetition problem. In this paper, they propose a novel form of inverted list, namely the IDList; the IDList for keyword k consists of ordered nodes that directly or indirectly contain k.