Towards a query language for annotation graphs

dc.creatorBird, Steven
dc.creatorBuneman, Peter
dc.creatorTan, Wang-Chiew
dc.date2000-07-13
dc.date.accessioned2026-07-07T03:16:22Z
dc.date.available2026-07-07T03:16:22Z
dc.descriptionThe 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.
dc.description8 pages, 10 figures
dc.identifierhttps://arxiv.org/abs/cs/0007023
dc.identifierhttp://arxiv.org/abs/cs/0007023
dc.identifierProceedings of the Second International Conference on Language Resources and Evaluation, pp. 807-814, Paris: European Language Resources Association, 2000
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30330
dc.subjectComputation and Language
dc.subjectDatabases
dc.subjectE.1; E.2; H.2.1; H.2.3; H.2.8; H.3.1; H.3.3; I.2.7
dc.titleTowards a query language for annotation graphs
dc.typetext

Files

Collections