This disclosure relates in general to methods and systems for content delivery and management, and more particularly, to methods and systems of managing content at a network site through complex records and compound objects and their relationships and dependencies. Even more particularly, based on the relationships and dependencies, embodiments disclosed herein can determine an order of actions consistent with integrity constraints and policy considerations.
Content management at web sites is becoming increasingly complicated as more content is used at those web sites. Companies are finding that managing the content is proving to be a daunting task. Site builders are moving toward database-driven sites, where pages are generated on demand. Two products that may be used with database-driven content are Castor and TopLink®. TopLink is a registered trademark owned by Oracle International Corporation of Redwood City, Calif., U.S.A.
Castor, also referred to as The Castor Project which was started and originally developed by Keith Visco and Assaf Arkin of Intalio, Inc., is an open source data-binding framework for Java® to provide a path between Java objects, eXtensible Markup Language (“XML”) documents, and Structured Query Language (“SQL”) tables. Java® is a registered trademark owned by Sun Microsystems, Inc. of Mountain View, Calif., U.S.A. Castor can be used to produce java objects, given some underlying persistent substrate. A distinguishing architectural feature of Castor is that it has a pluggable, underlying architecture, so it can have different persistence frameworks. A mechanism is used for describing to the Castor framework what the persistence will be.
TopLink™ provides developers with the flexibility to map objects and Enterprise Java Beans (“EJBs”) to a relational database schema. Effectively, TopLink™ is an object relational bridge. The basic idea is that an object-oriented model of data is provided, and then the object-oriented model gets transformed into a purely relational model. More specifically, TopLink™ can take the object-oriented model and map it onto relational tables.
A need exists for a new generation of content management software that is “backwards compatible.” That is, content management software that can be used without having to re-write existing applications or changing pre-existing data at a network site.
A method and system can be used to manage content using complex records and compound objects. The method and system can be used to determine relationships between objects, determine which of those relationships are significant for a specific action, and determine physical dependencies between the objects. The method and system can be used to perform actions consistent with integrity constraints, and therefore, performs the actions in the correct order with a reduced likelihood of errors. The method and system are highly beneficial in that they can significantly enhance content management and can be implemented without having to write new or edit existing applications. Also, existing content data may be used without any changes.
In one set of embodiments, the method of using content at a network site can comprise determining a relationship between an object and other data that is referenced by or references the object. The object and other data may be managed by a content manager software component. The method can also comprise determining an order in which an action is to be performed on the object and the other data based upon a physical dependency between the object and the other data. The method can further comprise performing an action on the object and other data in response to determining the order.
In another set of embodiments, a data processing system readable medium can have code embodied therein. The code can comprise an instruction for reading information for a content type and an instruction for generating a structured definition of the content type using the information.
The foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure, as defined in the appended claims.
The present disclosure is illustrated by way of example and not limitation in the accompanying figures.
Skilled artisans appreciate that elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. For example, the dimensions of some of the elements in the figures may be exaggerated relative to other elements to help to improve understanding of embodiments of the present disclosure.
Reference is now made in detail to the exemplary embodiments of the disclosure, examples of which are illustrated in the accompanying drawings. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts (elements).
A method and system can be used to manage content using complex records and compound objects. The method and system can be used to determine relationships between objects, determine which of those relationships are significant for a specific action, and determine physical dependencies between the objects. The method and system can be used to perform actions consistent with integrity constraints, and therefore, performs the actions in the correct order with a reduced likelihood of errors. The method and system are highly beneficial in that they can significantly enhance content management and can be implemented without having to write new or edit existing applications. Also, existing content data may be used without any changes.
A few terms are defined or clarified to aid in understanding the descriptions that follow. A network includes an interconnected set of server and client computers over a publicly available medium (e.g., the Internet) or over an internal (company-owned) system. A user at a client computer may gain access to the network using a network access provider. An Internet Service Provider (“ISP”) is a common type of network access provider.
The term “complex record” is intended to mean a single logical entity that may comprise more than one row in more than one table within a database.
The term “software component” is intended to mean at least a portion of a computer program (i.e., a software application). Examples include a content delivery software component, a content management software component, or the like. Different software components may reside in the same computer program or in different computer programs on the same computer or different computers.
As used herein, the terms “comprises,” “comprising,” “includes,” “including,” “has,” “having” or any other variation thereof, are intended to cover a non-exclusive inclusion. For example, a method, process, article, or apparatus that comprises a list of elements is not necessarily limited to only those elements but may include other elements not expressly listed or inherent to such method, process, article, or apparatus. Further, unless expressly stated to the contrary, “or” refers to an inclusive or and not to an exclusive or. For example, a condition A or B is satisfied by any one of the following: A is true (or present) and B is false (or not present), A is false (or not present) and B is true (or present), and both A and B are true (or present).
Before discussing embodiments of the present disclosure, an exemplary hardware architecture for using embodiments of the present disclosure is described.
Within each of CDS 140 and CMS 160, a plurality of computers (not shown) may be interconnected to each other over internal network 15 or a combination of internal and external networks. For simplification, a single system is shown for each of CDS 140 and CMS 160. Other systems (e.g., page generator, application server, etc.) may be part of CDS 140, CMS 160, or additional systems that are bi-directionally coupled to the internal network 15.
A plurality of other client computers 120 may be bi-directionally coupled to external network 11, and a plurality of actor computers 180 may be coupled to internal network 15. Actor computers 180 may include personal computers or workstations for individuals that use internal network 15. These individuals may include content developers, editors, content reviewers, webmasters, information technology specialists, and the like. Many other alternative configurations are possible and known to skilled artisans.
Client computer 120 can include central processing unit (“CPU”) 122, read-only memory (“ROM”) 124, random access memory (“RAM”) 126, hard drive (“HD”) or storage memory 128, and input/output device(s) (“I/O”) 129. I/O 129 can include a keyboard, monitor, printer, electronic pointing device (e.g., mouse, trackball, etc.), or the like. Client computer 120 can include a desktop computer, a laptop computer, a personal digital assistant, a cellular phone, or nearly other device capable of communicating over a network. Actor computer 180 may be similar to client computer 120 and can comprise CPU 182, ROM 184, RAM 186, HD 188, and I/O 189.
CDS 140 can include a server computer comprising CPU 142, ROM 144, RAM 146, HD 148, and I/O 149, and CMS 160 can include a server computer comprising CPU 162, ROM 164, RAM 166, HD 168, and I/O 169. CDS 140 or CMS 160 may have one or more of a content delivery software component, a page generator software component, the content management software component, an applications software component, and the like.
Each of the computers in
Each of computers 120, 140, 160, and 180 is an example of a data processing system. ROM 124, 144, 164, and 184; RAM 126, 146, 166, and 186; HD 128, 148, 168, and 188; and databases 13, 17, and 19 can include media that can be read by CPU 122, 142, 162, or 182. Therefore, each of these types of memories includes a data processing system readable medium. These memories may be internal or external to computers 120, 140, 160, or 180.
Portions of the methods described herein may be implemented in suitable software code that may reside within ROM 124, 144, 164, or 184, RAM 126, 146, 166, or 186, or HD 128, 148, 168, or 188. In addition to those types of memories, the instructions in an embodiment of the present disclosure may be contained on a data storage device with a different data processing system readable storage medium, such as a hard disk.
In an illustrative embodiment of the disclosure, the computer-executable instructions may be lines of compiled C++, Java, or other language code. Other architectures may be used. For example, the functions of any one of the computers may be performed by a different computer shown in
In the hardware configuration above, the various software components (e.g., content delivery, page generator, content management, or the like) may reside on a single server computer or on any combination of separate server computers. In alternative embodiments, some or all of the software components may reside on the same server computer. For example, the content delivery software component and the page generator software component could reside on the same server computer.
Communications between any of the computers in
Before addressing the methodology, an exemplary organization of data is presented. Note that system metadata 32 on the CMS side is separated from customer content data 34 as shown in
Attention is now directed to
Note that not all of the activities described in the process flow diagram are required, that an element within a specific activity may not be required, and that further activities may be performed in addition to those illustrated. After reading this specification, skilled artisans will be capable of determining what activities can be used for their specific needs.
Before defining the content types, a user may need to understand the physical mapping of the database(s) that will be used. If the data already exists, a user may need to determine, in a reverse sense, what description that properly captures the relationships among the tables that already exist. Such information may be useful in defining the content types.
Attention is now directed to details of using content at a network site. The description will be given in conjunction with the process flow diagram in
Referring to
The content types should be defined in the proper order. More specifically, base or leaf content types should be defined before composite content types. The base or leaf content types do not refer to any other content type, whereas a composite content type refers to at least one other content type. Simply put, the base or leaf content type should exist for it to be referenced by a composite content type. The content types may include references to one or more content types. Information regarding the content types will be addressed later in this specification.
In one example, a content type of “article” can include a title, an author, an image, and text attributes. The title, image, and text may be at leaf nodes and not refer to any other objects. The author may come from an author table within database 17 or 19 and may also be a content type. Therefore, an article content type can be a composite content type because it refers to another content type, namely an author content type. The author content type should be created before the article content type to comply with referential integrity constraints.
The attributes may be used to locate referenced objects, files, and records. One of the attributes may reference a file. If so, the reference can be the file name for the file. For a record from a table in one of the databases 17 or 19, the reference can include a reference to a database and the column with primary keys for the database table.
Part of defining content types may include annotating policy information. Predefined policies may be used for deployment, promotion, demotion, packaging, and potentially other purposes may be within the annotations. CMS 160 may include business rules for acting on records, files, and objects to ensure that referential integrity constraints are met. Using the relationship and policy information, CMS 160 may determine which, if any, references are relevant for a particular purpose, as will be explained below in more detail.
Depending on the policy, different sets of data objects may be significant or insignificant to a particular data object based on the action being considered. Deployment of a proxy object may affect one set of the other data objects (objects lower in the hierarchy or closer to the leaf nodes), whereas, demotion may effect a different set of other data objects (objects higher in the hierarchy or further from the leaf nodes). Therefore, depending on the action, some relationships may be important and others may not.
While this may sound simple, many objects may reference other objects. Therefore, deploying or demoting a data object may cause unintended complications that are undesired. For example, during deployment, the proxy object being deployed may refer to another data object that does not exist because it has previously been removed or never existed. Conversely, demoting a base or leaf node object may cause other consequences for compound objects that include the base or leaf node object.
All of the file, records, and objects within the current object may be thought of as nodes that constitute a graph and reference relationships are represented as the arcs of the graph. The arcs may be thought of as being different colors for the different annotations for the various functions (e.g., deployment, demotion, etc.). CMS 160 can traverse the graph and return all the nodes that are encountered for a specific color of arcs. The order of execution for a set of nodes may be a function of the policy being used. Referential integrity constraints between the table for the peripheral row and the primary table of the referenced object may be examined. If there are integrity constraints that need to be enforced, CMS 160 takes that into account when doing the traversal. For deployment, the referenced object should precede the referring object in the ordering result that CMS 160 returns from the traversal.
In addition to logical relationships, physical dependencies may be important. If the order is followed, the integrity constraints in the database will not be violated. Referential integrity constraints in databases should be maintained and are most commonly typified by what are called foreign key-primary key constraints. For example, two different tables may be used. A referenced table has a primary key, and a referencing table has a foreign key with the value of the primary key in the referenced table. If rows are to be inserted into both tables, the referenced table gets its row before the referencing table gets its corresponding row. Performing the insertion in the reverse order violates the integrity restraints. In this manner, a user can describe the data, and CMS 160 will make sure that data gets shepherded properly from stage to stage. Such automation can allow almost any employee of a company to enter data and perform operations without having to address low-level programming concerns.
A similar concept may hold when objects are rendered or checked for validation depending upon the action to be taken. For example, Object 1 may reference Object 2, and Object 2 may reference Object 3. However, only one of those relationships is relevant to a deployment policy. Deployment of Object 1 may depend on Object 2. The fact that Object 1 references Object 3 may be irrelevant for the purposes of deployment. The policy controls which referenced objects should be operated on when performing a function, such as deployment.
The method may comprise reading XML data for the content instances and the content types (block 522). Content types need to be registered with CMS 160.
The method can include instantiating proxy objects (block 542). The proxy object can stand in for actual content. The proxy object may be used by an actor at actor computer 180 to access content within database 17 or 19 as managed by CMS 160.
Continuing with the article content type, a content contributor at actor computer 180 may instantiate an article proxy object using the article content type. CMS 160 can use the article content type XML file that was previously generated to determine what information the article proxy object will have (attributes), how to manage the article proxy object and potentially other information.
A variation can occur where the object already exists. For example, the CMS object may already exist but the data within the object needs to be changed. Creating a proxy object can be bypassed because the CMS object already exists. As used hereinafter, “current object” will refer to the proxy object or CMS object that is being generated.
The method can further comprise examining the data from the current object to infer relationships to records, files, and other objects needed by the current object (block 544 in
Inferring relationships causes a significant usability improvement for people who are writing applications against the virtual content management. Existing applications that create and modify data in the content database need little or no modification. They can continue to work with the content tables just as they did before. If changes to the data are made, the application (or potentially another source) needs only tell CMS 160 which objects changed. CMS 160 can recompute all of the reference relationships it needs to. This can free the application from needing to know exactly what relations might be involved, which in turn means that the application programmer does not need to know all of those references (or modify the program if new reference definitions are introduced).
Referring to the article embodiment, CMS 160 can use the article content type and article proxy object to determine the relationship between the article proxy object and its constituent data objects (title, author, image, and text). The title, image, and text may be data objects that do not refer to any other objects, and therefore, are at leaf node positions. The author may be an object that references a record within database 17 or 19. The record within the database may be a leaf node, with the author object being a parent node to the record, and the article proxy object being the parent node to the title, author, image, and text data.
The method can also comprise determining an order in which actions are to be taken based upon on physical dependencies (block 604). The determination may be made by analyzing the annotated policy information previously described. Actions should be performed in an order so that a validation checking software component should not encounter an invalid situation (e.g., a reference to a record that does not yet exist). The physical dependency determination helps to ensure that the information of lower-level data (referenced data) exists before the testing and validation of a higher-level object (referencing object) begins.
The method can still further include performing the action on the affected objects, records, and files based on the physical dependency ordering (block 606). The physical dependency ordering can be used to a reduced likelihood of generating errors for non-existent information or violating validation checks.
Embodiments described herein allow a new solution for content management to be used that is “backwards compatible.” In other words, the content management solution can be implemented without having to write new applications or having to edit existing applications. Also, the content management solution does not require any existing content data to be changed. Therefore, the solution may be integrated into an existing network site is more of a seamless fashion compared to conventional content management system.
Embodiments may allow for better control and management of content at a network site. All objects, records, and files that comprise another object may be examined for inconsistencies between referenced data or other consequences before action is taken.
The foregoing specification has been described with reference to specific embodiments. However, one of ordinary skill in the art appreciates that various modifications and changes can be made without departing from the scope of the present disclosure as set forth in the claims below. Accordingly, the specification and figures are to be regarded in an illustrative rather than a restrictive sense, and all such modifications are intended to be included within the scope of present disclosure.
Benefits, other advantages, and solutions to problems have been described above with regard to specific embodiments. However, the benefits, advantages, solutions to problems, and any element(s) that may cause any benefit, advantage, or solution to occur or become more pronounced are not to be construed as a critical, required, or essential feature or element of any or all the claims.
This application is a continuation of U.S. patent application Ser. No. 13/724,869, filed Dec. 21, 2012, issued as U.S. Pat. No. 9,305,033, entitled “OBJECT BASED CONTENT MANAGEMENT SYSTEM AND METHOD,” which is a continuation of U.S. patent application Ser. No. 13/085,362, filed Apr. 12, 2011, issued as U.S. Pat. No. 8,364,719, entitled “OBJECT BASED CONTENT MANAGEMENT SYSTEM AND METHOD,” which is a continuation of U.S. patent application Ser. No. 10/434,935, filed May 9, 2003, issued as U.S. Pat. No. 7,941,453, entitled “METHOD AND SYSTEM FOR DEPLOYMENT OF CONTENT USING PROXY OBJECTS,” both of which are fully incorporated by reference herein. This application relates to U.S. patent application Ser. No. 10/434,936, filed May 9, 2003, issued as U.S. Pat. No. 7,415,484, entitled “METHOD AND SYSTEM FOR MODELING OF SYSTEM CONTENT FOR BUSINESSES,” which is assigned to the current assignee hereof and incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5418888 | Alden | May 1995 | A |
5539909 | Tanaka | Jul 1996 | A |
5615362 | Jensen | Mar 1997 | A |
5634124 | Khoyi et al. | May 1997 | A |
5806066 | Golshani et al. | Sep 1998 | A |
5930154 | Thalhammer-Reyero | Jul 1999 | A |
6004276 | Wright et al. | Dec 1999 | A |
6006234 | Govindarajan et al. | Dec 1999 | A |
6052691 | Ardoin et al. | Apr 2000 | A |
6065011 | Bulusu et al. | May 2000 | A |
6233730 | Todd et al. | May 2001 | B1 |
6292804 | Ardoin et al. | Sep 2001 | B1 |
6353860 | Hare et al. | Mar 2002 | B1 |
6477628 | Bish | Nov 2002 | B1 |
6490255 | Kiriha et al. | Dec 2002 | B1 |
6640238 | Bowman-Amuah | Oct 2003 | B1 |
6772168 | Ardoin et al. | Aug 2004 | B2 |
6795848 | Border et al. | Sep 2004 | B1 |
6834382 | Marso et al. | Dec 2004 | B2 |
6857053 | Bolik et al. | Feb 2005 | B2 |
6904460 | Raciborski et al. | Jun 2005 | B1 |
6910040 | Emmick et al. | Jun 2005 | B2 |
6938260 | Wason | Aug 2005 | B1 |
6965872 | Grdina | Nov 2005 | B1 |
7092955 | Mah et al. | Aug 2006 | B2 |
7096216 | Anonsen | Aug 2006 | B2 |
7213062 | Raciborski et al. | May 2007 | B1 |
7249197 | Roestenburg et al. | Jul 2007 | B1 |
7290007 | Farber et al. | Oct 2007 | B2 |
7299270 | Kolluri | Nov 2007 | B2 |
7350191 | Kompella et al. | Mar 2008 | B1 |
7428723 | Greene et al. | Sep 2008 | B2 |
7464385 | Ozor et al. | Dec 2008 | B1 |
7496911 | Rowley et al. | Feb 2009 | B2 |
7680818 | Fan | Mar 2010 | B1 |
7908608 | Ozor et al. | Mar 2011 | B2 |
7941453 | Scheevel et al. | May 2011 | B1 |
8051102 | Everett | Nov 2011 | B2 |
8136123 | Ozor et al. | Mar 2012 | B2 |
8364719 | Scheevel et al. | Jan 2013 | B2 |
9305033 | Scheevel et al. | Apr 2016 | B2 |
20010029604 | Dreyband et al. | Oct 2001 | A1 |
20010049732 | Raciborski et al. | Dec 2001 | A1 |
20010051980 | Raciborski et al. | Dec 2001 | A1 |
20010054095 | Kampe et al. | Dec 2001 | A1 |
20020055966 | Border et al. | May 2002 | A1 |
20020099684 | Ardoin et al. | Jul 2002 | A1 |
20020120603 | Thompson | Aug 2002 | A1 |
20020194201 | Wilbanks et al. | Dec 2002 | A1 |
20020194434 | Kurasugi | Dec 2002 | A1 |
20030018616 | Wilbanks et al. | Jan 2003 | A1 |
20030018694 | Chen et al. | Jan 2003 | A1 |
20030041069 | Yorke | Feb 2003 | A1 |
20030050932 | Pace et al. | Mar 2003 | A1 |
20030078934 | Cappellucci | Apr 2003 | A1 |
20030097369 | McKnight | May 2003 | A1 |
20030101286 | Kolluri | May 2003 | A1 |
20030110448 | Haut et al. | Jun 2003 | A1 |
20030126136 | Omoigui | Jul 2003 | A1 |
20030135522 | Doyle | Jul 2003 | A1 |
20030158855 | Farnham et al. | Aug 2003 | A1 |
20030172135 | Bobick et al. | Sep 2003 | A1 |
20030185432 | Hong et al. | Oct 2003 | A1 |
20030195885 | Emmick et al. | Oct 2003 | A1 |
20030200212 | Benson | Oct 2003 | A1 |
20040015487 | Lin et al. | Jan 2004 | A1 |
20040024790 | Everett | Feb 2004 | A1 |
20040046787 | Henry | Mar 2004 | A1 |
20040093331 | Garner | May 2004 | A1 |
20040205493 | Simpson et al. | Oct 2004 | A1 |
20040210607 | Manchanda | Oct 2004 | A1 |
20060265257 | Pulfer | Nov 2006 | A1 |
20090070782 | Ozor et al. | Mar 2009 | A1 |
20100070448 | Omoigui | Mar 2010 | A1 |
20130185334 | Scheevel et al. | Jul 2013 | A1 |
Entry |
---|
“The Castor Project,” Feb. 12, 2003, ExoLab Group, retrieved from http://www.exolab.org, printed Feb. 24, 2003, pgs. |
Toplink increases developer productivity and accelerator application performance by providing the integration between Java applications and relational data, WebGain, Inc., Santa Clara, Ca, 2000-2002, retrieved from http://www.webgain.com/products/toplink, printed Feb. 24, 2003. |
Toplink, Version 4.0, 2001, 23 pp., WebGain, Inc., Santa Clara, Ca. |
Office Action for U.S. Patent Application No. 10/434,935 (VIGN1490), mailed May 29, 2007, 11 pp. |
Office Action for U.S. Patent Application No. 10/434,935 (VIGN1490), mailed Nov. 16, 2007, 18 pp. |
Office Action for U.S. Patent Application No. 10/434,935 (VIGN1490), mailed Apr. 14, 2008, 19 pages. |
Office Action for U.S. Patent Application No. 10/434,935 (VIGN1490), mailed Oct. 01, 2008, 22 pp. |
Office Action for U.S. Patent Application No. 10/434,935 (VIGN1490), mailed Mar. 02, 2009, 22 pp. |
Office Action for U.S. Patent Application No. 10/434,935 (VIGN1490), mailed Sep. 11, 2009, 12 pp. |
Office Action for U.S. Patent Application No. 10/434,935 (VIGN1490), mailed Jan. 29, 2010, 17 pp. |
Office Action for U.S. Patent Application No. 10/434,935 (VIGN1490), mailed Aug. 12, 2010, 15 pp. |
Office Action for U.S. Patent Application No. 10/434,937 (VIGN1620), mailed Mar. 19, 2007, 10 pages. |
Office Action for U.S. Patent Application No. 10/434,937 (VIGN1620), mailed Apr. 8, 2008, 9 pages. |
Office Action for U.S. Patent Application No. 12/272,139 (VIGN1620-1), mailed Jun. 17, 2010, 11 pages. |
Office Action for U.S. Patent Application No. 13/085,362 (VIGN1490-1), mailed May 10, 2012, 17 pgs. |
Office Action for U.S. Patent Application No. 13/724,869 (VIGN1490-2), mailed Oct. 24, 2013, 13 pgs. |
Office Action for U.S. Patent Application No. 13/724,869 (VIGN1490-2), mailed Mar. 24, 2014, 11 pgs. |
Office Action for U.S. Patent Application No. 13/724,869 (VIGN1490-2), mailed Aug. 13, 2014, 13 pgs. |
Office Action for U.S. Patent Application No. 13/724,869 (VIGN1490-2), mailed Jul. 27, 2015, 14 pgs. |
Notice of Allowance for U.S. Patent Application No. 13/724,869 (VIGN1490-2), mailed Nov. 23, 2015, 5 pgs. |
Number | Date | Country | |
---|---|---|---|
20160179873 A1 | Jun 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13724869 | Dec 2012 | US |
Child | 15057525 | US | |
Parent | 13085362 | Apr 2011 | US |
Child | 13724869 | US | |
Parent | 10434935 | May 2003 | US |
Child | 13085362 | US |