Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2008-09-02
2008-09-02
Vo, Tim (Department: 2168)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
11117807
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 payload(s) is obtained in which each payload defines criteria for delivering the payload. The criteria for delivering each payload are then embodied into an expression tree that 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: 7206774 (2007-04-01), Thompson
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 the 22nd Int'l Colloquium 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,”Proceedings of SIGCOMM '88 Symposium: Communications Architectures and Protocol, Stanford, Calif., Aug. 16-19, 1988, pp. 330-338.
Courant, M., and S. Robin, “Classified Advertisement Analysis in the Context of an Expert System in Ad Matching,”Proceedings of the First Int'l Workshop on Natural Language Understanding and Logic Programming, Rennes, France, Sep. 18-20, 1984, pp. 33-47.
Ester, M., et al., “The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses,”Proceedings of the 16th International Conf. on Data Engineering, IEEE Computer Society, San Diego, Calif., Feb. 28-Mar. 3, 2000, pp. 379-388.
Fisette, P., et al., “Minimal Dynamic Characterization of Tree-Like Multibody Systems” (abstract),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 Int'l Conf. 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 Int'l Conf. on Signal Processing, Beijing, China, Oct. 14-18, 1996, pp. 1284-1287.
Jianbo, H., “The Dynamic OverView Tree” (abstract),Proceedings of the 5th Int'l Conf. for Young Computer Scientists, Nanjing, China, Aug. 17-20, 1999, pp. 432-434.
Kutten, S., and A. Porat, “Maintenance of a Spanning Tree in Dynamic Networks,”Proceedings of the 13th Int'l Symposium on Distributed Computing, Bratislava, Slovak Republic, Sep. 1999, pp. 342-355.
Christensen O'Connor Johnson & Kindness PLLC
Microsoft Corporation
Mobin Hasanul
Vo Tim
LandOfFree
Method and apparatus for implementing a conditional payload... 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 and apparatus for implementing a conditional payload..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for implementing a conditional payload... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3910090