Providing a content preview

• US 9,110,937 B2
• Filed: 03/14/2013
• Issued: 08/18/2015
• Est. Priority Date: 01/30/2013
• Status: Active Grant

• Current Assignee: Dropbox, Inc.
• Original Assignee: Dropbox, Inc.
• Inventors: Mahkovec, Ziga, Mahdi, Nikrad, Beckmann, Chris
• Primary Examiner(s): Hoang, Son T
• Application Number:
  US13/826,436
• Publication Number:
  US 20140214856A1
• Time in Patent Office: 887 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 16/113 Details of archiving lifecycle management in storage systems G06F3/0649; backup systems G06F11/1446
• CPC Class Codes: G06F 16/128 Details of file system snapshots on the file-level, e.g. snapshot creation, administration, deletion use of snapshots for error detection or correction G06F11/14, G06F11/16
• CPC Class Codes: G06F 16/13 File access structures, e.g. distributed indices arrangements of input from, or output to, record carriers G06F3/06
• CPC Class Codes: G06F 16/168 Details of user interfaces specifically adapted to file systems, e.g. browsing and visualisation, 2d or 3d GUIs query results presentation G06F16/156
• CPC Class Codes: G06F 16/2255 Hash tables
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

A content preview of a content item stored in an online storage system can be viewed on a client device without the content item itself being downloaded to the client device and without the use of software associated with the content item being installed on the client device. Furthermore, data storage and processing requirements can be minimized by creating and storing only one content preview for each unique content item. The content item can be identified by using the content item as a hash key in a hashing algorithm. The resulting unique identifier can be used to search a preview index that lists all created content previews and their location. A content preview is only created if one does not exist. The unique identifier can be used to locate the content preview and return it in response to a preview request by a client device.

Claims

1. A computer-implemented method for providing a content preview comprising:

receiving a request to store a content item in a user account;

splitting, via a processor, the content item into at least a first fixed size block and a second fixed size block, wherein each of the first fixed size block and the second fixed size block contains a unique portion of the content item;

computing a first hash identifier by using at least a part of the unique portion of the first fixed size block as a first hash key in a hashing algorithm;

computing a second hash identifier by using at least a part of the unique portion of the second fixed size block as a second hash key in the hashing algorithm;

generating a block list containing a general hash key created by concatenating the first hash identifier and the second hash identifier;

determining whether the content preview of the content item exists based on the generated block list;

upon a determination that the content preview of the content item does not exist based on the generated block list, creating the content preview of the content item and storing the content preview in the user account.

2. The computer-implemented method of claim 1, further comprising:

creating a new preview entry in a preview index, the preview index comprising a listing of known content previews, wherein the new preview entry comprises the block list and a location of the content preview in a memory.

3. The computer-implemented method of claim 2, wherein the determining whether the preview of the content item exists comprises:

searching the preview index for an existing preview entry matching the block list.

4. The computer-implemented method of claim 1, further comprising:

associating the block list with a content entry for the content item, the content entry including metadata describing the content item.

5. The computer-implemented method of claim 1, further comprising:

receiving, from a client device, a preview request associated with the content item;

identifying the location of the content preview; and

returning, to the client device, the content preview.

6. The computer-implemented method of claim 5, wherein the preview request includes the block list, and wherein the location of the content preview is identified by searching a preview index using the block list.

7. The computer-implemented method of claim 5, wherein the preview request includes data identifying a content entry for the content item, the content entry including the block list, and wherein the location of the content preview is identified by searching a preview index based on the block list.

8. The computer-implemented method of claim 1, wherein the hashing algorithm is referentially transparent.

9. A system for providing a content preview, comprising:

a processor; and

a memory containing instructions that, when executed, cause the processor to;

receive a request to store a content item in a user account;

split the content item into a plurality of fixed size blocks, wherein each fixed size block in the plurality of fixed sized blocks contains a unique portion of the content item;

determine a plurality of hash identifiers, each hash identifier in the plurality of hash identifiers corresponding to a fixed sized block in the plurality of fixed sized blocks, wherein each hash identifier is created using at least a portion of the fixed size block corresponding to the hash identifier as a hash key in a hashing algorithm;

generate a block list containing a general hash key created by concatenating at least the plurality of hash identifiers;

determine whether the content preview of the content item exists based on the generated block list;

upon a determination that the content preview of the content item does not exist based on the generated block list, create the content preview of the content item and store the content preview in the user account.

10. The system of claim 9, wherein the instructions further cause the processor to:

create a new preview entry in a preview index that identifies each content item for which a content preview has been created, wherein the new preview entry includes the block list and a location of the content preview in a memory.

11. The system of claim 10, wherein the determining whether the preview of the content item exists comprises:

searching the preview index for an existing preview entry associated with the block list.

12. The system of claim 9, further comprising:

associating the block list with a content entry for the content item, the content entry including metadata describing the content item.

13. The method of claim 9, wherein the instructions further cause the processor to:

receive, from a client device, a preview request associated with the content item;

identify the location of the content preview; and

return, to the client device, the content preview.

14. The system of claim 13, wherein the preview request includes the block list, and wherein the location of the content preview is identified by searching a preview index based on the block list.

15. The system of claim 13, wherein the preview request includes data identifying a content entry associated with the content item, the content entry including the block list, and wherein the location of the content preview is identified by searching a preview index based on the block list.

16. The system of claim 9, wherein the hashing algorithm returns a unique hash identifier for each unique hash key.

17. A non-transitory computer-readable medium containing instructions for providing a content preview wherein the instructions, when executed by a computing device, cause the computing device to:

receive a request to store a first content item in a first user account, the first content item being split into at least a first fixed size block and a second fixed size block, wherein each of the first fixed size block and the second fixed size block contains a unique portion of the first content item;

compute a first hash identifier using at least a part of the unique portion of the first fixed size block as a first hash key in a hashing algorithm and a second hash identifier using at least a part of the unique portion of the second fixed size block as a second hash key in the hashing algorithm;

generate a block list containing a general hash key created by concatenating the at least the first hash identifier and the second hash identifier;

identify the content preview for the first content item based on the generated block list, wherein the content preview is associated with a second content item in a second user account; and

assigning the content preview to the first content item in the first user account.

18. The non-transitory computer-readable medium of claim 17, wherein identifying a content preview for the first content item comprises:

searching a preview index for an existing preview entry associated with the block list, the preview index comprising a plurality of preview entries, wherein each preview entry in the plurality of preview entries comprises a block list and a location of an assigned content preview in a memory.

19. The non-transitory computer-readable medium of claim 17, wherein the instructions further cause the computing device to:

receive, from a client device, a preview request associated with the first content item;

identify the location of the content preview; and

return, to the client device, the content preview.

20. The non-transitory computer-readable medium of claim 19, wherein the preview request includes the block list, and wherein the location of the content preview is identified by searching a preview index based on the block list.

21. The non-transitory computer-readable medium of claim 19, wherein the preview request includes data identifying a content entry for the content item, the content entry identifying the block list, and wherein the location of the content preview is identified by searching a preview index based on the block list.