Abstract: A data mart may be organized using a clustered key, thereby allowing certain efficiencies in data search and retrieval to be realized. In one example, the clustered key is made of a plurality of attributes. The attributes may be chosen based on their likelihood of being using as search criteria. The likelihood of a given attribute being used as a search criterion may be determined through historical analysis of search requests. Records in the data mart may be sorted based on the attributes in the clustered key, thereby producing records that are organized by attribute in sequential runs. When a search uses an attribute in the clustered key as a search criterion, the records that are being sought may appear in one or more sequential runs, thereby leveraging the efficiency of sequential reads as opposed to random reads.

Abstract: The claimed subject matter provides a system and/or a method for moving large volumes of data. An exemplary method comprises receiving a request to transfer a plurality of rows from a first table to a second table. The first table may be determined to be associated with a same file group as the second table. The plurality of rows may be moved from the first table to the second table by transferring a partition for the first table to the second table.