Show simple item record

dc.contributor.convenorMihai Lazarescu and Ling Lien_US
dc.contributor.authorStantic, Belaen_US
dc.contributor.authorTopor, Rodneyen_US
dc.contributor.authorTerry, Justinen_US
dc.contributor.authorSattar, Abdulen_US
dc.contributor.editorHeng Tao Shen, Yanchun Zhangen_US
dc.date.accessioned2017-05-03T11:26:35Z
dc.date.available2017-05-03T11:26:35Z
dc.date.issued2011en_US
dc.date.modified2012-03-07T05:00:04Z
dc.identifier.refurihttp://itee.uq.edu.au/~adc2011/en_US
dc.identifier.urihttp://hdl.handle.net/10072/43351
dc.description.abstractIn this study, we investigate and present a new index structure, Triangular Decomposition Tree (TDtree), which can efficiently store and query temporal data in modern database applications. TD-tree is based on spatial representation of interval data and a recursive triangular decomposition of this space. A bounded number of intervals are stored in each leaf of the tree, which hence may be unbalanced. We describe the algorithms used with this structure. A single query algorithm can be applied uniformly to different query types without the need of dedicated query transformation. In addition to the advantages related to the usage of a single query algorithm for different query types and better space complexity, the empirical performance of the TD-tree is demonstrated to be superior to its best known competitors. Also, presented concept can be extended to more dimensions and therefore applied to efficiently manage spatio-temporal data.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_US
dc.format.extent677387 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.publisherAustralian Computer Societyen_US
dc.publisher.placeAustraliaen_US
dc.publisher.urihttp://itee.uq.edu.au/~adc2011/en_US
dc.publisher.urihttp://crpit.com/abstracts/CRPITV115Stantic.htmlen_US
dc.relation.ispartofstudentpublicationNen_US
dc.relation.ispartofconferencenameTwenty-Second Australasian Database Conference (ADC 2011)en_US
dc.relation.ispartofconferencetitleDatabase Technologies 2011 Proceedings of the Twenty-Second Australasian Database Conference (ADC 2011)en_US
dc.relation.ispartofdatefrom2011-01-17en_US
dc.relation.ispartofdateto2011-01-20en_US
dc.relation.ispartoflocationPerth, Australiaen_US
dc.rights.retentionYen_US
dc.subject.fieldofresearchData Structuresen_US
dc.subject.fieldofresearchcode080403en_US
dc.titleA Triangular Decomposition Access Method for Temporal Data - TD-treeen_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conference Publications (HERDC)en_US
dc.type.codeE - Conference Publicationsen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.rights.copyrightCopyright 2011 Australian Computer Society Inc. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the conference's website for access to the definitive, published version.en_US
gro.date.issued2011
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record