%0 Conference Paper %1 conf/dasfaa/JampaniP05 %A Jampani, Ravindranath %A Pudi, Vikram %B DASFAA %D 2005 %E Zhou, Lizhu %E Ooi, Beng Chin %E Meng, Xiaofeng %I Springer %K dblp %P 761-772 %T Using Prefix-Trees for Efficiently Computing Set Joins. %U http://dblp.uni-trier.de/db/conf/dasfaa/dasfaa2005.html#JampaniP05 %V 3453 %@ 3-540-25334-3

@inproceedings{conf/dasfaa/JampaniP05, added-at = {2023-09-30T00:00:00.000+0200}, author = {Jampani, Ravindranath and Pudi, Vikram}, biburl = {https://www.bibsonomy.org/bibtex/222fdc08c329dbc9555310adb66b1d377/dblp}, booktitle = {DASFAA}, crossref = {conf/dasfaa/2005}, editor = {Zhou, Lizhu and Ooi, Beng Chin and Meng, Xiaofeng}, ee = {https://doi.org/10.1007/11408079_69}, interhash = {a6e442831fd1e20b9f71ae24b99d4934}, intrahash = {22fdc08c329dbc9555310adb66b1d377}, isbn = {3-540-25334-3}, keywords = {dblp}, pages = {761-772}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T04:53:17.000+0200}, title = {Using Prefix-Trees for Efficiently Computing Set Joins.}, url = {http://dblp.uni-trier.de/db/conf/dasfaa/dasfaa2005.html#JampaniP05}, volume = 3453, year = 2005 }