@inproceedings{bfddaa7c045d4f5496d7b11991552cf8,
title = "Algorithmics and applications of tree and graph searching",
abstract = "Modern search engines answer keyword-based queries extremely efficiently. The impressive speed is due to clever inverted index structures, caching, a domain-independent knowledge of strings, and thousands of machines. Several research efforts have attempted to generalize keyword search to keytree and keygraph searching, because trees and graphs have many applications in next-generation database systems. This paper surveys both algorithms and applications, giving some emphasis to our own work.",
author = "Dennis Shasha and Wang, \{Jason T.L.\} and Rosalba Giugno",
year = "2002",
month = jun,
day = "3",
doi = "10.1145/543613.543620",
language = "English (US)",
series = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",
publisher = "Association for Computing Machinery (ACM)",
pages = "39--52",
booktitle = "Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS 2002",
address = "United States",
note = "21st ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS 2002 ; Conference date: 03-06-2002 Through 05-06-2002",
}