Towards a query language for annotation graphs

Steven Bird, Peter Buneman, Wang Chiew Tan

Research output: Chapter in Book/Report/Conference proceedingConference Paper published in Proceedings

Abstract

The multidimensional, heterogeneous, and temporal nature of speech databases raises interesting challenges for representation and query. Recently, annotation graphs have been proposed as a general-purpose representational framework for speech databases. Typical queries on annotation graphs require path expressions similar to those used in semistructured query languages. However, the underlying model is rather different from the customary graph models for semistructured data: the graph is acyclic and unrooted, and both temporal and inclusion relationships are important. We develop a query language and describe optimization techniques for an underlying relational representation.

Original languageEnglish
Title of host publication2nd International Conference on Language Resources and Evaluation, LREC 2000
Publication statusPublished - 1 Jan 2000
Externally publishedYes
Event2nd International Conference on Language Resources and Evaluation, LREC 2000 - Athens, Greece
Duration: 31 May 20002 Jun 2000

Conference

Conference2nd International Conference on Language Resources and Evaluation, LREC 2000
CountryGreece
CityAthens
Period31/05/002/06/00

Fingerprint Dive into the research topics of 'Towards a query language for annotation graphs'. Together they form a unique fingerprint.

  • Cite this

    Bird, S., Buneman, P., & Tan, W. C. (2000). Towards a query language for annotation graphs. In 2nd International Conference on Language Resources and Evaluation, LREC 2000