2962 search results - page 65 / 593 » Optimizing Spatial Data Structures For Static Data |
EUROPAR
2004
Springer
14 years 2 months ago
2004
Springer
This paper describes a monitoring environment that enables the analysis of memory access behavior of applications in a selective way with a potentially very high degree of detail. ...
PPSC
2001
13 years 10 months ago
2001
As the gap between processor and memory performance widens, careful analyses and optimizations of cache memory behavior become increasingly important. While analysis of regular lo...
DATAMINE
1999
13 years 8 months ago
1999
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We introduce an extension of the XQuery language, FluX, that supports event-based query processing and the conscious handling of main memory buffers. Purely event-based queries of...
SAC
2002
ACM
13 years 8 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...