Sciweavers

2324 search results - page 114 / 465
» A Fast Keyword-Spotting Technique
Sort
View
CIKM
2010
Springer
14 years 8 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...
92
Voted
TON
2010
196views more  TON 2010»
14 years 4 months ago
Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling
Abstract--This paper develops novel mechanisms for recovering from failures in IP networks with proactive backup path calculations and IP tunneling. The primary scheme provides res...
Shrinivasa Kini, S. Ramasubramanian, Amund Kvalbei...
FAST
2009
14 years 8 months ago
Generating Realistic Impressions for File-System Benchmarking
The performance of file systems and related software depends on characteristics of the underlying file-system image (i.e., file-system metadata and file contents). Unfortunately, ...
Nitin Agrawal, Andrea C. Arpaci-Dusseau, Remzi H. ...
FAST
2009
14 years 8 months ago
A Performance Evaluation and Examination of Open-Source Erasure Coding Libraries for Storage
Over the past five years, large-scale storage installations have required fault-protection beyond RAID-5, leading to a flurry of research on and development of erasure codes for m...
James S. Plank, Jianqiang Luo, Catherine D. Schuma...
SIGMOD
2012
ACM
246views Database» more  SIGMOD 2012»
13 years 18 days ago
Skimmer: rapid scrolling of relational query results
A relational database often yields a large set of tuples as the result of a query. Users browse this result set to find the information they require. If the result set is large, ...
Manish Singh, Arnab Nandi, H. V. Jagadish