Sciweavers

286 search results - page 51 / 58
» Using MEMS-Based Storage to Boost Disk Performance
Sort
View
CIKM
1994
Springer
15 years 1 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet
VLDB
2002
ACM
141views Database» more  VLDB 2002»
15 years 9 months ago
Data page layouts for relational databases on deep memory hierarchies
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill
ICDE
2004
IEEE
151views Database» more  ICDE 2004»
15 years 11 months ago
Benchmarking SAP R/3 Archiving Scenarios
According to a survey of the University of Berkeley [6], about 5 Exabytes of new information has been created in 2002. This information explosion affects also the database volumes...
Bernhard Zeller, Alfons Kemper
ADBIS
2000
Springer
91views Database» more  ADBIS 2000»
15 years 1 months ago
Efficient Region Query Processing by Optimal Page Ordering
A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme...
Daesoo Cho, Bonghee Hong
IADIS
2004
14 years 11 months ago
A Scalable I/O Architecture and File System for Internet Servers
Most Internet services rely on the traditional client-server model, where the quality of services usually depends on the performance of those servers. In this paper, we propose a ...
Chei-Yol Kim, Sung-Hoon Sohn, Baik-Song Ahn, Gyu-I...