Browse Prior Art Database

LIST RETRIEVAL ALGORITHM FOR LOW BANDWIDTH NETWORKS

IP.com Disclosure Number: IPCOM000124555D
Publication Date: 2005-Apr-27
Document File: 6 page(s) / 67K

Publishing Venue

The IP.com Prior Art Database

Abstract

This invention describes an algorithm for list retrieval over a low bandwidth network.

This text was extracted from a Microsoft Word document.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 52% of the total text.

                                       

                                                                                Attorney Docket No. 2005J04738US

TITLE:         LIST RETRIEVAL ALGORITHM FOR LOW BANDWIDTH NETWORKS

Author:                    Loveleen Chadha,

San Diego

,

CA

Owner:                    Siemens Communications, Inc.,

Boca Raton

,

Florida

List Retrieval Algorithm for Low Bandwidth Networks

Abstract: This invention describes an algorithm for list retrieval over a low bandwidth network.

Background Information:

Applications often retrieve lists of names from a server and display them on a client device. Users have to often wait annoyingly while the device is retrieving a big list over a low bandwidth connection.

For example, if you try to access a remote drive/folder over a WAN link, it takes a considerable amount of time for Windows Explorer software to display/refresh the list of folders/files. You may need to wait a couple of minutes before the display gets updated. Windows Explorer software tries to fetch each folder/file name completely before the name is displayed. The user experience can be improved if the Windows Explorer software quickly fetches just a partial/small portion of the name and displays it immediately. It can continue to fetch the remaining portion of the name in the background.

This invention describes an algorithm for retrieving the lists in multiple steps in such a way that the text on an entry in the list is initially partially retrieved and the remaining portion is retrieved later. This helps create a quick display of the list with partial names.

Details:

For ease of explanation, the following list of names is used.

Bill Jones

Billy Smith

Bob Smith

Dave Green

Jane Doe

John Doe

John Johnson

Mary Jones

Mary Smith

Susan Brown

Susannah Green

 

Embodiment 1: First N characters

As per this embodiment, this list is retrieved in multiple fetch operations. Each name in the list is split into two part. In step 1, the first N characters of all the names are fetched. Assuming N=4, after step 1, the sample list will look like –

Bill

Bill

Bob

Dave

Jane

John

John

Mary

Mary

Susa

Susa

The device can show this list to the end-user while it executes the step-2 activities in the background.

In step-2, the remaining portion of the names are fetched

Step-1

Step-2

Bill

 Jones

Bill

y Smith

Bob

 Smith

Dave

 Green

Jane

 Doe

John

 Doe

John

 Johnson

Mary

 Jones

Mary

 Smith

Susa

n Brown

Susa

nnah Green

 

 

Now the device can show the complete names to the end-user.

The number of steps & the size of the text retrieved in each step may vary from one application to another.  For example, it could be 5 + 7 + remaining portion or 4 + 5 + 7 + remaining portion.

Embodiment 2: Smallest Unique Prefixes

One of the key shortcoming in embodiment-1 is that the list may show lots of identical entries after step-1. In the previous example, it shows multiples of “Mary”, “Bill”, and “Susa” .

Bill

Bill

Bob

Dave

Jan...