Correlation maps: A compressed access method for exploiting soft functional dependencies
In relational query processing, there are generally two choices for access paths when performing a predicate lookup for which no clustered index is available. One option is to use an unclustered index. Another is to perform a complete sequential scan of the table. Many analytical workloads do not be...
| Những tác giả chính: | , , , , |
|---|---|
| Tác giả khác: | |
| Định dạng: | Bài viết |
| Ngôn ngữ: | en_US |
| Được phát hành: |
Association for Computing Machinery (ACM)
2014
|
| Truy cập trực tuyến: | http://hdl.handle.net/1721.1/90382 https://orcid.org/0000-0002-7470-3265 |