Top-k-size keyword search on tree structured data
作者：
Highlights：
• Top-k-size keyword search over tree-structured data.
• Efficient multi-stack threshold and top-k algorithms exploiting a lattice of keyword partitions.
• The algorithms demonstrate linear time complexity and scale smoothly when the size of the dataset increases.
• The approach does not rely on auxiliary indices and can be used in streaming applications.
• Novel layered ranking semantics based on the concept of LCA size.
摘要
Highlights•Top-k-size keyword search over tree-structured data.•Efficient multi-stack threshold and top-k algorithms exploiting a lattice of keyword partitions.•The algorithms demonstrate linear time complexity and scale smoothly when the size of the dataset increases.•The approach does not rely on auxiliary indices and can be used in streaming applications.•Novel layered ranking semantics based on the concept of LCA size.
论文关键词：Keyword search,Tree-structured data,LCA,Search algorithm,Ranking
论文评审过程：Received 22 July 2013, Revised 14 March 2014, Accepted 14 July 2014, Available online 25 July 2014.
论文官网地址：https://doi.org/10.1016/j.is.2014.07.002
