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...

Full description

Bibliographic Details
Main Authors: Kimura, Hideaki, Huo, George, Rasin, Alexander, Zdonik, Stanley B., Madden, Samuel R.
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Association for Computing Machinery (ACM) 2014
Online Access:http://hdl.handle.net/1721.1/90382
https://orcid.org/0000-0002-7470-3265