Federated management of content repositories

Information

  • Patent Grant
  • 8099779
  • Patent Number
    8,099,779
  • Date Filed
    Friday, August 29, 2008
    16 years ago
  • Date Issued
    Tuesday, January 17, 2012
    12 years ago
Abstract
A method for integrating a plurality of content repositories into a virtual content repository (VCR), comprising providing credential information to each one of said plurality of content repositories, receiving authorization information from each one of said plurality of content repositories, wherein the authorization information indicates whether or not an authorization procedure succeeded, integrating into the VCR each one of said plurality of content repositories whose authorization information indicates successful authorization, and wherein each one of said plurality of content repositories exposes a first set of services to enable its integration into the VCR.
Description
COPYRIGHT NOTICE

A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.


FIELD OF THE DISCLOSURE

The present invention disclosure relates to content management, and in particular, a system and method for integrating disparate content repositories.


BACKGROUND

Content repositories manage and provide access to large data stores such as a newspaper archives, advertisements, inventories, image collections, etc. A content repository can be a key component of a Web application such as a Web portal, which must quickly serve up different types of content in response to a particular user's requests. However, difficulties can arise when trying to integrate more than one vendor's content repository. Each may have its own proprietary application program interface (API), conventions for manipulating content, and data formats. Performing a search across different repositories, for example, could require using completely different search mechanisms and converting each repository's search results into a common format. Furthermore, each time a repository is added to an application, the application software must be modified to accommodate these differences.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is an illustration of a virtual content management framework in one embodiment of the invention.



FIG. 2 is an illustration of functional layers in one embodiment of the invention.



FIG. 3 is an illustration of objects used in connecting a repository to a virtual content repository in one embodiment of the invention.



FIG. 4 is an exemplary content model in one embodiment of the invention.



FIG. 5 is an exemplary service model in one embodiment of the invention.



FIG. 6 is an illustration of NodeOps service interaction in one embodiment of the invention.



FIG. 7 is an illustration of a virtual content repository browser in one embodiment of the invention.



FIG. 8 is an illustration of a content editor in one embodiment of the invention.



FIG. 9 is an illustration of a schema editor in one embodiment of the invention.



FIG. 10 is an illustration of a property editor in one embodiment of the invention.





DETAILED DESCRIPTION

The invention is illustrated by way of example and not by way of limitation in the figures of the accompanying drawings in which like references indicate similar elements. It should be noted that references to “an” or “one” embodiment in this disclosure are not necessarily to the same embodiment, and such references mean at least one.


In the following description, various aspects of the present invention will be described. However, it will be apparent to those skilled in the art that the present invention may be practiced with only some or all aspects of the present invention. For purposes of explanation, specific numbers, materials and configurations are set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that the present invention may be practiced without the specific details. In other instances, well-known features are omitted or simplified in order not to obscure the present invention.


Parts of the description will be presented in data processing terms, such as data, selection, retrieval, generation, and so forth, consistent with the manner commonly employed by those skilled in the art to convey the substance of their work to others skilled in the art. As well understood by those skilled in the art, these quantities take the form of electrical, magnetic, or optical signals capable of being stored, transferred, combined, and otherwise manipulated through electrical and/or optical components of a processor and its subsystems.


Various operations will be described as multiple discrete steps in turn, in a manner that is most helpful in understanding the present invention, however, the order of description should not be construed as to imply that these operations are necessarily order dependent. In particular, these operations need not be performed in the order of presentation.


Various embodiments will be illustrated in terms of exemplary classes and/or objects in an object-oriented programming paradigm. It will be apparent to one skilled in the art that the present invention can be practiced using any number of different classes/objects, not merely those included here for illustrative purposes. Furthermore, it will also be apparent that the present invention is not limited to any particular software programming language or programming paradigm.



FIG. 1 is an illustration of a virtual content management framework in one embodiment of the invention. A content repository 108 is a searchable data store. Such systems can relate structured content and unstructured content (e.g., digitally scanned paper documents, eXtensible Markup Language, Portable Document Format, Hypertext Markup Language, electronic mail, images, video and audio streams, raw binary data, etc.) into a searchable corpus. Content repositories can be coupled to or integrated with content management systems. Content management systems provide for content life cycle management (e.g. versioning), content review and approval, automatic content classification, event-driven content processing, process tracking and content delivery to other systems. For example, if a user fills out a loan application on a web portal, the web portal can forward the application to a content repository which, in turn, can contact a bank system, receive notification of loan approval, update the loan application in the repository and notify the user by rendering the approval information in a format appropriate for the web portal.


A virtual or federated content repository (hereinafter referred to as “VCR”) 100 is a logical representation of one or more individual content repositories 108 such that they appear and behave as a single content repository from an application program's 110 standpoint. This is accomplished in part by use of an API (application program interface) 104 and an SPI (service provider interface) 102. An API describes how an application program, library or process can interface with some program logic or functionality. By way of a non-limiting illustration, a process can include a thread, a server, a servlet, a portlet, a distributed object, a web browser, or a lightweight process. An SPI describes how a service provider (e.g., a content repository) can be integrated into a system of some kind. SPI's are typically specified as a collection of classes/interfaces, data structures and functions that work together to provide a programmatic means through which a service can be accessed and utilized. By way of a non-limiting example, APIs and SPIs can be specified in an object-oriented programming language, such as Java™ (available from Sun Microsystems, Inc. of Mountain View, Calif.) and C# (available from Microsoft Corp. of Redmond, Wash.). The API and SPI can be exposed in a number of ways, including but not limited to static libraries, dynamic link libraries, distributed objects, servers, class/interface instances, etc.


In one embodiment, the API presents a unified view of all repositories to application programs and enables them to navigate, perform CRUD (create, read, update, and delete) operations, and search across multiple content repositories as though they were a single repository. Content repositories that implement the SPI can “plug into” the VCR. The SPI includes a set of interfaces and services that repositories can implement and extend including schema management, hierarchy operations and CRUD operations. The API and SPI share a content model 106 that represents the combined content of all repositories 108 as a hierarchical namespace of nodes (or hierarchy). Given a node N, nodes that are hierarchically inferior to N are referred to as children of N whereas nodes that are hierarchically superior to N are referred to as parents of N. The top-most level of the hierarchy is called the federated root. There is no limit to the depth of the hierarchy.


In one embodiment, content repositories can be children of the federated root. Each content repository can have child nodes. Nodes can represent hierarchy information or content. Hierarchy nodes serve as a container for other nodes in the hierarchy akin to a file subdirectory in a hierarchical file system. Content nodes can have properties. In one embodiment, a property associates a name with a value of some kind. By way of a non-limiting illustration, a value can be a text string, a number, an image, an audio/visual presentation, binary data, etc. Either type of node can have a schema associated with it. A schema describes the data type of one or more of a node's properties.



FIG. 2 is an illustration of functional layers in one embodiment of the invention. API 200 is layered on top of SPI 202. The SPI layer isolates direct interaction with repositories 212 from the API. In one embodiment, this can be accomplished at run-time wherein the API library dynamically links to or loads the SPI library. In another embodiment, the SPI can be part of a server process such that the API and the SPI can communicate over a network. The SPI can communicate with the repositories using any number of means including, but not limited to, shared memory, remote procedure calls and/or via one or more intermediate server processes.


Referring again to FIG. 2 and by way of a non-limiting example, content mining facilities 204, portlets 206, tag libraries 208, applications 210, and other libraries 218 can all utilize the API to interact with a VCR. Content mining facilities can include services for automatically extracting content from the VCR based on parameters. Portlet and Java ServerPages™ tag libraries enable portals to interact with the VCR and surface its content on web pages. (Java ServerPages is available from Sun Microsystems, Inc.) In addition, application programs and other libraries can be built on top of the API.


In one embodiment, the API can include optimizations to improve the performance of interacting with the VCR. One or more content caches 216 can be used to buffer search results and recently accessed nodes. Content caches can include node caches and binary caches. A node cache can be used to provide fast access to recently accessed nodes. A binary cache can be used to provide fast access to the data associated with each node in a node cache. The API can also provide a configuration facility 214 to enable applications, tools and libraries to configure content caches and the VCR. In one embodiment, this facility can be implemented as a Java Management Extension (available from Sun Microsystems, Inc.). Exemplary configuration parameters are provided in Table 1.









TABLE 1





Exemplary Configuration Parameters


CONFIGURATION PARAMETERS

















Active state for a binary cache of a repository (i.e., turn the



cache on or off).



Maximum number of entries for a binary cache of a repository.



Time-to-live for entries in a binary cache of a repository.



Repository name.



Active state for a node cache of a repository (i.e., turn the



cache on or off).



Max entries for a node cache of a repository.



Time-to-live for entries in a node cache of a repository.



Password and username for a repository.



Read-only attribute for the repository.



Class name of the repository implementation.



Additional key/value properties.











FIG. 3 is an illustration of objects used in connecting a repository to a VCR in one embodiment of the invention. In one embodiment, objects implementing API interface RepositoryManager 302 can serve as a representation of a VCR from an application program's standpoint. A RepositoryManager connect( ) method attempts to connect all available repositories with a current user's credentials to the VCR. By way of a non-limiting example, credentials in one embodiment can be based on the Java™ Authentication and Authorization Service (available from Sun Microsystems, Inc.). Those of skill in the art will recognize that many authorization schemes are possible without departing from the scope and spirit of the present embodiment. An SPI Repository object 306-310 represents each available content repository 312-316. The RepositoryManager 302 includes an object that invokes a connect( ) method on a set of Repository objects 306-310. In one embodiment, a RepositorySession object (not shown) can be instantiated for each content repository to which a connection is attempted. In one embodiment, the RepositoryManager connect( ) method can return an array of the RepositorySessions to the application program, one for each repository for which a connection was attempted. Any error in the connection procedure can be described by the RepositorySession object's state. In another embodiment, the RepositoryManager connect( ) method can connect to a specific repository using a current user's credentials and a given repository name. In one embodiment, the name of a repository can be a URI (uniform resource identifier).



FIG. 4 is an exemplary content model in one embodiment of the invention. The content model is shared between the API and the SPI. Each box in FIG. 2 represents a class or an interface. Hollow tipped arrows connecting boxes indicate inheritance relationships wherein the class/interface from which the arrows emanate inherit from the class/interface to which the arrows point. Solid tipped arrows indicate that the objects of the class/interface from which the arrows emanate can contain or have references (e.g., pointers or addresses) to objects of the class/interface to which the arrows point. In one embodiment, each object in a VCR has an identifier that uniquely identifies it. An identifier can be represented by an ID 400 (or id). An id can contain the name of a content repository and a unique id provided to it by the repository. In one embodiment, the id class/interface can be made available through a common super class/interface 414 that can provide services such as serialization, etc.


In one embodiment, content and hierarchy nodes can be represented by a Node 402 (or node). A node has a name, an id, and can also include a path that uniquely specifies a node's location in the VCR hierarchy. By way of a non-limiting example, the path can be in a Unix-like directory path format such as ‘/a/b/c’ where ‘/’ is a federated root, ‘a’ is a repository, ‘b’ is a node in the ‘a’ repository, and ‘c’ is the node's name. The Node class provides methods by with a node's parent and children can be obtained. This is useful for applications and tools that need to traverse the VCR hierarchy (e.g., browsers). Nodes can be associated with zero or more Property 404 objects (or properties). A property can have a name and zero or more values 406. In one embodiment, a property's name is unique relative to the node to which the property is associated. A Value 406 can represent any value, including but not limited to binary, Boolean, date/time, floating point, integer or string values. If a property has more than one value associated with it, it is referred to as “multi-valued”.


A node's properties can be described by a schema. A schema can be referred to as “metadata” since it does not constitute the content (or “data”) of the VCR per se. Schemas can be represented by an ObjectClass 408 object and zero or more PropertyDefinition 410 objects. An ObjectClass has a schema name that uniquely identifies it within a content repository. A node can refer to a schema using the ObjectClass name. In another embodiment, a content node can define its own schema by referencing an ObjectClass object directly. In one embodiment, there is one PropertyDefinition object for each of a node's associated Property objects. PropertyDefinition objects define the shape or type of properties. Repositories and tools that operate on VCRs, such as hierarchical browsers, can utilize schemas. By way of a non-limiting example, a hierarchy node's schema could be used to provide information regarding its children or could be used to enforce a schema on them. By way of a further non-limiting example, a VCR browser could use a content node's schema in order to properly display the node's values.


In one embodiment, a PropertyDefinition can have a name and can describe a corresponding property's data type (e.g., binary, Boolean, string, double, calendar, long, reference to an external data source, etc.), whether it is required, whether it is read-only, whether it provides a default value, and whether it specifies a property choice type. A property choice can indicate if a property is a single unrestricted value, a single restricted value, a multiple unrestricted value, or a multiple restricted value. Properties that are single have only one value whereas properties that are multiple can have more than one value. If a property is restricted, its value(s) are chosen from a finite set of values. But if a property is unrestricted, any value(s) can be provided for it. PropertyChoice objects 412 can be associated with a PropertyDefinition object to define a set of value choices in the case where the PropertyDefinition is restricted. A choice can be designated as a default value, but only one choice can be a default for a given PropertyDefinition.


A PropertyDefinition object may also be designated as a primary property. By way of a non-limiting example, when a schema is associated with a node, the primary property of a node can be considered its default content. The is Primary( ) method of the PropertyDefinition class returns true if a PropertyDefinition object is the primary PropertyDefinition. By way of a further non-limiting example, if a node contained a binary property to hold an image, it could also contain a second binary property to represent a thumbnail view of the image. If the thumbnail view was the primary property, software applications such as browser could display it by default.



FIG. 5 is an exemplary service model in one embodiment of the invention. Each box in FIG. 5 represents a class or an interface. A dashed arrow indicates that the interface from which the arrow emanates can produce at run-time objects implementing the classes to which the arrow points. A content repository's implementation of the SPI is responsible for mapping operations on the content model to the particulars of a given content repository. Repository interface 500 represents a content repository and facilitates connecting to it. The Repository has a connect( ) method that returns an object of type Ticket 502 (or ticket) if a user is authenticated by the repository. In one embodiment, tickets are intended to be light-weight objects. As such, one or more may be created and possibly cached for each client/software application accessing a given repository.


A ticket can utilize a user's credentials to authorize a service. In one embodiment, a ticket can be the access point for the following service interfaces: NodeOps 508, ObjectClassOps 506, and SearchOps 510. An application program can obtain objects that are compatible with these interfaces through the API RepositoryManager class. The NodeOps interface provides CRUD methods for nodes in the VCR. Nodes can be operated on based on their id or through their path in the node hierarchy. Table 2 summarizes NodeOp class functionality exposed in the API.









TABLE 2





NodeOps Functionality


NodeOps FUNCTIONALITY















Update a given node's properties and property definitions.


Copy a given node to a new location in a given hierarchy along with all


its descendants.


Create a new content node underneath a given parent.


Create a new hierarchy node underneath a given parent.


Perform a full cascade delete on a given node.


Retrieve all the nodes in a given node's path including itself.


Retrieve content node children for the given parent node.


Retrieve hierarchy node children for the given parent node.


Retrieve a node based on its ID.


Retrieve a node based on its path.


Retrieve the children nodes for the given hierarchy node.


Retrieve the parent nodes for the given hierarchy node.


Retrieve all the nodes with a given name.


Retrieve the Binary data for given node and property ids.


Moves a node to a new location in the hierarchy along with all its


descendants.


Remove the ObjectClass from a given node.


Renames a given node and implicitly all of its descendants paths.


Get an iterator object which can be used to iterate over a hierarchy.










FIG. 6 is an illustration of NodeOps service interaction in one embodiment of the invention. Application 600 utilizes a NodeOps object 602 provided by the API, which in turn utilizes one or more NodeOps objects 606-610 provided by an SPI Ticket. A NodeOps object represents each repository 612-616. When the API NodeOps 602 receives a request to perform an action, it maps the request to one or more SPI NodeOps objects 606-610 which in turn fulfill the request using their associated repositories. In this way, applications and libraries utilizing the API see a the VCR rather than individual content repositories.


As with the NodeOps service, there is one SPI ObjectClassOps object per repository and a single API ObjectClassOps object. The API ObjectClassOps object maps requests to one or more SPI ObjectClassOps which in turn fulfill the requests using their respective repositories. Through this service, ObjectClass and PropertyDefinition objects can be operated on based on their id or through their path in the node hierarchy. Table 3 summarizes ObjectClassOps class functionality exposed in the API.









TABLE 3





ObjectClassOps Functionality


ObjectClassOps FUNCTIONALITY















Create an ObjectClass, create PropertyDefinition(s) and associate them


with the ObjectClass.


Add a given PropertyDefinition to an ObjectClass.


Delete an ObjectClass.


Delete a PropertyDefinition.


Retrieve an ObjectClass with a given id.


Retrieve all ObjectClass(es) available for all content repositories a


given user is currently authenticated for.


Retrieve all of the ObjectClass(es) available for a given content


repository.


Retrieve a BinaryValue for the given PropertyChoice.


Retrieve a PropertyDefinition.


Retrieve all Property Definitions for the given ObjectClass.


Rename the given ObjectClass.


Updates the given PropertyDefinition.









As with the NodeOps and ObjectClassOps services, there is one SPI SearchOps object per repository and a single API SearchOps object. The API SearchOps object maps requests to one or more SPI SearchOps, which in turn fulfill the requests using their respective repositories. Among other things, the SearchOps services allows applications and libraries to search for properties and/or values throughout the entire VCR. In one embodiment, searches can be conducted across all Property, Value, BinaryValue, ObjectClass, PropertyChoice and PropertyDefinitions objects in the VCR. Search expressions can include but are not limited to one or more logical expressions, Boolean operators, nested expressions, object names, function calls, mathematical functions, mathematical operators, string operators, image operators, and Structured Query Language (SQL). Table 4 summarizes SearchOps class functionality exposed in the API.









TABLE 4





Exemplary SearchOps Functionality


SearchOps FUNCTIONALITY

















Flushes all nodes inside a content cache.



Flushes a specified node from a content cache.



Performs a search with the given search expression.



Updates a content cache's attributes.



Updates a content cache's active state.



Updates a content cache's max entries.



Updates a content cache's time-to-live attribute.











FIG. 7 is an illustration of a VCR browser in one embodiment of the invention. A VCR browser 700 can include one or more tools built atop the API and has a graphical user interface (GUI). In one embodiment, the browser can be rendered using Microsoft Windows® (available from Microsoft, Corp.). In yet another embodiment, the browser can be implemented as a web portal. Browser window 700 includes a navigation pane 702 and a context-sensitive editor window 704. The navigation pane displays a hierarchical representation of a VCR having one content repository (“BEA Repository”) which itself has four hierarchy nodes (“HR”, “Images”, “Marketing”, and “Products”). Selection of a hierarchy node can cause its children to be rendered beneath it in the navigation pane and cause an appropriate editor to be displayed in the editor window. Selection may be accomplished by any means, including but not limited to mouse or keyboard input, voice commands, physical gestures, etc. In this case, the VCR 706 is selected and a repository configuration editor is displayed in the editor window. The editor allows a user to change the configuration parameters (see Table 1) of the VCR. In one embodiment, configuration parameters are manipulated via Java Management Extensions (see FIG. 1).



FIG. 8 is an illustration of a content editor in one embodiment of the invention. Navigation pane 802 is in “content” mode 812 such that it selectively filters out nodes that define only schemas. Content node 806 (“Laptop”) has been selected. Node 806 is a child of hierarchy node “Products”, which itself is a child of repository “BEA Repository”. Selection of node 806 causes a corresponding content node editor to be rendered in editor window 804. The editor displays the current values for the selected node. The content type 814 indicates that the schema for this node is named “product”. In this example, the node has five properties: “Style”, “Description”, “Color”, “SKU” and “Image”. A user is allowed to change the value associated with these properties and update the VCR (via the update button 808), or remove the node from the VCR (via the remove button 810).



FIG. 9 is an illustration of a schema editor in one embodiment of the invention. Navigation pane 902 is in “type” mode 910 such that it only displays nodes that have schemas but no content. Schema node 906 (“product”) has been selected. Node 906 is a child of repository “BEA Repository”. Selection of node 906 causes a corresponding schema editor to be rendered in editor window 904. The editor displays the current schema for the selected node (e.g., derived from ObjectClass, PropertyDefinition, PropertyChoice objects). In this example, the node has five property definitions: “Style”, “Description”, “Color”, “SKU” and “Image”. For each property, the editor displays an indication of whether it is the primary property, its data type, its default value, and whether it is required. A property can be removed from a schema by selecting the property's delete button 912. A property can be added by selecting the “add property” button 908. A property's attributes can be changed by selecting its name 914 in the editor window or the navigation pane 906 (see FIG. 10).



FIG. 10 is an illustration of a property editor in one embodiment of the invention. The schema named “product” is being edited. Schema properties definitions are listed beneath their schema name in the navigation pane 1002. Schema property 1008 (“color”) has been selected. The editor window 1004 displays the property's current attributes. The name of the attribute (e.g., “color”), whether the attribute is required or not, whether it is read-only, whether it is the primary property, its data type, default value(s), and whether the property is single/multiple restricted/unrestricted can be modified. Changes to the a property's attributes can be saved by selecting the update button 1006.


One embodiment may be implemented using a conventional general purpose or a specialized digital computer or microprocessor(s) programmed according to the teachings of the present disclosure, as will be apparent to those skilled in the computer art. Appropriate software coding can readily be prepared by skilled programmers based on the teachings of the present disclosure, as will be apparent to those skilled in the software art. The invention may also be implemented by the preparation of integrated circuits or by interconnecting an appropriate network of conventional component circuits, as will be readily apparent to those skilled in the art.


One embodiment includes a computer program product which is a storage medium (media) having instructions stored thereon/in which can be used to program a computer to perform any of the features presented herein. The storage medium can include, but is not limited to, any type of disk including floppy disks, optical discs, DVD, CD-ROMs, microdrive, and magneto-optical disks, ROMs, RAMs, EPROMs, EEPROMs, DRAMs, VRAMs, flash memory devices, magnetic or optical cards, nanosystems (including molecular memory ICs), or any type of media or device suitable for storing instructions and/or data.


Stored on any one of the computer readable medium (media), the present invention includes software for controlling both the hardware of the general purpose/specialized computer or microprocessor, and for enabling the computer or microprocessor to interact with a human user or other mechanism utilizing the results of the present invention. Such software may include, but is not limited to, device drivers, operating systems, execution environments/containers, and user applications.


The foregoing description of the preferred embodiments of the present invention has been provided for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations will be apparent to the practitioner skilled in the art. Embodiments were chosen and described in order to best describe the principles of the invention and its practical application, thereby enabling others skilled in the art to understand the invention, the various embodiments and with various modifications that are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims and their equivalents.

Claims
  • 1. A method for providing access to content in federated repositories, said method comprising: accessing a first content repository that contains multiple types of information in a searchable format;accessing a second content repository that contains multiple types of information in a searchable format that is different from said first content repository;integrating the first content repository and the second content repository byimplementing a shared content model that represents combined content across both the first content repository and the second content repository, wherein the shared content model includes one or more nodes; andproviding a content cache for interacting with the shared content model, said content cache used to buffer one or more of search results and recently accessed nodes.
  • 2. The method of claim 1 wherein the content cache includes a node cache that provides access to the recently accessed nodes of the shared content model and a binary cache that provides access to data associated with each node in said node cache.
  • 3. The method of claim 1, further comprising: providing a configuration facility that enables one or more of applications, tools or libraries to configure the content cache.
  • 4. The method of claim 1, wherein the content cache has at least one parameter that controls one or more of the following: active state for a binary cache of a repository;maximum number of entries for a binary cache of the repository;time-to-live for entries in a binary cache of the repository;active state for a node cache of the repository;maximum entries for a node cache of the repository;time-to-live for entries in a node cache of the repository;password and user name for the repository;read-only attribute for the repository;class name of the repository implementation; andadditional key/value properties.
  • 5. The method of claim 1, wherein the nodes within the shared content model further include: at least one content node that contains a set of properties associating a name with a value; andat least one hierarchy node that serves as a container for other nodes within the shared content model.
  • 6. The method of claim 1, wherein each node within the shared content model has a schema associated therewith, said schema describing the data type of one or more of the node's properties.
  • 7. The method of claim 1, further comprising: implementing a node operations interface to access a repository, said node operations interface providing create, read, update and delete (CRUD) methods for said nodes in the shared content model.
  • 8. The method of claim 1, wherein integrating the first content repository and the second content repository further includes: connecting to each content repository by using a set of credentials.
  • 9. The method of claim 1, wherein integrating the first content repository and the second content repository further includes: instantiating a repository session object for each content repository for which a connection is attempted.
  • 10. A system for providing access to content in federated repositories, said system comprising: a first content repository that contains multiple types of information in a searchable format;a second content repository that contains multiple types of information in a searchable format that is different from said first content repository;a shared content model used to integrated the first content repository with the second content repository by representing combined content across both the first content repository and the second content repository, said shared content model including one or more nodes; anda content cache used to interact with the shared content model, said content cache used to buffer one or more of search results and recently accessed nodes.
  • 11. The system of claim 10 wherein the content cache includes a node cache that provides access to the recently accessed nodes of the shared content model and a binary cache that provides access to data associated with each node in said node cache.
  • 12. The system of claim 10, further comprising: a configuration facility that enables one or more of applications, tools or libraries to configure the content cache.
  • 13. The system of claim 10, wherein the content cache has at least one parameter that controls one or more of the following: active state for a binary cache of a repository;maximum number of entries for a binary cache of the repository;time-to-live for entries in a binary cache of the repository;active state for a node cache of the repository;maximum entries for a node cache of the repository;time-to-live for entries in a node cache of the repository;password and user name for the repository;read-only attribute for the repository;class name of the repository implementation; andadditional key/value properties.
  • 14. The system of claim 10, wherein the nodes within the shared content model further include: at least one content node that contains a set of properties associating a name with a value; andat least one hierarchy node that serves as a container for other nodes within the shared content model.
  • 15. The system of claim 10, wherein each node within the shared content model has a schema associated therewith, said schema describing the data type of one or more of the node's properties.
  • 16. The system of claim 10, further comprising: a node operations interface used to access a repository, said node operations interface providing create, read, update and delete (CRUD) methods for said nodes in the shared content model.
  • 17. The system of claim 10, wherein integrating the first content repository and the second content repository further includes: connecting to each content repository by using a set of credentials.
  • 18. The system of claim 10, wherein integrating the first content repository and the second repository further includes: instantiating a repository session object for each content repository for which a connection is attempted.
  • 19. A non-transitory computer readable storage medium carrying one or more sequences of instructions for providing access to content in federated repositories, which instructions when executed by one or more processors cause the one or more processors to carry out the steps of: accessing a first content repository that contains multiple types of information in a searchable format;accessing a second content repository that contains multiple types of information in a searchable format that is different from said first content repository;integrating the first content repository and the second content repository by implementing a shared content model that represents combined content across both the first content repository and the second content repository, wherein the shared content model includes one or more nodes; andproviding a content cache for interacting with the shared content model, said content cache used to buffer one or more of search results and recently accessed nodes.
CLAIM OF PRIORITY

This application is a Continuation of U.S. application Ser. No. 11/325,006 entitled FEDERATED MANAGEMENT OF CONTENT REPOSITORIES, by James Owen et al., filed Jan. 3, 2006, which is a Continuation of U.S. application Ser. No. 10/618,513 entitled FEDERATED MANAGEMENT OF CONTENT REPOSITORIES, by James Owen et al., filed Jul. 11, 2003 issued as U.S. Pat. No. 7,293,286, on Nov. 6, 2007, which claims priority under 35 U.S.C. section 119(e) to U.S. Provisional Patent Application No. 60/449,154 entitled SYSTEM AND METHOD FOR A FEDERATED CONTENT REPOSITORY, by James Owen, et al., filed on Feb. 20, 2003 and U.S. Provisional Patent Application No. 60/451,174 entitled SYSTEMS AND METHODS FOR PORTAL AND WEB SERVER ADMINISTRATION, by Christopher Bales, et al., filed on Feb. 28, 2003. This application is related to the following co-pending applications which are each hereby incorporated by reference in their entirety: U.S. application Ser. No. 10/618,519 entitled VIRTUAL REPOSITORY CONTENT MODEL, by James Owen, et al., filed on Jul. 11, 2003; U.S. application Ser. No. 10/618,380 entitled VIRTUAL REPOSITORY COMPLEX CONTENT MODEL, by James Owen, et al., filed Jul. 11, 2003, issued as U.S. Pat. No. 7,415,478 on Aug. 19, 2008; U.S. application Ser. No. 10/618,495 entitled SYSTEM AND METHOD FOR A VIRTUAL CONTENT REPOSITORY, by James Owen, et al., filed Jul. 11, 2003; U.S. application Ser. No. 10/618,494 entitled VIRTUAL CONTENT REPOSITORY APPLICATION PROGRAM INTERFACE, by James Owen, et al., filed Jul. 11, 2003; U.S. application Ser. No. 10/619,165 entitled SYSTEM AND METHOD FOR SEARCHING A VIRTUAL REPOSITORY CONTENT, by Gregory Smith, filed Jul. 11, 2003; and U.S. application Ser. No. 10/618,379, VIRTUAL CONTENT REPOSITORY BROWSER, by Jalpesh Patadia et al., filed Jul. 11, 2003.

US Referenced Citations (298)
Number Name Date Kind
5047918 Schwartz et al. Sep 1991 A
5173919 Schmidl et al. Dec 1992 A
5173939 Abadi et al. Dec 1992 A
5237614 Weiss Aug 1993 A
5335345 Frieder et al. Aug 1994 A
5347653 Flynn et al. Sep 1994 A
5355474 Thuraisingham et al. Oct 1994 A
5369702 Shanton Nov 1994 A
5426747 Weinreb et al. Jun 1995 A
5475834 Anglin et al. Dec 1995 A
5481700 Thuraisingham et al. Jan 1996 A
5544322 Cheng et al. Aug 1996 A
5557747 Rogers et al. Sep 1996 A
5757669 Christie et al. May 1998 A
5797128 Birnbaum et al. Aug 1998 A
5806066 Golshani et al. Sep 1998 A
5806078 Hug et al. Sep 1998 A
5813009 Johnson et al. Sep 1998 A
5825883 Archibald et al. Oct 1998 A
5826000 Hamilton Oct 1998 A
5826268 Schaefer et al. Oct 1998 A
5848396 Gerace Dec 1998 A
5867667 Butman et al. Feb 1999 A
5872928 Lewis et al. Feb 1999 A
5889953 Thebaut et al. Mar 1999 A
5918210 Rosenthal et al. Jun 1999 A
5941947 Brown et al. Aug 1999 A
5950195 Stockwell et al. Sep 1999 A
5954798 Shelton et al. Sep 1999 A
5956400 Chaum et al. Sep 1999 A
5966707 Van Huben et al. Oct 1999 A
5987469 Lewis et al. Nov 1999 A
5987611 Freund Nov 1999 A
5991877 Luckenbaugh Nov 1999 A
6005571 Pachauri Dec 1999 A
6006194 Merel Dec 1999 A
6029144 Barrett et al. Feb 2000 A
6029182 Nehab et al. Feb 2000 A
6054910 Tada et al. Apr 2000 A
6055515 Consentino et al. Apr 2000 A
6055637 Hudson et al. Apr 2000 A
6058392 Sampson et al. May 2000 A
6073242 Hardy et al. Jun 2000 A
6088679 Barkley Jul 2000 A
6098173 Elgressy et al. Aug 2000 A
6105035 Monge et al. Aug 2000 A
6108687 Craig Aug 2000 A
6112024 Almond et al. Aug 2000 A
6122647 Horowitz et al. Sep 2000 A
6141010 Hoyle Oct 2000 A
6141686 Jackowski et al. Oct 2000 A
6148333 Guedalia et al. Nov 2000 A
6154844 Touboul et al. Nov 2000 A
6157924 Austin Dec 2000 A
6158010 Moriconi et al. Dec 2000 A
6167407 Nachenberg et al. Dec 2000 A
6167445 Gai et al. Dec 2000 A
6170009 Mandal et al. Jan 2001 B1
6182226 Reid et al. Jan 2001 B1
6182277 Degroot et al. Jan 2001 B1
6185587 Bernardo et al. Feb 2001 B1
6202066 Barkley et al. Mar 2001 B1
6202157 Brownlie et al. Mar 2001 B1
6202207 Donohue Mar 2001 B1
6209101 Mitchem et al. Mar 2001 B1
6216134 Heckerman et al. Apr 2001 B1
6216231 Stubblebine Apr 2001 B1
6226745 Wiederhold May 2001 B1
6241608 Torango Jun 2001 B1
6243747 Lewis et al. Jun 2001 B1
6253321 Nikander et al. Jun 2001 B1
6256031 Meijer et al. Jul 2001 B1
6260050 Yost et al. Jul 2001 B1
6269393 Yost et al. Jul 2001 B1
6269456 Hodges et al. Jul 2001 B1
6275941 Saito et al. Aug 2001 B1
6285366 Ng et al. Sep 2001 B1
6285985 Horstmann Sep 2001 B1
6292900 Ngo et al. Sep 2001 B1
6295607 Johnson Sep 2001 B1
6301613 Ahlstrom et al. Oct 2001 B1
6308163 Du et al. Oct 2001 B1
6317868 Grimm et al. Nov 2001 B1
6327594 Van Huben et al. Dec 2001 B1
6327618 Ahlstrom et al. Dec 2001 B1
6327628 Anuff et al. Dec 2001 B1
6339423 Sampson et al. Jan 2002 B1
6339826 Hayes et al. Jan 2002 B2
6341352 Child et al. Jan 2002 B1
6353886 Howard et al. Mar 2002 B1
6360363 Moser et al. Mar 2002 B1
6363400 Chtchetkine et al. Mar 2002 B1
6377973 Gideon Apr 2002 B2
6381579 Gervais Apr 2002 B1
6385627 Cragun May 2002 B1
6393474 Eichert et al. May 2002 B1
6397222 Zellweger May 2002 B1
6397231 Salisbury et al. May 2002 B1
6412070 Van Dyke et al. Jun 2002 B1
6412077 Roden et al. Jun 2002 B1
6418448 Sarkar Jul 2002 B1
6430556 Goldberg et al. Aug 2002 B1
6457007 Kikuchi et al. Sep 2002 B1
6460052 Thomas et al. Oct 2002 B1
6460141 Olden Oct 2002 B1
6466239 Ishikawa Oct 2002 B2
6473791 Al-Ghosein et al. Oct 2002 B1
6477543 Huang Nov 2002 B1
6477575 Koeppel et al. Nov 2002 B1
6484177 Van Huben et al. Nov 2002 B1
6484261 Wiegel Nov 2002 B1
6487594 Bahlmann Nov 2002 B1
6493732 Aoyama et al. Dec 2002 B2
6510513 Danieli Jan 2003 B1
6519647 Howard et al. Feb 2003 B1
6530024 Proctor Mar 2003 B1
6539375 Kawasaki Mar 2003 B2
6571247 Danno et al. May 2003 B1
6574736 Andrews Jun 2003 B1
6581054 Bogrett Jun 2003 B1
6581071 Gustman et al. Jun 2003 B1
6584454 Hummel, Jr. et al. Jun 2003 B1
6587849 Mason et al. Jul 2003 B1
6587876 Mahon et al. Jul 2003 B1
6615218 Mandal et al. Sep 2003 B2
6618806 Brown et al. Sep 2003 B1
6631386 Arun et al. Oct 2003 B1
6633538 Tanaka et al. Oct 2003 B1
6654747 Van Huben et al. Nov 2003 B1
6665677 Wotring et al. Dec 2003 B1
6684369 Bernardo et al. Jan 2004 B1
6697805 Choquier et al. Feb 2004 B1
6721888 Liu et al. Apr 2004 B1
6732144 Kizu et al. May 2004 B1
6735586 Timmons May 2004 B2
6735701 Jacobson May 2004 B1
6738789 Multer May 2004 B2
6751659 Fenger et al. Jun 2004 B1
6754672 McLauchlin Jun 2004 B1
6757698 McBride et al. Jun 2004 B2
6769095 Brassard et al. Jul 2004 B1
6769118 Garrison et al. Jul 2004 B2
6779002 Mwaura Aug 2004 B1
6789202 Ko et al. Sep 2004 B1
6834284 Acker et al. Dec 2004 B2
6853997 Wotring et al. Feb 2005 B2
6854035 Dunham et al. Feb 2005 B2
6856999 Flanagin et al. Feb 2005 B2
6857012 Sim et al. Feb 2005 B2
6865549 Connor Mar 2005 B1
6868425 Bergstraesser et al. Mar 2005 B1
6880005 Bell et al. Apr 2005 B1
6889222 Zhao May 2005 B1
6901403 Bata et al. May 2005 B1
6904454 Stickler Jun 2005 B2
6912538 Stapel et al. Jun 2005 B2
6918088 Clark et al. Jul 2005 B2
6920457 Pressmar Jul 2005 B2
6922695 Skufca et al. Jul 2005 B2
6925487 Kim Aug 2005 B2
6934934 Osborne et al. Aug 2005 B1
6950825 Chang et al. Sep 2005 B2
6957261 Lortz Oct 2005 B2
6961897 Peel et al. Nov 2005 B1
6965999 Fox et al. Nov 2005 B2
6970876 Hotti et al. Nov 2005 B2
6978379 Goh et al. Dec 2005 B1
6985905 Prompt et al. Jan 2006 B2
6985915 Somalwar et al. Jan 2006 B2
6988138 Alcorn et al. Jan 2006 B1
7003578 Kanada et al. Feb 2006 B2
7013485 Brown et al. Mar 2006 B2
7020641 Leong et al. Mar 2006 B2
7035857 Reeves et al. Apr 2006 B2
7035879 Shi et al. Apr 2006 B2
7035944 Fletcher et al. Apr 2006 B2
7039923 Kumar et al. May 2006 B2
7043472 Aridor May 2006 B2
7047522 Dixon et al. May 2006 B1
7051316 Charisius et al. May 2006 B2
7054910 Nordin et al. May 2006 B1
7058958 Shutt et al. Jun 2006 B1
7062490 Adya et al. Jun 2006 B2
7062511 Poulsen Jun 2006 B1
7076652 Ginter et al. Jul 2006 B2
7080000 Cambridge Jul 2006 B1
7085755 Bluhm et al. Aug 2006 B2
7089584 Sharma Aug 2006 B1
7093200 Schreiber et al. Aug 2006 B2
7093261 Harper et al. Aug 2006 B1
7093283 Chen et al. Aug 2006 B1
7096224 Murthy et al. Aug 2006 B2
7100195 Underwood Aug 2006 B1
7117207 Kerschberg et al. Oct 2006 B1
7124192 High et al. Oct 2006 B2
7124413 Klemm et al. Oct 2006 B1
7146564 Kim et al. Dec 2006 B2
7174563 Brownlie et al. Feb 2007 B1
7185192 Kahn Feb 2007 B1
7219140 Marl et al. May 2007 B2
7272625 Hannel et al. Sep 2007 B1
7278106 Mason Oct 2007 B1
7478096 Margolus et al. Jan 2009 B2
7533115 Chou et al. May 2009 B2
20010032128 Kepecs Oct 2001 A1
20010034733 Prompt et al. Oct 2001 A1
20010034771 Hutsch et al. Oct 2001 A1
20020005867 Gvily Jan 2002 A1
20020019827 Shiman et al. Feb 2002 A1
20020029296 Anuff et al. Mar 2002 A1
20020052849 McCutchen et al. May 2002 A1
20020059394 Sanders May 2002 A1
20020062451 Scheidt et al. May 2002 A1
20020067370 Forney et al. Jun 2002 A1
20020069261 Bellare et al. Jun 2002 A1
20020103818 Amberden Aug 2002 A1
20020107913 Rivera et al. Aug 2002 A1
20020120685 Srivastava et al. Aug 2002 A1
20020124053 Adams et al. Sep 2002 A1
20020135617 Samid Sep 2002 A1
20020143819 Han et al. Oct 2002 A1
20020147645 Alao et al. Oct 2002 A1
20020152210 Johnson et al. Oct 2002 A1
20020152267 Lennon Oct 2002 A1
20020152279 Sollenberger et al. Oct 2002 A1
20020161903 Besaw Oct 2002 A1
20020169893 Chen et al. Nov 2002 A1
20020173971 Stirpe et al. Nov 2002 A1
20020174097 Rusch et al. Nov 2002 A1
20020178119 Griffin et al. Nov 2002 A1
20020184521 Lucovsky et al. Dec 2002 A1
20020188869 Patrick Dec 2002 A1
20020194267 Flesner et al. Dec 2002 A1
20030014442 Shiigi et al. Jan 2003 A1
20030032409 Hutcheson et al. Feb 2003 A1
20030037313 Halpern et al. Feb 2003 A1
20030046576 High et al. Mar 2003 A1
20030065681 Houston et al. Apr 2003 A1
20030065721 Roskind Apr 2003 A1
20030078972 Tapissier et al. Apr 2003 A1
20030097365 Stickler May 2003 A1
20030110448 Haut et al. Jun 2003 A1
20030126464 McDaniel et al. Jul 2003 A1
20030126558 Griffin Jul 2003 A1
20030135490 Barrett et al. Jul 2003 A1
20030135576 Bodin Jul 2003 A1
20030146937 Lee Aug 2003 A1
20030167315 Chowdhry et al. Sep 2003 A1
20030167455 Iborra et al. Sep 2003 A1
20030187956 Belt et al. Oct 2003 A1
20030204481 Lau Oct 2003 A1
20030212766 Giles et al. Nov 2003 A1
20030216938 Shour Nov 2003 A1
20030220913 Doganata et al. Nov 2003 A1
20030220963 Golovinsky et al. Nov 2003 A1
20040003071 Mathew et al. Jan 2004 A1
20040019650 Auvenshine Jan 2004 A1
20040024812 Park et al. Feb 2004 A1
20040030744 Rubin et al. Feb 2004 A1
20040030795 Hesmer et al. Feb 2004 A1
20040044648 Anfindsen et al. Mar 2004 A1
20040098467 Dewey et al. May 2004 A1
20040098470 Kurihara May 2004 A1
20040122897 Seelemann et al. Jun 2004 A1
20040125144 Yoon Jul 2004 A1
20040128559 Zurko et al. Jul 2004 A1
20040162905 Griffin Aug 2004 A1
20040167867 Owen et al. Aug 2004 A1
20040167880 Smith Aug 2004 A1
20040183831 Ritchy et al. Sep 2004 A1
20040193606 Arai et al. Sep 2004 A1
20040205473 Fisher et al. Oct 2004 A1
20040205653 Hadfield et al. Oct 2004 A1
20040230546 Rogers Nov 2004 A1
20040249867 Kraiss et al. Dec 2004 A1
20050015368 Payton et al. Jan 2005 A1
20050021502 Chen et al. Jan 2005 A1
20050021523 Farag Jan 2005 A1
20050044103 MacLeod et al. Feb 2005 A1
20050050184 Boden et al. Mar 2005 A1
20050060324 Johnson et al. Mar 2005 A1
20050060332 Bernstein et al. Mar 2005 A1
20050080814 Hailey et al. Apr 2005 A1
20050086206 Balasubramanian Apr 2005 A1
20050086286 Chi et al. Apr 2005 A1
20050097008 Ehring et al. May 2005 A1
20050102535 Patrick et al. May 2005 A1
20050102536 Patrick et al. May 2005 A1
20050198617 Kim et al. Sep 2005 A1
20050216462 Xiao Sep 2005 A1
20050257267 Williams et al. Nov 2005 A1
20060041661 Erikson et al. Feb 2006 A1
20060059107 Elmore et al. Mar 2006 A1
20060085412 Johnson et al. Apr 2006 A1
20060122882 Brown et al. Jun 2006 A1
20060184878 Argo et al. Aug 2006 A1
20060212796 Heuer et al. Sep 2006 A1
20070179954 Kudoh et al. Aug 2007 A1
Foreign Referenced Citations (5)
Number Date Country
1 256 889 Nov 2002 EP
0022547 Apr 2000 WO
0038078 Jun 2000 WO
0114962 Mar 2001 WO
0167285 Sep 2001 WO
Related Publications (1)
Number Date Country
20080320022 A1 Dec 2008 US
Provisional Applications (2)
Number Date Country
60449154 Feb 2003 US
60451174 Feb 2003 US
Continuations (2)
Number Date Country
Parent 11325006 Jan 2006 US
Child 12201872 US
Parent 10618513 Jul 2003 US
Child 11325006 US