Algorithmics and applications of tree and graph searching

Dennis Shasha, Jason T L Wang, Rosalba Giugno

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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)
Title of host publicationProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
Pages39-52
Number of pages14
StatePublished - 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

Fingerprint

Search engines

ASJC Scopus subject areas

  • Software

Cite this

Shasha, D., Wang, J. T. L., & Giugno, R. (2002). Algorithmics and applications of tree and graph searching. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (pp. 39-52)

Algorithmics and applications of tree and graph searching. / Shasha, Dennis; Wang, Jason T L; Giugno, Rosalba.

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 2002. p. 39-52.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shasha, D, Wang, JTL & Giugno, R 2002, Algorithmics and applications of tree and graph searching. in Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. pp. 39-52, Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002), Madison, WI, United States, 6/3/02.
Shasha D, Wang JTL, Giugno R. Algorithmics and applications of tree and graph searching. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 2002. p. 39-52
Shasha, Dennis ; Wang, Jason T L ; Giugno, Rosalba. / Algorithmics and applications of tree and graph searching. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 2002. pp. 39-52
@inproceedings{9847c1f68eb9404782edf29a6d5d9f66,
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",
language = "English (US)",
pages = "39--52",
booktitle = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",

}

TY - GEN

T1 - Algorithmics and applications of tree and graph searching

AU - Shasha, Dennis

AU - Wang, Jason T L

AU - Giugno, Rosalba

PY - 2002

Y1 - 2002

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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036040082&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036040082&partnerID=8YFLogxK

M3 - Conference contribution

SP - 39

EP - 52

BT - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

ER -