Sciweavers

91 search results - page 14 / 19
» Rethinking Database Algorithms for Phase Change Memory
Sort
View
ICDE
2009
IEEE
114views Database» more  ICDE 2009»
14 years 10 months ago
On Efficient Query Processing of Stream Counts on the Cell Processor
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...
Dina Thomas, Rajesh Bordawekar, Charu C. Aggarwal,...
KDD
2010
ACM
195views Data Mining» more  KDD 2010»
14 years 14 days ago
Universal multi-dimensional scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
FPL
2008
Springer
138views Hardware» more  FPL 2008»
13 years 10 months ago
An efficient run-time router for connecting modules in FPGAS
It is often desirable to change the logic and/or the connections within an FPGA design on-the-fly without the benefit of a workstation or vendor CAD software. This paper presents ...
Jorge Surís, Cameron Patterson, Peter Athan...
PVLDB
2008
137views more  PVLDB 2008»
13 years 8 months ago
Flashing up the storage layer
In the near future, commodity hardware is expected to incorporate both flash and magnetic disks. In this paper we study how the storage layer of a database system can benefit from...
Ioannis Koltsidas, Stratis Viglas
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
14 years 3 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm