Sciweavers

1390 search results - page 110 / 278
» Self-Sizing of Clustered Databases
Sort
View
CSMR
2007
IEEE
14 years 3 months ago
An approach for mining services in database oriented applications
The diffusion of service oriented architectures is slowed down by the lack of enough services available for satisfying service integrator needs. Nevertheless, many features desire...
Concettina Del Grosso, Massimiliano Di Penta, Igna...
IPPS
2006
IEEE
14 years 3 months ago
FPGA based architecture for DNA sequence comparison and database search
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
Euripides Sotiriades, Christos Kozanitis, Apostolo...
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
ICCS
2005
Springer
14 years 2 months ago
Scalable Hybrid Search on Distributed Databases
We have previously described a hybrid keyword search that combines metadata search with a traditional keyword search over unstructured context data. This hybrid search paradigm pro...
Jungkee Kim, Geoffrey Fox
EDBT
2009
ACM
106views Database» more  EDBT 2009»
14 years 1 months ago
AlphaSum: size-constrained table summarization using value lattices
Consider a scientist who wants to explore multiple data sets to select the relevant ones for further analysis. Since the visualization real estate may put a stringent constraint o...
K. Selçuk Candan, Huiping Cao, Yan Qi 0002,...