Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 conf/icde/AugstenBBP10
%A Augsten, Nikolaus
%A Barbosa, Denilson
%A Böhlen, Michael H.
%A Palpanas, Themis
%B ICDE
%D 2010
%E Li, Feifei
%E Moro, Mirella M.
%E Ghandeharizadeh, Shahram
%E Haritsa, Jayant R.
%E Weikum, Gerhard
%E Carey, Michael J.
%E Casati, Fabio
%E Chang, Edward Y.
%E Manolescu, Ioana
%E Mehrotra, Sharad
%E Dayal, Umeshwar
%E Tsotras, Vassilis J.
%I IEEE Computer Society
%K dblp
%P 353-364
%T TASM: Top-k Approximate Subtree Matching.
%U http://dblp.uni-trier.de/db/conf/icde/icde2010.html#AugstenBBP10
%@ 978-1-4244-5444-0
@inproceedings{conf/icde/AugstenBBP10,
added-at = {2023-03-24T00:00:00.000+0100},
author = {Augsten, Nikolaus and Barbosa, Denilson and Böhlen, Michael H. and Palpanas, Themis},
biburl = {https://www.bibsonomy.org/bibtex/2573322a52ae0f461d70cb0832371e778/dblp},
booktitle = {ICDE},
crossref = {conf/icde/2010},
editor = {Li, Feifei and Moro, Mirella M. and Ghandeharizadeh, Shahram and Haritsa, Jayant R. and Weikum, Gerhard and Carey, Michael J. and Casati, Fabio and Chang, Edward Y. and Manolescu, Ioana and Mehrotra, Sharad and Dayal, Umeshwar and Tsotras, Vassilis J.},
ee = {https://doi.ieeecomputersociety.org/10.1109/ICDE.2010.5447905},
interhash = {5d8fc8a704b26656928c0875a463aab3},
intrahash = {573322a52ae0f461d70cb0832371e778},
isbn = {978-1-4244-5444-0},
keywords = {dblp},
pages = {353-364},
publisher = {IEEE Computer Society},
timestamp = {2024-04-10T18:37:38.000+0200},
title = {TASM: Top-k Approximate Subtree Matching.},
url = {http://dblp.uni-trier.de/db/conf/icde/icde2010.html#AugstenBBP10},
year = 2010
}