Retrieving meaningful relaxed tightest fragments for XML keyword search

Lingbo Kong, Rémi Gilleron, Aurélien Lemay. Retrieving meaningful relaxed tightest fragments for XML keyword search. In Martin L. Kersten, Boris Novikov, Jens Teubner, Vladimir Polutin, Stefan Manegold, editors, EDBT 2009, 12th International Conference on Extending Database Technology, Saint Petersburg, Russia, March 24-26, 2009, Proceedings. Volume 360 of ACM International Conference Proceeding Series, pages 815-826, ACM, 2009. [doi]

@inproceedings{KongGL09:0,
  title = {Retrieving meaningful relaxed tightest fragments for XML keyword search},
  author = {Lingbo Kong and Rémi Gilleron and Aurélien Lemay},
  year = {2009},
  doi = {10.1145/1516360.1516454},
  url = {http://doi.acm.org/10.1145/1516360.1516454},
  tags = {XML, XML Schema, search},
  researchr = {https://researchr.org/publication/KongGL09%3A0},
  cites = {0},
  citedby = {0},
  pages = {815-826},
  booktitle = {EDBT 2009, 12th International Conference on Extending Database Technology, Saint Petersburg, Russia, March 24-26, 2009, Proceedings},
  editor = {Martin L. Kersten and Boris Novikov and Jens Teubner and Vladimir Polutin and Stefan Manegold},
  volume = {360},
  series = {ACM International Conference Proceeding Series},
  publisher = {ACM},
  isbn = {978-1-60558-422-5},
}