%0 Conference Paper %1 sydow_2009_optimising %A Sydow, Marcin %A Bonchi, Francesco %A Castillo, Carlos %A Donato, Debora %B WSCD '09: Proceedings of the 2009 workshop on Web Search Click Data %C New York, NY, USA %D 2009 %I ACM %K queries %P 43--47 %R 10.1145/1507509.1507516 %T Optimising topical query decomposition %U http://dx.doi.org/10.1145/1507509.1507516 %X Topical query decomposition (TQD) is a paradigm recently introduced in 1, which, given a query, returns to the user a set of queries that cover the answer set of the original query. The TQD problem was studied as a variant of the set-cover problem and solved by means of a greedy algorithm. %@ 978-1-60558-434-8

@inproceedings{sydow_2009_optimising, abstract = {Topical query decomposition (TQD) is a paradigm recently introduced in [1], which, given a query, returns to the user a set of queries that cover the answer set of the original query. The TQD problem was studied as a variant of the set-cover problem and solved by means of a greedy algorithm.}, added-at = {2009-08-06T15:16:38.000+0200}, address = {New York, NY, USA}, author = {Sydow, Marcin and Bonchi, Francesco and Castillo, Carlos and Donato, Debora}, biburl = {https://www.bibsonomy.org/bibtex/228da646515f45f1228b97b4bc32ff072/chato}, booktitle = {WSCD '09: Proceedings of the 2009 workshop on Web Search Click Data}, citeulike-article-id = {4164886}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1507509.1507516}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1507509.1507516}, doi = {10.1145/1507509.1507516}, interhash = {7ccb6a2c32a0cf776364bdcee447c321}, intrahash = {28da646515f45f1228b97b4bc32ff072}, isbn = {978-1-60558-434-8}, keywords = {queries}, location = {Barcelona, Spain}, pages = {43--47}, posted-at = {2009-03-11 08:54:57}, priority = {0}, publisher = {ACM}, timestamp = {2009-08-06T15:16:42.000+0200}, title = {Optimising topical query decomposition}, url = {http://dx.doi.org/10.1145/1507509.1507516}, year = 2009 }