Sciweavers

502 search results - page 22 / 101
» Efficient Structured Data Access in Parallel File Systems
Sort
View
IOPADS
1996
87views more  IOPADS 1996»
13 years 10 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
IPPS
2007
IEEE
14 years 3 months ago
An Implementation and Evaluation of Client-Side File Caching for MPI-IO
Client-side file caching has long been recognized as a file system enhancement to reduce the amount of data transfer between application processes and I/O servers. However, cach...
Wei-keng Liao, Avery Ching, Kenin Coloma, Alok N. ...
KDD
1997
ACM
111views Data Mining» more  KDD 1997»
14 years 27 days ago
SIPping from the Data Firehose
When mining large databases, the data extraction problem and the interface between the database and data mining algorithm become important issues. Rather than giving a mining algo...
George H. John, Brian Lent
GRID
2007
Springer
13 years 8 months ago
Managing Role-Based Access Control Policies for Grid Databases in OGSA-DAI Using CAS
In this paper, we present a role-based access control method for accessing databases through the Open Grid Services Architecture – Data Access and Integration (OGSA-DAI) framewor...
Anil L. Pereira, Vineela Muppavarapu, Soon M. Chun...
CINQ
2004
Springer
180views Database» more  CINQ 2004»
14 years 15 days ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann