Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2007-04-17
2007-04-17
Abel-Jalil, Neveen (Department: 2165)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
09672675
ABSTRACT:
A system and method for implementing a conditional payload server are provided. A request for a payload corresponding to a subset of client attributes is obtained. Additionally, one or more payloads are obtained in which each payload defines criteria for delivering the payload. The criteria for delivering each payload is then embodied into an expression tree, which is scored and optimized for traversal. The expression tree is converted into an evaluation tree data structure in which the conjunctive and disjunctive operators are the tree nodes and attribute evaluator value expressions are the leaf nodes. The expression tree is merged into a catalog data structure having a master attribute list, an evaluator list, a value list, a payload list, and a conjunction list. The catalog is then evaluated according to the subset of client attributes corresponding to the payload request and a payload is delivered.
REFERENCES:
patent: 5664172 (1997-09-01), Antoshenkov
patent: 5806061 (1998-09-01), Chaudhuri et al.
patent: 6334125 (2001-12-01), Johnson et al.
patent: 6411952 (2002-06-01), Bharat et al.
patent: 6424967 (2002-07-01), Johnson et al.
patent: 2003/0037041 (2003-02-01), Hertz
patent: 0 435 476 (1991-07-01), None
patent: WO 00/33228 (2000-06-01), None
Auletta, V., et al., “Placing Resources in a Tree: Dynamic and Static Algorithms,”Proceedings of 22nd Int'l Coloquium on Automata, Languages, and Programming, Szeged, Hungary, Jul 10-14, 1995, pp. 232-243.
Cheng, C., et al., “A Protocol to Maintain a Minimum Spanning Tree in a Dynamic Topology,”Computer Communication Review18(4):330-337, 1988.
Courant, M., and S. Robin, “Classified Advertisement Analysis in the Context of Expert System in Ad Matching,”The Natural Language Understanding and Logic Programming: Proceedings of First International Workshop, Rennes, France, 1985, pp. 33-47.
Ester, M., et al., “The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses,”Proceedings of the 16th International Conference on Data Engineering, San Diego, California, Feb. 29-Mar. 3, 2000, pp. 379-388.
Fisette, P., et al., “Minimal Dynamic Characterization of Tree-Like Multibody Systems,”Nonlinear Dynamics 9(1-2):165-184, Feb. 1996.
Goczyla, K., “Extendible Partial-Order Tree: A Dynamic Structure for Indexing on Multivalued Attributes,”Proceedings of the 20th International Conference on Information Technology Interfaces, Pula, Croatia, Jun. 16-19, 1998, pp. 317-322.
Hu, D., et al., “Hierarchical Recognition Methods for Multi-Class Objects—Dynamic Binary Tree and Dynamic Multi-Branch Tree,”Proceedings of the 1996 3rd International Conference on Signal Processing, Beijing, China, Oct. 10-18, 1996, pp. 1284-1287.
Huang, J., “The Dynamic OverView Tree,”Proceedings ofICYCS'99: Fifth Int'l Conference for Young Computer Scientists, Advances in Computer Science and Technology, Nanjing, China, Aug. 17-20, 1999, vol. 1, pp. 432-434.
Kutten, S., and A. Porat, “Maintenance of a Spanning Tree in Dynamic Networks,”13th International Symposium on Distributed Computing, Bratislava, Slovakia, Sep. 27-29, 1999, pp. 342-355.
Abel-Jalil Neveen
Christensen O'Connor Johnson & Kindness PLLC
Microsoft Corporation
LandOfFree
System and method for implementing a conditional payload server does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for implementing a conditional payload server, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for implementing a conditional payload server will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3794270