SIGMOD
2001
ACM
15 years 29 days ago
2001
ACM
This paper proposes and evaluates Prefetching B+ -Trees pB+ -Trees, which use prefetching to accelerate two important operations on B+ -Tree indices: searches and range scans. To ...
SIGMOD
2001
ACM
15 years 29 days ago
2001
ACM
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
SIGMOD
2001
ACM
15 years 29 days ago
2001
ACM
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
SIGMOD
2001
ACM
15 years 29 days ago
2001
ACM
SIGMOD
2001
ACM
15 years 29 days ago
2001
ACM
SIGMOD
2001
ACM
15 years 29 days ago
2001
ACM
SIGMOD
2001
ACM
15 years 29 days ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
SIGMOD
2001
ACM
15 years 29 days ago
2001
ACM
In this paper we present a method for automatically segmenting unformatted text records into structured elements. Several useful data sources today are human-generated as continuo...
SIGMOD
2001
ACM
15 years 29 days ago
2001
ACM
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
SIGMOD
2001
ACM
15 years 29 days ago
2001
ACM
The outlier detection problem has important applications in the eld of fraud detection, network robustness analysis, and intrusion detection. Most such applications are high dimen...