Define the Linus sequence Ln for n 1 as a 0-1 sequence with L1 = 0, and Ln chosen so as to minimize the length of the longest immediately repeated block Ln-2r+1 . . . Ln-r = Ln-r...
In this paper, we present a query translation algorithm which allows object-oriented queries to be automatically translated into a relational query language. Our goal is to provid...
Daniel A. Keim, Hans-Peter Kriegel, Andreas Mieths...
One of the major problems in genomic field is to perform sequence comparison on DNA and protein sequences. Executing sequence comparison on the DNA and protein data is a computatio...
Mubarak Saif Mohsen, Zurinahni Zainol, Rosalina Ab...
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Increasingly pervasive networks are leading towards a world where data is constantly in motion. In such a world, conventional techniques for query processing, which were developed...