Sciweavers

304 search results - page 50 / 61
» Parallel and Distributed Compressed Indexes
Sort
View
ICDCS
2010
IEEE
13 years 11 months ago
A New Buffer Cache Design Exploiting Both Temporal and Content Localities
: This paper presents a Least Popularly Used buffer cache algorithm to exploit both temporal locality and content locality of I/O requests. Popular data blocks are selected as refe...
Jin Ren, Qing Yang
SPAA
2005
ACM
14 years 29 days ago
Decentralized algorithms using both local and random probes for P2P load balancing
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
Krishnaram Kenthapadi, Gurmeet Singh Manku
CLOUD
2010
ACM
14 years 14 days ago
The case for PIQL: a performance insightful query language
Large-scale, user-facing applications are increasingly moving from relational databases to distributed key/value stores for high-request-rate, low-latency workloads. Often, this m...
Michael Armbrust, Nick Lanham, Stephen Tu, Armando...
CLADE
2004
IEEE
13 years 11 months ago
Engineering a Peer-to-Peer Collaboratory for Tissue Microarray Research
This paper presents the design, development and evaluation of a prototype peer-to-peer collaboratory for imaging, analyzing, and seamlessly sharing tissue microarrays (TMA), corre...
Cristina Schmidt, Manish Parashar, Wenjin Chen, Da...
ICDE
2007
IEEE
182views Database» more  ICDE 2007»
14 years 8 months ago
DIKNN: An Itinerary-based KNN Query Processing Algorithm for Mobile Sensor Networks
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
Shan-Hung Wu, Kun-Ta Chuang, Chung-Min Chen, Ming-...