Algorithmics and applications of tree and graph searching

Dennis Shasha, Jason T.L. Wang, Rosalba Giugno

Research output: Contribution to conferencePaper

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.

Original languageEnglish (US)
Pages39-52
Number of pages14
DOIs
StatePublished - Jan 1 2002
EventProceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002) - Madison, WI, United States
Duration: Jun 3 2002Jun 5 2002

Other

OtherProceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002)
CountryUnited States
CityMadison, WI
Period6/3/026/5/02

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Algorithmics and applications of tree and graph searching'. Together they form a unique fingerprint.

  • Cite this

    Shasha, D., Wang, J. T. L., & Giugno, R. (2002). Algorithmics and applications of tree and graph searching. 39-52. Paper presented at Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002), Madison, WI, United States. https://doi.org/10.1145/543613.543620