Sciweavers

266 search results - page 50 / 54
» An Architecture for Fast Processing of Large Unstructured Da...
Sort
View
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 7 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
USENIX
2003
13 years 8 months ago
Operating System I/O Speculation: How Two Invocations Are Faster Than One
We present an in-kernel disk prefetcher which uses speculative execution to determine what data an application is likely to require in the near future. By placing our design withi...
Keir Faser, Fay Chang
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 9 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
BMCBI
2007
137views more  BMCBI 2007»
13 years 7 months ago
PlnTFDB: an integrative plant transcription factor database
Background: Transcription factors (TFs) are key regulatory proteins that enhance or repress the transcriptional rate of their target genes by binding to specific promoter regions ...
Diego Mauricio Riaño-Pachón, Sloboda...
VLSID
2002
IEEE
142views VLSI» more  VLSID 2002»
14 years 7 months ago
Address Code and Arithmetic Optimizations for Embedded Systems
An important class of problems used widely in both the embedded systems and scientific domains perform memory intensive computations on large data sets. These data sets get to be ...
J. Ramanujam, Satish Krishnamurthy, Jinpyo Hong, M...