A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Efficient keyword search on large tree structured datasets
2012
Proceedings of the Third International Workshop on Keyword Search on Structured Data - KEYS '12
Keyword search is the most popular paradigm for querying XML data on the web. In this context, three challenging problems are (a) to avoid missing useful results in the answer set, (b) to rank the results with respect to some relevance criterion and (c) to design algorithms that can efficiently compute the results on large datasets. In this paper, we present a novel multi-stack based algorithm that returns as an answer to a keyword query all the results ranked on their size. Our algorithm
doi:10.1145/2254736.2254749
dblp:conf/sigmod/DimitriouT12
fatcat:fmpw7dhwcjds7eg2uksfcrna5q