Sciweavers

91 search results - page 9 / 19
» Rethinking Database Algorithms for Phase Change Memory
Sort
View
APBC
2004
108views Bioinformatics» more  APBC 2004»
13 years 8 months ago
Ladderlike Stepping and Interval Jumping Searching Algorithms for DNA Sequences
In this study we have designed a novel algorithm for searching common segments in multiple DNA sequences. To improve efficiency in pattern searching, combination of hashing encodi...
Tun-Wen Pai, Margaret Dah-Tsyr Chang, Jia-Han Chu,...
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 7 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
GIS
2003
ACM
14 years 8 months ago
An efficient r-tree implementation over flash-memory storage systems
For many applications with spatial data management such as Geographic Information Systems (GIS), block-oriented access over flash memory could introduce a significant number of no...
Chin-Hsien Wu, Li-Pin Chang, Tei-Wei Kuo
ICDE
2005
IEEE
183views Database» more  ICDE 2005»
14 years 8 months ago
Adaptive Caching for Continuous Queries
We address the problem of executing continuous multiway join queries in unpredictable and volatile environments. Our query class captures windowed join queries in data stream syst...
Shivnath Babu, Kamesh Munagala, Jennifer Widom, Ra...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci