We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the
case of ...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Abstract Spatio-temporal extensions to data models have been an active area of research for a number of years. To date, much of this work has focused on the relational data model, ...
Tony Griffiths, Alvaro A. A. Fernandes, Norman W. ...
Building an XML store means finding solutions to the problems of representing, accessing, querying and updating XML data. The irregularity of both the structure and usage of XML, ...