Sciweavers

2624 search results - page 355 / 525
» Managing change (workshop)
Sort
View
NIS
1998
131views more  NIS 1998»
15 years 6 months ago
Dynamic Memory Allocation for Large Query Execution
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
Luc Bouganim, Olga Kapitskaia, Patrick Valduriez
ICWS
2009
IEEE
16 years 4 months ago
Scalable and Reliable Location Services through Decentralized Replication
—One of the critical challenges for service oriented computing systems is the capability to guarantee scalable and reliable service provision. This paper presents Reliable GeoGri...
Gong Zhang, Ling Liu, Sangeetha Seshadri, Bhuvan B...
SOSP
2007
ACM
16 years 3 months ago
Generalized file system dependencies
Reliable storage systems depend in part on “write-before” relationships where some changes to stable storage are delayed until other changes commit. A journaled file system, ...
Christopher Frost, Mike Mammarella, Eddie Kohler, ...
SOSP
2009
ACM
16 years 3 months ago
Better I/O through byte-addressable, persistent memory
Modern computer systems have been built around the assumption that persistent storage is accessed via a slow, block-based interface. However, new byte-addressable, persistent memo...
Jeremy Condit, Edmund B. Nightingale, Christopher ...
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
16 years 1 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar