Show simple item record

dc.contributor.authorTerry, Justinen_US
dc.contributor.authorStantic, Belaen_US
dc.contributor.authorTerenziani, Paoloen_US
dc.contributor.authorSattar, Abdulen_US
dc.contributor.editorJohann Elder, Maria Bielikova, A min Tjoaen_US
dc.date.accessioned2017-05-03T11:26:36Z
dc.date.available2017-05-03T11:26:36Z
dc.date.issued2011en_US
dc.date.modified2012-09-14T00:59:05Z
dc.identifier.issn03029743en_US
dc.identifier.doi10.1007/978-3-642-23737-9_9en_US
dc.identifier.urihttp://hdl.handle.net/10072/43325
dc.description.abstractEfficiently accessing multidimensional data is a challenge for building modern database applications that involve many folds of data such as temporal, spatial, data warehousing, bio-informatics, etc. This problem stems from the fact that multidimensional data have no given order that preserves proximity. The majority of the existing solutions to this problem cannot be easily integrated into the current relational database systems since they require modifications to the kernel. A prominent class of methods that can use existing access structures are 'space filling curves'. In this study, we describe a method that is also based on the space filling curve approach, but in contrast to earlier methods, it connects regions of various sizes rather than points in multidimensional space. Our approach allows an efficient transformation of interval queries into regions of data that results in significant improvements when accessing the data. A detailed empirical study demonstrates that the proposed method outperforms the best available off-theshelf methods for accessing multidimensional data.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_US
dc.format.extent468481 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_US
dc.publisherSpringeren_US
dc.publisher.placeGermanyen_US
dc.relation.ispartofstudentpublicationNen_US
dc.relation.ispartofpagefrom111en_US
dc.relation.ispartofpageto124en_US
dc.relation.ispartofjournalLecture Notes in Computer scienceen_US
dc.relation.ispartofvolume6909en_US
dc.rights.retentionYen_US
dc.subject.fieldofresearchData Structuresen_US
dc.subject.fieldofresearchcode080403en_US
dc.titleVariable Granularity Space filling Curve for Indexing Multidimensional Dataen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.rights.copyrightCopyright 2011 Springer Berlin / Heidelberg. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.comen_US
gro.date.issued2011
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record