Sciweavers

62 search results - page 2 / 13
» TrajStore: An Adaptive Storage System for Very Large Traject...
Sort
View
SMC
2007
IEEE
13 years 10 months ago
ADtrees for sequential data and n-gram Counting
Abstract— We consider the problem of efficiently storing ngram counts for large n over very large corpora. In such cases, the efficient storage of sufficient statistics can ha...
Robert Van Dam, Dan Ventura
RTS
2008
131views more  RTS 2008»
13 years 4 months ago
A constant-time dynamic storage allocator for real-time systems
Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst case of spatial and temporal requirements for allocation ...
Miguel Masmano, Ismael Ripoll, Patricia Balbastre,...
FAST
2004
13 years 6 months ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing...
IOPADS
1996
87views more  IOPADS 1996»
13 years 5 months ago
Structured Permuting in Place on Parallel Disk Systems
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
Leonard F. Wisniewski
MSS
2000
IEEE
124views Hardware» more  MSS 2000»
13 years 9 months ago
Towards Mass Storage Systems with Object Granularity
Many applications, that need mass storage, manipulate data sets with KB – MB size objects. In contrast, mass storage devices work most efficiently for the storage and transfer ...
Koen Holtman, Peter van der Stok, Ian Willers