An Efficient Service Discovery Algorithm for Counting Bloom Filter-Based Service Registry

Shuxing Cheng, Carl K. Chang, Liang-Jie Zhang. An Efficient Service Discovery Algorithm for Counting Bloom Filter-Based Service Registry. In IEEE International Conference on Web Services, ICWS 2009, Los Angeles, CA, USA, 6-10 July 2009. pages 157-164, IEEE, 2009. [doi]

@inproceedings{ChengCZ09,
  title = {An Efficient Service Discovery Algorithm for Counting Bloom Filter-Based Service Registry},
  author = {Shuxing Cheng and Carl K. Chang and Liang-Jie Zhang},
  year = {2009},
  doi = {10.1109/ICWS.2009.121},
  url = {http://dx.doi.org/10.1109/ICWS.2009.121},
  tags = {rule-based, discovery},
  researchr = {https://researchr.org/publication/ChengCZ09},
  cites = {0},
  citedby = {0},
  pages = {157-164},
  booktitle = {IEEE International Conference on Web Services, ICWS 2009, Los Angeles, CA, USA, 6-10 July 2009},
  publisher = {IEEE},
}