Show simple item record

dc.contributor.authorPuglisi, Simon
dc.contributor.authorSmyth, Bill
dc.contributor.authorTurpin, A.
dc.contributor.editorGillian Dobbie
dc.contributor.editorJames Bailey
dc.identifier.citationPuglisi, Simon and Smyth, William and Turpin, Andrew. 2006. Suffix arrays: what are they good for? In Dobbie, G. and Bailey, J. (ed), 17th Australasian Database Conference (ADC), pp. 17-18. Hobart, Australia: Australian Computer Society, Inc.

Recently the theoretical community has displayed a flurry of interest in suffix arrays, and compressed suffix arrays. New, asymptotically optimal algorithms for construction, search, and compression of suffix arrays have been proposed. In this talk we will present our investigations into the practicalities of these latest developments. In particular, we investigate whether suffix arrays can indeed replace inverted files, as suggested in recent literature on suffix arrays.

dc.publisherAustralian Computer Society, Inc.
dc.titleSuffix arrays: what are they good for?
dc.typeConference Paper
dcterms.source.titleProceedings of the 17th Australasian database conference (ADC)
dcterms.source.seriesProceedings of the 17th Australasian database conference (ADC)
dcterms.source.conference17th Australasian Database Conference (ADC)
dcterms.source.conference-start-dateJan 16 2006
dcterms.source.conferencelocationHobart, Australia

Copyright © 2006, Australian Computer Society, Inc. This paper appeared at the Seventeenth Australasian Database Conference (ACSC2006), Hobart, Australia. Conferences in Research and Practice in Information Technology, Vol. 49. Gillian Dobbie and James Bailey, Ed. Reproduction for academic, not for profit purposes permitted provided this text is included.

curtin.accessStatusOpen access
curtin.facultyCurtin Business School
curtin.facultyThe Digital Ecosystems and Business Intelligence Institute (DEBII)

Files in this item


This item appears in the following Collection(s)

Show simple item record