Sciweavers

3531 search results - page 378 / 707
» Virtualizing Disk Performance
Sort
View
CIKM
1994
Springer
15 years 10 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
CINQ
2004
Springer
180views Database» more  CINQ 2004»
15 years 10 months 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
DEXA
2004
Springer
112views Database» more  DEXA 2004»
15 years 10 months ago
Efficient Algorithms for Multi-file Caching
Multi-File Caching issues arise in applications where a set of jobs are processed and each job requests one or more input files. A given job can only be started if all its input fi...
Ekow J. Otoo, Doron Rotem, Sridhar Seshadri
ADBIS
2000
Springer
91views Database» more  ADBIS 2000»
15 years 10 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
KDD
1995
ACM
167views Data Mining» more  KDD 1995»
15 years 10 months ago
Efficient Algorithms for Attribute-Oriented Induction
Data mining or knowledge discovery in databasesis the search for relationships and global patterns that exist but are hidden in large databases.Many different methodshave been pro...
Hoi-Yee Hwang, Ada Wai-Chee Fu