The Decomposition Storage Model (DSM) vertically partitions all attributes of a given relation. DSM has excellent I/O behavior when the number of attributes touched in the query i...
We present GPUQP, a relational query engine that employs both CPUs and GPUs (Graphics Processing Units) for in-memory query co-processing. GPUs are commodity processors traditiona...
Rui Fang, Bingsheng He, Mian Lu, Ke Yang, Naga K. ...
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffici...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...