Sciweavers

1031 search results - page 194 / 207
» Managing the operator ordering problem in parallel databases
Sort
View
WWW
2008
ACM
14 years 8 months ago
Using graphics processors for high-performance IR query processing
Web search engines are facing formidable performance challenges due to data sizes and query loads. The major engines have to process tens of thousands of queries per second over t...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel
CLUSTER
2005
IEEE
14 years 1 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
BMCBI
2008
103views more  BMCBI 2008»
13 years 7 months ago
TOPS++FATCAT: Fast flexible structural alignment using constraints derived from TOPS+ Strings Model
Background: Protein structure analysis and comparison are major challenges in structural bioinformatics. Despite the existence of many tools and algorithms, very few of them have ...
Mallika Veeramalai, Yuzhen Ye, Adam Godzik
CODASPY
2011
12 years 11 months ago
Privacy-preserving activity scheduling on mobile devices
—Progress in mobile wireless technology has resulted in the increased use of mobile devices to store and manage users’ personal schedules. Users also access popular contextbase...
Igor Bilogrevic, Murtuza Jadliwala, Jean-Pierre Hu...
CN
1998
64views more  CN 1998»
13 years 7 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani