Database Research Group (CIS)

Document Type

Conference Paper

Date of this Version

July 2000

Comments

Postprint version. Published in Proceedings of the Second International Conference on Language Resources and Evaluation (2000), July 2000, pages 807-814.
Publisher URL: http://www.lrec-conf.org/lrec2000/www.icp.inpg.fr/ELRA/lrec2000.html

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.

Share

COinS
 

Date Posted: 11 June 2007

This document has been peer reviewed.