H-Tree: An Efficient Index Structurefor Event Matching in Content-BasedPublish/Subscribe Systems. Qian, S., Cao, J., Zhu, Y., Li, M., & Wang, J. IEEE Trans. Parallel Distrib. Syst., 26(6):1622-1632, 2015.
H-Tree: An Efficient Index Structurefor Event Matching in Content-BasedPublish/Subscribe Systems. [link]Link  H-Tree: An Efficient Index Structurefor Event Matching in Content-BasedPublish/Subscribe Systems. [link]Paper  bibtex   
@article{journals/tpds/QianCZLW15,
  author = {Qian, Shiyou and Cao, Jian and Zhu, Yanmin and Li, Minglu and Wang, Jie},
  ee = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2014.2323262},
  interhash = {51515e6122523312c4d94ec5f19eca17},
  intrahash = {592a7945a1b0d8d2decd26b8bb5a8ef0},
  journal = {IEEE Trans. Parallel Distrib. Syst.},
  number = 6,
  pages = {1622-1632},
  title = {H-Tree: An Efficient Index Structurefor Event Matching in Content-BasedPublish/Subscribe Systems.},
  url = {http://dblp.uni-trier.de/db/journals/tpds/tpds26.html#QianCZLW15},
  volume = 26,
  year = 2015
}

Downloads: 0