Sciweavers

11 search results - page 2 / 3
» Hash-Merge Join: A Non-blocking Join Algorithm for Producing...
Sort
View
CDB
2004
Springer
143views Database» more  CDB 2004»
13 years 10 months ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
14 years 5 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 6 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
ICDE
2006
IEEE
190views Database» more  ICDE 2006»
13 years 11 months ago
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
Elke Michlmayr
BMCBI
2010
135views more  BMCBI 2010»
13 years 5 months ago
GIGA: a simple, efficient algorithm for gene tree inference in the genomic age
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
Paul D. Thomas