Sciweavers

4302 search results - page 24 / 861
» Index Pairs Algorithms
Sort
View
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 8 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
PVLDB
2010
164views more  PVLDB 2010»
13 years 6 months ago
FlashStore: High Throughput Persistent Key-Value Store
We present FlashStore, a high throughput persistent keyvalue store, that uses flash memory as a non-volatile cache between RAM and hard disk. FlashStore is designed to store the ...
Biplob Debnath, Sudipta Sengupta, Jin Li
CANS
2006
Springer
129views Cryptology» more  CANS 2006»
13 years 11 months ago
Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields
Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is...
Tae-Hyun Kim, Tsuyoshi Takagi, Dong-Guk Han, Ho Wo...
ESEM
2008
ACM
13 years 9 months ago
Pair programming: what's in it for me?
Pair programming is a practice in which two programmers work collaboratively at one computer on the same design, algorithm, or code. Prior research on pair programming has primari...
Andrew Begel, Nachiappan Nagappan
SEMWEB
2010
Springer
13 years 5 months ago
Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
Yingjie Li, Jeff Heflin