Top-k-size keyword search on tree structured data
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 ranking lca search algorithm