Towards a query language for annotation graphs

Steven Bird; Peter Buneman; Wang Chiew Tan

Towards a query language for annotation graphs

Steven Bird, Peter Buneman, Wang Chiew Tan

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper published in Proceedings › peer-review

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 language	English
Title of host publication	2nd International Conference on Language Resources and Evaluation, LREC 2000
Publication status	Published - 1 Jan 2000
Externally published	Yes
Event	2nd International Conference on Language Resources and Evaluation, LREC 2000 - Athens, Greece Duration: 31 May 2000 → 2 Jun 2000

Conference

Conference	2nd International Conference on Language Resources and Evaluation, LREC 2000
Country/Territory	Greece
City	Athens
Period	31/05/00 → 2/06/00

Cite this

@inproceedings{a2fdee4ab94f48afbb8eb3d5d88c7a99,

title = "Towards a query language for annotation graphs",

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.",

author = "Steven Bird and Peter Buneman and Tan, {Wang Chiew}",

year = "2000",

month = jan,

day = "1",

language = "English",

booktitle = "2nd International Conference on Language Resources and Evaluation, LREC 2000",

note = "2nd International Conference on Language Resources and Evaluation, LREC 2000 ; Conference date: 31-05-2000 Through 02-06-2000",

}

TY - GEN

T1 - Towards a query language for annotation graphs

AU - Bird, Steven

AU - Buneman, Peter

AU - Tan, Wang Chiew

PY - 2000/1/1

Y1 - 2000/1/1

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

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

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

M3 - Conference Paper published in Proceedings

AN - SCOPUS:81255184742

BT - 2nd International Conference on Language Resources and Evaluation, LREC 2000

T2 - 2nd International Conference on Language Resources and Evaluation, LREC 2000

Y2 - 31 May 2000 through 2 June 2000

ER -

Towards a query language for annotation graphs

Abstract

Conference

Other files and links

Fingerprint

Cite this