Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1998-10-16
2001-05-08
Sheikh, Ayaz (Department: 2155)
Data processing: database and file management or data structures
Database design
Data structure types
C709S203000, C709S219000
Reexamination Certificate
active
06230165
ABSTRACT:
FIELD OF THE INVENTION
The present invention relates in general to the accessing of information that is stored on a network server. In particular, the present invention relates to the packaging and transport of information using a method that decreases the amount of network bandwidth required.
BACKGROUND OF THE INVENTION
Traditionally, information on a computer network is transported using a protocol that is understood by the various parties involved. Many of these protocols have evolved as efficient solutions to particular communications problems. Therefore, communications as dictated by the protocol varies as the characteristics of the data and its handling change. Most applications and protocols in operation today are constructed to efficiently process information. That is to say, the emphasis has been placed on the use of system bound resources such as disk space, memory and processor speed. In recent years the focus has moved from system bound resources to the network as a resource. This resource constraint is most evident in wireless networks where bandwidth is limited. While protocols have been developed to improve bandwidth utilization in wireless networks, these protocols improve efficiency using gross methodologies that address network utilization in a general, yet limited way.
SUMMARY AND OBJECTS OF THE INVENTION
It is a primary object of the present invention to apply methodologies at the highest levels of the protocol chain to improve efficiency of communications in bandwidth constrained networks. The present invention accomplishes this objective by involving the application in the goal of reducing the bandwidth required. This involvement is realized in two ways: data representation, and communication of the data representation between client and server applications.
The present invention stores data in a card and stack arrangement. A card is a database record that can be added, modified and deleted. A stack is a logical collection of cards. Essentially, a stack is also a type of data base record and is therefore also a type of card. A logical collection of stacks is therefore another stack. Therefore stacks may logically contain other or sub stacks.
A schema object known as a “card form” describes cards. A card form consists of value specifications that describe the type and format of individual data items represented in an associated card.
A schema object known as a stack form describes stacks. A stack form consists of column schema and column maps. The column schema and column maps describe the organization of a stack based on the stack form. The column schema defines a column in associated stacks. Any value associated with a column implies overview information. Each column map associates the value specifications of a particular card form to a column schema of the stack form. Therefore, this mapping associates values of a card to a column of a stack that refers to it. From a stack prospective, this association determines the values of a card providing an overview. Only overview values are required when viewing a card through an associated stack. An understanding of these relationships allows the present invention to algorithmically determine which values of a card that must be current from a stack's prospective.
Cards include a collection of card deltas that describe the value of one or more card fields at a particular time of change.
Stacks consist of a collection of stack deltas. Stack deltas describe the addition, modification and removal of a given card at a particular time of change.
By using the structures defined above, it is possible to maintain synchronicity between a client and server version of a database containing stacks and cards by transferring individual deltas. Furthermore, by using column schema and column maps it is possible to maintain card deltas in an overview state: alleviating the need to send potentially large values stored in a card delta until the details of the card are required.
When information is initially entered into the server database, it is stored in cards and stacks. As clients request information from the server, they incrementally replicate the portions of the server's database according to interest. The replicated information is stored in the client's personal database until it is algorithmically determined that it is no longer advantageous to do so.
The client uses a pull model transfer to extract information from the server's database. Using the present invention, the transfer of information is achieved by the client's database using four protocol primitives: add, get, refresh and delete. The client's database makes these requests on behalf of the application in sympathy to the application's making request of the database that cannot be directly satisfied. The protocol primitives are directed to the servers database broker.
When the data in the server database is to be updated, the original data is not modified, but instead additional data is added in the form of deltas that indicate which portion of the old data is to be replaced. When the client again requests the same data, only the new deltas are retrieved. Using this method the client application need not request unchanged information multiple times.
The following scenario describes the flow of information into a stack, where the flow of information is unknown to the client database.
Via an end-user interface the user navigates to a stack (e.g., e-mail list).
The client database not recognizing the stack, makes a request of the server broker.
The broker looks up the stack in the server database and replies to the client database with the complete object.
The client, not recognizing the stack form associated with the stack, makes a request of the server broker.
The broker looks up the stack form in the server database and replies to the client database.
For each card indicated by the stack, the client application will be required to get the cards in their overview state according to how their card form maps into the columns via the column map (e.g., most likely all fields except for the body of the e-mail message).
The broker will respond to the overview request for each card.
The client may now display the stack in whatever way is appropriate.
The end-user indicates a desire to see the details of a particular card on the stack (e.g., read an e-mail message).
The client database makes a request to the broker for the particular cards delta based on the known delta level.
The broker responds with the remaining fields of the card (e.g., the body of the e-mail message).
The above-mentioned features of the present invention and the features explained below may be used not only in the described combinations, but the features can also be used individually and/or in other combinations within the scope of the present invention.
The various features of novelty which characterize the invention are pointed out with particularity in the claims annexed to and forming a part of this disclosure. For a better understanding of the invention, its operating advantages and specific objects attained by its uses, reference is made to the accompanying drawings and descriptive matter in which preferred embodiments of the invention are illustrated.
REFERENCES:
patent: 5706435 (1998-01-01), Barbara et al.
patent: 5734898 (1998-03-01), He
patent: 5829001 (1998-10-01), Li et al.
patent: 5857203 (1999-01-01), Kauffman et al.
patent: 5870759 (1999-02-01), Bauer et al.
patent: 5895471 (1999-04-01), King et al.
patent: 5898836 (1999-04-01), Freivald et al.
patent: 5931904 (1999-08-01), Banga et al.
patent: 5946697 (1999-08-01), Shen
patent: 5991760 (1999-11-01), Gauvin et al.
patent: 5999947 (1999-12-01), Zollinger et al.
patent: 6003087 (1999-12-01), Housel, III et al.
patent: 6119155 (2000-09-01), Rossmann et al.
Tim Hylan, Unwired Planet, “Handheld Device Markup Language FAQ”, http://www.w3.org/TR/, Apr. 1997, 4 pages.*
Peter King et al. ed., Unwired Planet, “Handheld Device Markup Language Specification”, http://www.w3.org/TR/, May 1997, 33 pages.
Cerulean
McGlew and Tuttle , P.C.
Sheikh Ayaz
Winder Patrice
LandOfFree
Method for encoding and transporting database objects over... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for encoding and transporting database objects over..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for encoding and transporting database objects over... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2512111