%0 Conference Paper %1 conf/icdt/KimelfeldS07 %A Kimelfeld, Benny %A Sagiv, Yehoshua %B ICDT %D 2007 %E Schwentick, Thomas %E Suciu, Dan %I Springer %K dblp %P 329-343 %T Combining Incompleteness and Ranking in Tree Queries. %U http://dblp.uni-trier.de/db/conf/icdt/icdt2007.html#KimelfeldS07 %V 4353 %@ 3-540-69269-X

@inproceedings{conf/icdt/KimelfeldS07, added-at = {2017-05-23T00:00:00.000+0200}, author = {Kimelfeld, Benny and Sagiv, Yehoshua}, biburl = {https://www.bibsonomy.org/bibtex/200a18bef77b6346350113c12465090c0/dblp}, booktitle = {ICDT}, crossref = {conf/icdt/2007}, editor = {Schwentick, Thomas and Suciu, Dan}, ee = {https://doi.org/10.1007/11965893_23}, interhash = {86df1a5b1e07e60051bbbb788fbdc19a}, intrahash = {00a18bef77b6346350113c12465090c0}, isbn = {3-540-69269-X}, keywords = {dblp}, pages = {329-343}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:08:37.000+0200}, title = {Combining Incompleteness and Ranking in Tree Queries.}, url = {http://dblp.uni-trier.de/db/conf/icdt/icdt2007.html#KimelfeldS07}, volume = 4353, year = 2007 }