H-Tree: An efficient index structure for event matching in publish/subscribe systems. Qian, S., Cao, J., Zhu, Y., Li, M., & Wang, J. In Networking, pages 1-9, 2013. IEEE.
H-Tree: An efficient index structure for event matching in publish/subscribe systems. [link]Link  H-Tree: An efficient index structure for event matching in publish/subscribe systems. [link]Paper  bibtex   
@inproceedings{conf/networking/QianCZLW13,
  author = {Qian, Shiyou and Cao, Jian and Zhu, Yanmin and Li, Minglu and Wang, Jie},
  booktitle = {Networking},
  crossref = {conf/networking/2013},
  ee = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6663515},
  interhash = {b3b5fa690d30399d23a4eeaa6a7dc47f},
  intrahash = {c95edce52ab35b6b38ed0a7c41a1b928},
  isbn = {978-3-901882-55-5},
  pages = {1-9},
  publisher = {IEEE},
  title = {H-Tree: An efficient index structure for event matching in publish/subscribe systems.},
  url = {http://dblp.uni-trier.de/db/conf/networking/networking2013.html#QianCZLW13},
  year = 2013
}

Downloads: 0