Algorithmics and Applications of Tree and Graph Searching

@inproceedings{citeulike:472478, 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 = {Shasha, Dennis and Jason and Giugno, Rosalba }, booktitle = {Symposium on Principles of Database Systems}, citeulike-article-id = {472478}, comment = {It uses a hash function for filtering nodes and paths}, keywords = {graph, xml}, pages = {39--52}, posted-at = {2006-01-20 13:40:51}, priority = {0}, title = {Algorithmics and Applications of Tree and Graph Searching}, url = {http://citeseer.ist.psu.edu/shasha02algorithmics.html}, year = {2002} }

TY - CONF ID - citeulike:472478 L3 - citeulike-article-id:472478 TI - Algorithmics and Applications of Tree and Graph Searching T2 - Symposium on Principles of Database Systems SP - 39 EP - 52 N2 - 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. KW - graph KW - xml N1 - It uses a hash function for filtering nodes and paths AU - Shasha, Dennis AU - Jason AU - Giugno, Rosalba PY - 2002/// UR - http://citeseer.ist.psu.edu/shasha02algorithmics.html ER -