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...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery (ACM),
2014-09-26T13:17:21Z.
|
| Subjects: | |
| Online Access: | Get fulltext |