Sciweavers

912 search results - page 155 / 183
» Design, Implementation, and Evaluation of a Repairable Datab...
Sort
View
CIKM
2010
Springer
15 years 3 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
MOBISYS
2007
ACM
16 years 4 months ago
SmokeScreen: flexible privacy controls for presence-sharing
Presence-sharing is an emerging platform for mobile applications, but presence-privacy remains a challenge. Privacy controls must be flexible enough to allow sharing between both ...
Landon P. Cox, Angela Dalton, Varun Marupadi
DEXAW
2006
IEEE
140views Database» more  DEXAW 2006»
15 years 10 months ago
String-Matching and Update through Algebraic Signatures in Scalable Distributed Data Structures
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...
Riad Mokadem, Witold Litwin
272
Voted
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
16 years 4 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...
CIKM
2001
Springer
15 years 9 months ago
X007: Applying 007 Benchmark to XML Query Processing Tool
If XML is to play the critical role of the lingua franca for Internet data interchange that many predict, it is necessary to start designing and adopting benchmarks allowing the c...
Stéphane Bressan, Gillian Dobbie, Zoé...