Chained forests for fast subsumption matching

Sasu Tarkoma. Chained forests for fast subsumption matching. In Hans-Arno Jacobsen, Gero Mühl, Michael A. Jaeger, editors, Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems, DEBS 2007, Toronto, Ontario, Canada, June 20-22, 2007. Volume 233 of ACM International Conference Proceeding Series, pages 97-102, ACM, 2007. [doi]

@inproceedings{Tarkoma07,
  title = {Chained forests for fast subsumption matching},
  author = {Sasu Tarkoma},
  year = {2007},
  doi = {10.1145/1266894.1266912},
  url = {http://doi.acm.org/10.1145/1266894.1266912},
  researchr = {https://researchr.org/publication/Tarkoma07},
  cites = {0},
  citedby = {0},
  pages = {97-102},
  booktitle = {Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems, DEBS 2007, Toronto, Ontario, Canada, June 20-22, 2007},
  editor = {Hans-Arno Jacobsen and Gero Mühl and Michael A. Jaeger},
  volume = {233},
  series = {ACM International Conference Proceeding Series},
  publisher = {ACM},
  isbn = {978-1-59593-665-3},
}